Thu, 24 Jul 2008 23:14:12 BST CiteULike: Tag automatic http://www.citeulike.org/tag/automatic CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/zpinhead/article/1230104 <i>(12 Apr 2007)</i><br /><br />Information integration applications, such as mediators or mashups, that require access to information resources currently rely on users manually discovering and integrating them in the application. Manual resource discovery is a slow process, requiring the user to sift through results obtained via keyword-based search. Although search methods have advanced to include evidence from document contents, its metadata and the contents and link structure of the referring pages, they still do not adequately cover information sources -- often called “the hidden Web”-- that dynamically generate documents in response to a query. The recently popular social bookmarking sites, which allow users to annotate and share metadata about various information sources, provide rich evidence for resource discovery. In this paper, we describe a probabilistic model of the user annotation process in a social bookmarking system del.icio.us. We then use the model to automatically find resources relevant to a particular information domain. Our experimental results on data obtained from del.icio.us show this approach as a promising method for helping automate the resource discovery task. Exploiting Social Annotation for Automatic Resource Discovery Anon Plangprasopchok Kristina Lerman (12 Apr 2007) 2007-04-16T15:15:35-00:00 2007 annotation automatic discovery resource social http://www.citeulike.org/user/ZiqiZhang/article/1222371 <i>(1999)</i><br /><br />A novel technique for automatic thesaurus construction is proposed. It is based on the complementary use of two tools: (1) a Term Extraction tool that acquires term candidates from tagged corpora through a shallow grammar of noun phrases, and (2) a Term Clustering tool that groups syntactic variants (insertions). Experiments performed on corpora in three technical domains yield clusters of term candidates with precision rates between 93% and 98%. In Proccedings, 9th Conference of... Term Extraction + Term Clustering: An Integrated Platform for Computer-Aided Terminology D Bourigault C Jacquemin (1999) 2007-04-12T14:45:48-00:00 1999 automatic recognition term http://www.citeulike.org/user/ZiqiZhang/article/1222367 <i>(1996), pp. 49-66.</i><br /><br />This paper presents an original method and its implementation to extract terminology from corpora by combining linguistic filters and statistical methods. Starting from a linguistic study of the terms of telecommunication domain, we designed a number of filters which enable us to obtain a first selection of sequences that may be considered as terms. Various statistical scores are applied to this selection and results are evaluated. This method has been applied to French and to English, but this ... Study and Implementation of Combined Techniques for Automatic Extraction of Terminology Béatrice Daille (1996), pp. 49-66. 2007-04-12T14:43:35-00:00 1996 49 66 The MIT Press automatic recognition term http://www.citeulike.org/user/ZiqiZhang/article/1222865 <i></i><br /><br />Multi-word terms are traditionally identified using statistical techniques or, more recently, using hybrid techniques combining statistics with shallow linguistic information. Approaches to word sense disambiguation and machine translation have taken advantage of contextual information in a more meaningful way, but terminology has rarely followed suit. We present an approach to term recognition which identifies salient parts of the context and measures their strength of association to relevant... Identifying Terms by their Family and Friends Diana Maynard Sophia Ananiadou 2007-04-12T20:28:18-00:00 automatic recognition term http://www.citeulike.org/user/ZiqiZhang/article/1158255 <i>Terminology, Vol. 3, No. 2. (1996), pp. 259-289.</i><br /><br />Following the growing interest in "corpus-based" approaches to computational linguistics, a number of studies have recently appeared on the topic of automatic term recognition or extraction. Because a successful term recognition method has to be based on proper insights into the nature of terms, studies of automatic term recognition not only contribute to the applications of computational linguistics but also to the theoretical foundation of terminology. Many studies on automatic term... Methods of automatic term recognition: a review Kyo Kageura Bin Umino Terminology, Vol. 3, No. 2. (1996), pp. 259-289. 2007-03-13T13:26:32-00:00 1996 Terminology 3 2 259 289 automatic recognition term http://www.citeulike.org/user/ZiqiZhang/article/1220947 <i>(2000)</i><br /><br />This chapter presents a new domain of research and development in Natural Language Processing (NLP) that is concerned with the representation, acquisition, and recognition of terms. Terms are pervasive in scientific and technical documents; their identification is a crucial issue for any application dealing with the analysis, understanding, generation, or translation of such documents. In particular, the ever-growing mass of specialized documentation available on-line, in industrial and... Term Extraction and Automatic Indexing C Jacquemin D Et (2000) 2007-04-11T15:56:38-00:00 2000 automatic recognition term http://www.citeulike.org/user/ZiqiZhang/article/1220927 <i></i><br /><br />Though the utility of domain Ontologies is now widely acknowledged in the IT (Information Technology) community, several barriers must be overcome before Ontologies become practical and useful tools. One important achievement would be to reduce the cost of identifying and manually entering several thousand-concept descriptions. This paper describes a text mining technique to aid an Ontology Engineer to identify the important concepts in a Domain Ontology. Identification of relevant terms to support the construction of Domain Ontologies Velardi 2007-04-11T15:48:48-00:00 automatic recognition term http://www.citeulike.org/user/ZiqiZhang/article/1220899 <i>(1994)</i><br /><br />In this paper, we make use of linguistic knowledge to identify certain noun phrases, both in English and French, which are likely to be terms. We then test and compare ent statistical scores to select the "good" ones among the candidate terms, and finally propose a statistical method to build correspondences of multi-words units across bmguages. Towards automatic extraction of monolingual and bilingual terminology B Daille E Gaussier J Lange (1994) 2007-04-11T15:21:11-00:00 1994 automatic recognition term http://www.citeulike.org/user/ville/article/300425 <i>(1988), pp. 135-144.</i> Automatic text indexing using complex identifiers Gerald Salton doi:10.1145/62506.62530 (1988), pp. 135-144. 2005-08-22T15:39:17-00:00 1988 135 144 ACM Press automatic indexing http://www.citeulike.org/user/ville/article/300416 <i>International Journal of Medical Informatics, Vol. 70, No. 2-3. (July 2003), pp. 255-263.</i><br /><br />Objective: The objective of this project is to investigate methods whereby a combination of speech recognition and automated indexing methods substitute for current transcription and indexing practices. Methods: We based our study on existing speech recognition software programs and on , a tool that extracts MeSH concepts from medical text in natural language and that is mainly based on a French medical lexicon and on the UMLS. For each document, the process consists of three steps: (1) dictation and digital audio recording, (2) speech recognition, (3) automatic indexing. The evaluation consisted of a comparison between the set of concepts extracted by after the speech recognition phase and the set of keywords manually extracted from the initial document. The method was evaluated on a set of 28 patient discharge summaries extracted from the MENELAS corpus in French, corresponding to in-patients admitted for coronarography. Results: The overall precision was 73% and the overall recall was 90%. Indexing errors were mainly due to word sense ambiguity and abbreviations. A specific issue was the fact that the standard French translation of MeSH terms lacks diacritics. A preliminary evaluation of speech recognition tools showed that the rate of accurate recognition was higher than 98%. Only 3% of the indexing errors were generated by inadequate speech recognition. Discussion: We discuss several areas to focus on to improve this prototype. However, the very low rate of indexing errors due to speech recognition errors highlights the potential benefits of combining speech recognition techniques and automatic indexing. Automatic concept extraction from spoken medical reports Andre Happe Bruno Pouliquen Anita Burgun Marc Cuggia Pierre Le Beux doi:10.1016/S1386-5056(03)00055-8 International Journal of Medical Informatics, Vol. 70, No. 2-3. (July 2003), pp. 255-263. 2005-08-22T15:21:42-00:00 2003 International Journal of Medical Informatics 70 2-3 255 263 automatic indexing http://www.citeulike.org/user/ville/article/300408 <i>Proc Annu Symp Comput Appl Med Care (1995), pp. 893-897.</i><br /><br />To facilitate networked discovery and information retrieval in the biomedical domain, we have designed a system for automatic assignment of Medical Subject Headings to documents retrieved from the World-Wide Web. Our prototype implementations show significant promise. We describe our methods and discuss the further development of a completely automated indexing tool called the "Web-MeSH Medibot." Automated MeSH indexing of the World-Wide Web. J Fowler S Maram V Kouramajian V Devadhar Proc Annu Symp Comput Appl Med Care (1995), pp. 893-897. 2005-08-22T15:11:14-00:00 1995 Proc Annu Symp Comput Appl Med Care 0195-4210 893 897 automatic indexing mesh http://www.citeulike.org/user/ville/article/293153 <i>SIGIR Forum, Vol. 31, No. 1. (1997), pp. 23-36.</i> A blueprint for automatic indexing G Salton doi:10.1145/263868.263871 SIGIR Forum, Vol. 31, No. 1. (1997), pp. 23-36. 2005-08-16T12:52:36-00:00 1997 SIGIR Forum 0163-5840 31 1 23 36 ACM Press automatic indexing http://www.citeulike.org/user/ville/article/261435 <i>(1998), pp. 132-139.</i> A hierarchical approach to the automatic categorization of medical documents Luciano de Lima Alberto Laender Berthier Ribeiro-Neto doi:10.1145/288627.288649 (1998), pp. 132-139. 2005-07-21T10:59:56-00:00 1998 132 139 ACM Press automatic mesh http://www.citeulike.org/user/ville/article/240553 <i>Medinfo, Vol. 11, No. Pt 1. (2004), pp. 356-360.</i><br /><br />To realize the potential of the Internet as a source of valuable healthcare information, for the general public, patients or practitioners, it is imperative to establish a validation system based on standards of quality. The WRAPIN project (World-wide online Reliable Advice to Patients and Individuals) from the European Community has this ambitious goal. WRAPIN is a federating system for medical information with an editorial policy of intelligently sharing quality and professional information. The WRAPIN project has two main axes: the efficient and intelligent search of information and the assertion of the trustworthiness of content. This article presents the scientific challenges involved in extracting the knowledge from text-based information in order to better manage the knowledge and the rest of the retrieval proc-ess. Our innovative approach is to efficiently extract MeSH terms from the analyzed documents exploiting UMLS knowledge sources. A benefit has been measured when comparing extraction results. Even if the evaluation is made with a limited corpus, this research work proposes heuristics that can be validated to the whole biomedical domain, and possibly enhanced by the adjunction of other methods. WRAPIN: new generation health search engine using UMLS knowledge sources for MeSH term extraction from health documentation. A Gaudinat M Joubert S Aymard L Falco C Boyer M Fieschi Medinfo, Vol. 11, No. Pt 1. (2004), pp. 356-360. 2005-06-30T06:52:10-00:00 2004 Medinfo 1569-6332 11 Pt 1 356 360 automatic mesh http://www.citeulike.org/user/ville/article/270749 <i>Lecture Notes in Computer Science, Vol. 2417 (January 2002), 609.</i><br /><br /> This paper proposes an <SPAN style='background:silver;'>automatic</SPAN> <SPAN style='background:silver;'>indexing</SPAN> method named PAI (Priming Activation <SPAN style='background:silver;'>Indexing</SPAN>) that extracts keywords expressing the author's main point from a document. The basic idea is that since the author writes a document emphasizing his/her main point, impressive terms born in the mind of the reader could represent the asserted keywords. Our approach employs a spreading activation model. Automatic Indexing Based on Term Activities Naohiro Matsumura Yukio Ohsawa Mitsuru Ishizuka Lecture Notes in Computer Science, Vol. 2417 (January 2002), 609. 2005-08-01T12:12:13-00:00 2002 Lecture Notes in Computer Science 2417 609 automatic http://www.citeulike.org/user/ville/article/270732 <i>Commun. ACM, Vol. 18, No. 11. (November 1975), pp. 613-620.</i> A vector space model for automatic indexing G Salton A Wong CS Yang doi:10.1145/361219.361220 Commun. ACM, Vol. 18, No. 11. (November 1975), pp. 613-620. 2005-08-01T11:57:21-00:00 1975 Commun. ACM 0001-0782 18 11 613 620 ACM Press automatic http://www.citeulike.org/user/ville/article/300470 <i>Information Processing & Management, Vol. In Press, Corrected Proof</i><br /><br />The profusion of online resources calls for tools and methods to help Internet users find precisely what they are looking for. Quality controlled gateway CISMeF provides such services for health resources. However, the human cost of maintaining and updating the catalogue are increasingly high. This paper presents the automatic indexing system currently developed in the CISMeF team to be used as such for preliminary indexing, or after human reviewing for the final indexing. The system architecture, using the INTEX platform for MeSH term extraction is detailed. The results of a first evaluation tend to indicate that the automatic indexing strategy is relevant, as it achieves a precision comparable to that of other existing operational systems. Moreover, the system presented in this paper retrieves keyword/qualifier pairs as opposed to single terms, therefore providing a significantly more precise indexing. Further development and tests will be carried out in order to improve the coverage of the dictionaries, and validate the efficiency of the system in the indexers' everyday work. Automatic indexing of online health resources for a French quality controlled gateway Aurelie Neveol Alexandrina Rogozan Stefan Darmoni doi:10.1016/j.ipm.2005.01.003 Information Processing & Management, Vol. In Press, Corrected Proof 2005-08-22T16:51:50-00:00 Information Processing & Management In Press, Corrected Proof automatic mesh http://www.citeulike.org/user/ville/article/256629 <i>(2005), pp. 291-300.</i> Developing practical automatic metadata assignment and evaluation tools for internet resources Gordon Paynter doi:10.1145/1065385.1065454 (2005), pp. 291-300. 2005-07-15T11:21:22-00:00 2005 291 300 ACM Press automatic keyphrase http://www.citeulike.org/user/ville/article/300427 <i>(1988), pp. 204-210.</i> Syntactic approaches to automatic book indexing Gerard Salton (1988), pp. 204-210. 2005-08-22T15:43:43-00:00 1988 204 210 Association for Computational Linguistics automatic indexing http://www.citeulike.org/user/ville/article/264842 <i>J. Am. Soc. Inf. Sci. Technol., Vol. 52, No. 5. (March 2001), pp. 391-401.</i> An experimental study in auomatically categorizing medical documents Berthier Ribeiro-Neto Alberto Laender Luciano de Lima doi:10.1002/1532-2890(2001)9999:9999<::AID-ASI1083>3.3.CO;2-T J. Am. Soc. Inf. Sci. Technol., Vol. 52, No. 5. (March 2001), pp. 391-401. 2005-07-26T05:10:16-00:00 2001 J. Am. Soc. Inf. Sci. Technol. 1532-2882 52 5 391 401 John Wiley & Sons, Inc. automatic mesh http://www.citeulike.org/user/ville/article/303205 <i>Proc AMIA Symp (2001), pp. 319-323.</i><br /><br />For computational purposes documents or other objects are most often represented by a collection of individual attributes that may be strings or numbers. Such attributes are often called features and success in solving a given problem can depend critically on the nature of the features selected to represent documents. Feature selection has received considerable attention in the machine learning literature. In the area of document retrieval we refer to feature selection as indexing. Indexing has not traditionally been evaluated by the same methods used in machine learning feature selection. Here we show how indexing quality may be evaluated in a machine learning setting and apply this methodology to results of the Indexing Initiative at the National Library of Medicine. Automatic MeSH term assignment and quality assessment. W Kim AR Aronson WJ Wilbur Proc AMIA Symp (2001), pp. 319-323. 2005-08-25T09:14:19-00:00 2001 Proc AMIA Symp 1531-605X 319 323 automatic mesh nlm http://www.citeulike.org/user/tulaydemir/article/1766076 <i>Data Knowl. Eng., Vol. 54, No. 1. (July 2005), pp. 3-28.</i><br /><br />Data on the Web in HTML tables is mostly structured, but we usually do not know the structure in advance. Thus, we cannot directly query for data of interest. We propose a solution to this problem based on document-independent extraction ontologies. Our solution entails elements of table understanding, data integration, and wrapper creation. Table understanding allows us to find tables of interest within a Web page, recognize attributes and values within the table, pair attributes with values, and form records. Data-integration techniques allow us to match source records with a target schema. Ontologically specified wrappers allow us to extract data from source records into a target schema. Experimental results show that we can successfully locate data of interest in tables and map the data from source HTML tables with unknown structure to a given target database schema. We can thus “directly” query source data with unknown structure through a known target schema. Automating the extraction of data from HTML tables with unknown structure David Embley Cui Tao Stephen Liddle doi:10.1016/j.datak.2004.10.004 Data Knowl. Eng., Vol. 54, No. 1. (July 2005), pp. 3-28. 2007-10-14T02:40:17-00:00 2005 Data Knowl. Eng. 54 1 3 28 Elsevier Science Publishers B. V. 2005 automatic extraction ontology http://www.citeulike.org/user/tulaydemir/article/494446 <i>(2003), pp. 337-348.</i> Extracting structured data from Web pages Arvind Arasu Hector Garcia-Molina Stanford University doi:10.1145/872757.872799 (2003), pp. 337-348. 2006-02-06T21:35:14-00:00 2003 337 348 ACM Press automatic creation extract model page template http://www.citeulike.org/user/tulaydemir/article/1179337 <i>(2006), pp. 989-1000.</i> Automatic extraction of dynamic record sections from search engine result pages Hongkun Zhao Weiyi Meng Clement Yu doi:10.1145/872757.872799 (2006), pp. 989-1000. 2007-03-21T15:21:02-00:00 2006 989 1000 VLDB Endowment automatic record_extraction http://www.citeulike.org/user/tulaydemir/article/494100 <i>Decis. Support Syst., Vol. 35, No. 1. (April 2003), pp. 129-147.</i> Automatic information extraction from semi-structured Web pages by pattern discovery Chia-Hui Chang Chun-Nan Hsu Shao-Cheng Lui doi:10.1016/S0167-9236(02)00100-8 Decis. Support Syst., Vol. 35, No. 1. (April 2003), pp. 129-147. 2006-02-06T07:31:53-00:00 2003 Decis. Support Syst. 0167-9236 35 1 129 147 Elsevier Science Publishers B. V. 2003 automatic extraction iepad pattern semi-structured http://www.citeulike.org/user/tulaydemir/article/530795 <i>(2002), pp. 264-277.</i> Automatic Web Information Extraction in the ROADRUNNER System Valter Crescenzi Giansalvatore Mecca Paolo Merialdo (2002), pp. 264-277. 2006-03-04T06:08:15-00:00 2002 264 277 Springer-Verlag automatic extraction html roadrunner system http://www.citeulike.org/user/ss363/article/2501486 <i>Business Process Management (2007), pp. 182-197.</i><br /><br />Nowadays, process management systems can be used not only in classical business scenarios, but also in highly mobile and dynamic situations, e.g., in supporting operators during emergency management in order to coordinate their activities. In such challenging situations, processes should be adapted, in order to cope with anomalous situations, including connection anomalies and task faults. In this paper, we present a general approach, based on execution monitoring, which is (i) practical, by relying on well-established planning techniques, and (ii) does not require the definition of the adaptation strategy in the process itself (as most of the current approaches do). We prove the correctness and completeness of the approach. Highly Dynamic Adaptation in Process Management Systems Through Execution Monitoring Massimiliano de Leoni Massimo Mecella Giuseppe De Giacomo doi:10.1007/978-3-540-75183-0_14 Business Process Management (2007), pp. 182-197. 2008-03-10T16:01:59-00:00 2007 Business Process Management 182 197 adaptation automatic dynamic execution for in monitoring process scenarios http://www.citeulike.org/user/sjgaller/article/2738650 <i>(2006), pp. 1953-1954.</i> A specification-based fitness function for evolutionary testing of object-oriented programs Yoonsik Cheon Myoung Kim doi:10.1145/1143997.1144322 (2006), pp. 1953-1954. 2008-04-30T13:44:32-00:00 2006 1953 1954 ACM automatic java jml softnet testing unit-testing unit-tests http://www.citeulike.org/user/sjgaller/article/2738590 <i>(2007)</i> Reconciling Manual and Automated Testing: The AutoTest Experience Andreas Leitner Ilinca Ciupa Bertrand Meyer Mark Howard doi:10.1109/HICSS.2007.462 (2007) 2008-04-30T13:24:09-00:00 2007 IEEE Computer Society automatic autotest eiffel softnet testing http://www.citeulike.org/user/sjgaller/article/1673808 <i>Computer Aided Verification (2007), pp. 258-262.</i><br /><br />We present the tool Anzu. Anzu takes a formal specification of a design and generates a functionally correct system if one exists. The specification is given as a set of linear temporal logic (LTL) formulas belonging to the class of generalized reactivity of rank 1. Such formulas cover the majority of the formulas used in practice. Anzu is an implementation of the symbolic reactive(1) approach to synthesis by Piterman, Pnueli, and Sa’ar. If the specification is realizable Anzu provides the user with a Verilog module that represents a correct finite-state system. Anzu: A Tool for Property Synthesis Barbara Jobstmann Stefan Galler Martin Weiglhofer Roderick Bloem doi:10.1007/978-3-540-73368-3_29 Computer Aided Verification (2007), pp. 258-262. 2007-09-19T05:43:08-00:00 2007 Computer Aided Verification 258 262 automatic case-study specification synthesis http://www.citeulike.org/user/sjgaller/article/2215249 <i>SOFSEM 2007: Theory and Practice of Computer Science (2007), pp. 114-129.</i><br /><br />Effective testing involves preparing test oracles and test cases, two activities which are too tedious to be effectively performed by humans, yet for the most part remain manual. The AutoTest unit testing framework automates both, by using Eiffel contracts — already present in the software — as test oracles, and generating objects and routine arguments to exercise all given classes; manual tests can also be added, and all failed test cases are automatically retained for regression testing, in a “minimized” form retaining only the relevant instructions. AutoTest has already detected numerous hitherto unknown bugs in production software. Automatic Testing of Object-Oriented Software Bertrand Meyer Ilinca Ciupa Andreas Leitner Lisa Liu doi:10.1007/978-3-540-69507-3_9 SOFSEM 2007: Theory and Practice of Computer Science (2007), pp. 114-129. 2008-01-10T16:18:46-00:00 2007 SOFSEM 2007: Theory and Practice of Computer Science 114 129 automatic eiffel softnet testing http://www.citeulike.org/user/sjgaller/article/2341632 <i>Electron. Notes Theor. Comput. Sci., Vol. 190, No. 4. (November 2007), pp. 3-16.</i> Specify, Compile, Run: Hardware from PSL Roderick Bloem Stefan Galler Barbara Jobstmann Nir Piterman Amir Pnueli Martin Weiglhofer doi:10.1016/j.entcs.2007.09.004 Electron. Notes Theor. Comput. Sci., Vol. 190, No. 4. (November 2007), pp. 3-16. 2008-02-06T13:38:01-00:00 2007 Electron. Notes Theor. Comput. Sci. 1571-0661 190 4 3 16 Elsevier Science Publishers B. V. automatic case-study specification synthesis http://www.citeulike.org/user/sjgaller/article/1421838 <i>(2007), pp. 1188-1193.</i> Interactive presentation: Automatic hardware synthesis from specifications: a case study Roderick Bloem Stefan Galler Barbara Jobstmann Nir Piterman Amir Pnueli Martin Weiglhofer doi:10.1145/1266366.1266622 (2007), pp. 1188-1193. 2007-06-29T08:52:21-00:00 2007 1188 1193 ACM Press automatic case-study specification synthesis http://www.citeulike.org/user/seungwon/article/911932 <i>(2006), pp. 129-138.</i> Automatic categorization of figures in scientific documents Xiaonan Lu Prasenjit Mitra James Wang Lee Giles doi:10.1145/1141753.1141778 (2006), pp. 129-138. 2006-10-24T20:09:48-00:00 2006 129 138 ACM Press automatic categorization image http://www.citeulike.org/user/seungwon/article/920697 <i>(2006), pp. 109-118.</i> A hierarchical, HMM-based automatic evaluation of OCR accuracy for a digital library of books Shaolei Feng R Manmatha doi:10.1145/1141753.1141776 (2006), pp. 109-118. 2006-10-31T18:02:01-00:00 2006 109 118 ACM Press automatic evaluation hmm ocr http://www.citeulike.org/user/seb314/article/2398239 <i>(2005), pp. 64-71.</i> Automatic Class Selection and Prototyping for 3-D Object Classification Raghavendra Donamukkala Daniel Huber Anuj Kapuria Martial Hebert doi:10.1109/3DIM.2005.22 (2005), pp. 64-71. 2008-02-19T11:39:41-00:00 2005 64 71 IEEE Computer Society 3d automatic classification http://www.citeulike.org/user/scis0000001/article/878832 <i></i><br /><br />JCAI-87 and has been a member of the IJCAI Inc. Trustees. (The biennial IJCAIs are the major conferences in AI). He was general chair of CADE-12 (The biennial CADEs are the major conferences in automated theorem proving) and has been President of the CADE Inc. Board of Trustees. In 1986 he received the SPL Insight Award for his contribution to artificial intelligence research. He was elected a founding Fellow of AAAI in 1990, a fellow of the Royal Society of Edinburgh in 1996 and a founding... Automatic Conjecture Making in Mathematics Simon Colton Alan Bundy Toby Walsh 2006-09-30T12:40:52-00:00 automatic conjecture http://www.citeulike.org/user/scis0000001/article/891137 <i>(2003), pp. 189-ff.</i> A topology-shape-metrics approach for the automatic layout of UML class diagrams Markus Eiglsperger Michael Kaufmann Martin Siebenhaller doi:10.1145/774833.774860 (2003), pp. 189-ff. 2006-10-10T09:09:36-00:00 2003 189 ff ACM Press automatic diagram layout uml http://www.citeulike.org/user/scis0000001/article/1050962 <i>(1998), pp. 181-188.</i><br /><br />This paper describes a program called Pret that automates system identication, the process of nding a dynamical model of a black-box system. Pret performs both structural identication and parameter estimation by integrating several reasoning modes: qualitative reasoning, qualitative simulation, numerical simulation, geometric reasoning, constraint reasoning, resolution, reasoning with abstraction levels, declarative meta-level control, and a simple form of truth maintenance. Unlike ... Multimodal Reasoning for Automatic Model Construction Reinhard Stolle Elizabeth Bradley (1998), pp. 181-188. 2007-01-19T10:25:57-00:00 1998 181 188 automatic inference modeling multimodal http://www.citeulike.org/user/scis0000001/article/1216046 <i>Cybernetics and Systems Analysis, Vol. 23, No. 3. (1 May 1987), pp. 377-383.</i> Formal design principles of a complete automatic database design procedure system for “syntactic” database management systems OM Veinerov VM Blyum MS Kazarov doi:10.1007/BF01074829 Cybernetics and Systems Analysis, Vol. 23, No. 3. (1 May 1987), pp. 377-383. 2007-04-08T14:42:08-00:00 1987 Cybernetics and Systems Analysis 23 3 377 383 automatic database design http://www.citeulike.org/user/scis0000001/article/933413 <i>(August 2002), pp. 1093-1099.</i><br /><br />This paper presents an unsupervised method for assembling semantic knowledge from a part-of-speech tagged corpus using graph algorithms. The graph model is built by linking pairs of words which participate in particular syntactic relationships. We focus on the symmetric relationship between pairs of nouns which occur together in lists. An incremental cluster-building algorithm using this part of the graph achieves 82% accuracy at a lexical acquisition task, evaluated against WordNet classes.... A Graph Model for Unsupervised Lexical Acquisition Dominic Widdows Beate Dorow (August 2002), pp. 1093-1099. 2006-11-06T14:45:02-00:00 2002 1093 1099 automatic graph lexical-acquisition unsupervised http://www.citeulike.org/user/rprince/article/2304811 <i>User Modeling and User-Adapted Interaction, Vol. 18, No. 1. (25 February 2008), pp. 45-80.</i><br /><br />Abstract  We explored the reliability of detecting a learner’s affect from conversational features extracted from interactions with AutoTutor, an intelligent tutoring system (ITS) that helps students learn by holding a conversation in natural language. Training data were collected in a learning session with AutoTutor, after which the affective states of the learner were rated by the learner, a peer, and two trained judges. Inter-rater reliability scores indicated that the classifications of the trained judges were more reliable than the novice judges. Seven data sets that temporally integrated the affective judgments with the dialogue features of each learner were constructed. The first four datasets corresponded to the judgments of the learner, a peer, and two trained judges, while the remaining three data sets combined judgments of two or more raters. Multiple regression analyses confirmed the hypothesis that dialogue features could significantly predict the affective states of boredom, confusion, flow, and frustration. Machine learning experiments indicated that standard classifiers were moderately successful in discriminating the affective states of boredom, confusion, flow, frustration, and neutral, yielding a peak accuracy of 42% with neutral (chance = 20%) and 54% without neutral (chance = 25%). Individual detections of boredom, confusion, flow, and frustration, when contrasted with neutral affect, had maximum accuracies of 69, 68, 71, and 78%, respectively (chance = 50%). The classifiers that operated on the emotion judgments of the trained judges and combined models outperformed those based on judgments of the novices (i.e., the self and peer). Follow-up classification analyses that assessed the degree to which machine-generated affect labels correlated with affect judgments provided by humans revealed that human-machine agreement was on par with novice judges (self and peer) but quantitatively lower than trained judges. We discuss the prospects of extending AutoTutor into an affect-sensing ITS. Automatic detection of learner’s affect from conversational cues Sidney D’mello Scotty Craig Amy Witherspoon Bethany Mcdaniel Arthur Graesser doi:10.1007/s11257-007-9037-6 User Modeling and User-Adapted Interaction, Vol. 18, No. 1. (25 February 2008), pp. 45-80. 2008-01-29T18:30:47-00:00 2008 User Modeling and User-Adapted Interaction 18 1 45 80 affective automatic conversational detection learning http://www.citeulike.org/user/ranford/article/4487 <i>(21 December 2004)</i><br /><br />We propose a new method to extract semantic knowledge from the world-wide-web for both supervised and unsupervised learning using the Google search engine in an unconventional manner. The approach is novel in its unrestricted problem domain, simplicity of implementation, and manifestly ontological underpinnings. We give evidence of elementary learning of the semantics of concepts, in contrast to most prior approaches. The method works as follows: The world-wide-web is the largest database on earth, and it induces a probability mass function, the Google distribution, via page counts for combinations of search queries. This distribution allows us to tap the latent semantic knowledge on the web. Shannon's coding theorem is used to establish a code-length associated with each search query. Viewing this mapping as a data compressor, we connect to earlier work on Normalized Compression Distance. We give applications in (i) unsupervised hierarchical clustering, demonstrating the ability to distinguish between colors and numbers, and to distinguish between 17th century Dutch painters; (ii) supervised concept-learning by example, using Support Vector Machines, demonstrating the ability to understand electrical terms, religious terms, emergency incidents, and by conducting a massive experiment in understanding WordNet categories; and (iii) matching of meaning, in an example of automatic English-Spanish translation. Automatic Meaning Discovery Using Google Rudi Cilibrasi Paul Vitanyi (21 December 2004) 2004-12-22T12:39:20-00:00 2004 ai automatic discovery distance google meaning normalized semantic web http://www.citeulike.org/user/pichai/article/816102 <i>(June FebruaryMarch--FebruaryJune 1998), pp. 89-98.</i><br /><br />We present CiteSeer: an autonomous citation indexing system which indexes academic literature in electronic format (e.g. Postscript files on the Web). CiteSeer understands how to parse citations, identify citations to the same paper in different formats, and identify the context of citations in the body of articles. CiteSeer provides most of the advantages of traditional (manually constructed) citation indexes (e.g. the ISI citation indexes), including: literature retrieval by following... CiteSeer: An Automatic Citation Indexing System Lee Giles Kurt Bollacker Steve Lawrence (June FebruaryMarch--FebruaryJune 1998), pp. 89-98. 2006-08-24T22:48:31-00:00 1998 89 98 ACM Press automatic citation index http://www.citeulike.org/user/pcr/article/250108 <i>(2004), pp. 331-335.</i> FrontDesk: An Enterprise Class Web-Based Software System for Programming Assignment Submission, Feedback Dissemination, and Grading Automation Mike Maxim Ashish Venugopal (2004), pp. 331-335. 2005-07-08T18:28:49-00:00 2004 331 335 IEEE Computer Society automatic grading manual rate5 http://www.citeulike.org/user/nishiokov/article/2983402 <i>J. Neurosci., Vol. 28, No. 28. (9 July 2008), pp. 7209-7218.</i><br /><br />The subthalamic nucleus (STN) of the basal ganglia is an important element of motor control. This is demonstrated by involuntary movements induced by STN lesions and the successful treatment of Parkinson's disease by STN stimulation. However, it is still unclear how individual STN neurons participate in motor control. Here, we report that the STN has a function in switching from automatic to volitionally controlled eye movement. In the STN of trained macaque monkeys, we found neurons that showed a phasic change in activity specifically before volitionally controlled saccades which were switched from automatic saccades. A majority of switch-related neurons were considered to inhibit no-longer-valid automatic processes, and the inhibition started early enough to enable the animal to switch. We suggest that the STN mediates the control signal originated from the medial frontal cortex and implements the behavioral switching function using its connections with other basal ganglia nuclei and the superior colliculus. 10.1523/JNEUROSCI.0487-08.2008 Role for Subthalamic Nucleus Neurons in Switching from Automatic to Controlled Eye Movement Masaki Isoda Okihide Hikosaka doi:10.1523/JNEUROSCI.0487-08.2008 J. Neurosci., Vol. 28, No. 28. (9 July 2008), pp. 7209-7218. 2008-07-10T01:23:17-00:00 2008 J. Neurosci. 28 28 7209 7218 automatic basal_ganglia habit-learning monkey http://www.citeulike.org/user/mova/article/2389281 <i>Computer Architecture for Machine Perception, 2005. CAMP 2005. Proceedings. Seventh International Workshop on (2005), pp. 219-224.</i><br /><br />Rail inspection is a very important task in railway maintenance and it is periodically needed for preventing dangerous situations. Inspection is operated manually by trained human operator walking along the track searching for visual anomalies. This monitoring is unacceptable for slowness and lack of objectivity, because the results are related to the ability of the observer to recognize critical situations. The paper presents a prototypal FPGA-based architecture which automatically detects presence/absence of the fastening bolts that fix the rails to the sleepers. A simple predicting algorithm, exploiting the geometry of the railways, extracts, from the long video sequence acquired by a digital line scan camera, few windows where the presence of bolts is expected. These windows are preprocessed according to a Haar transform and then provided to a multilayer perceptron neural classifiers (MLPNCs) which reveals the presence/absence of the fastening bolts with an accuracy of 99.6% in detecting visible bolts and of 95% in detecting missing bolts. A FPGA-based architecture performs these tasks in 13.29 /spl mu/s, allowing an on-the-fly analysis of a video sequence acquired up at 190 km/h. A FPGA-based architecture for automatic hexagonal bolts detection in railway maintenance G De Ruvo P De Ruvo F Marino G Mastronardi PL Mazzeo E Stella doi:10.1109/CAMP.2005.4 Computer Architecture for Machine Perception, 2005. CAMP 2005. Proceedings. Seventh International Workshop on (2005), pp. 219-224. 2008-02-16T23:09:39-00:00 2005 Computer Architecture for Machine Perception, 2005. CAMP 2005. Proceedings. Seventh International Workshop on 219 224 artificial automatic detection fpga marino poliba vision http://www.citeulike.org/user/moltean/article/299977 <i>Evolutionary Computation, Vol. 13, No. 3. (September 2005), pp. 387-410.</i> Evolving Evolutionary Algorithms Using Linear Genetic Programming Mihai Oltean doi:10.1162/1063656054794815 Evolutionary Computation, Vol. 13, No. 3. (September 2005), pp. 387-410. 2005-08-21T09:58:30-00:00 2005 Evolutionary Computation 1063-6560 13 3 387 410 MIT Press algorithms automatic computer evolutionary evolving generation genetic gp linear meta of programming programs http://www.citeulike.org/user/mohriner/article/141451 <i>Computer Music Journal, Vol. 29, No. 1. (February 2005), pp. 34-54.</i> A Review of Automatic Rhythm Description Systems Gouyon Fabien Dixon Simon Computer Music Journal, Vol. 29, No. 1. (February 2005), pp. 34-54. 2005-03-26T18:45:39-00:00 2005 Computer Music Journal 0148-9267 29 1 34 54 MIT Press automatic transcription http://www.citeulike.org/user/masaakif/article/2439395 <i>IEEE Transactions on Information Forensics and Security, Vol. 1, No. 4. (December 2006), pp. 457-463.</i><br /><br />In audio fingerprinting, an audio clip must be recognized by matching an extracted fingerprint to a database of previously computed fingerprints. The fingerprints should reduce the dimensionality of the input significantly, provide discrimination among different audio clips, and, at the same time, be invariant to distorted versions of the same audio clip. In this paper, we design fingerprints addressing the above issues by modeling an audio clip by Gaussian mixture models (GMM). We evaluate the performance of many easy-to-compute short-time Fourier transform features, such as Shannon entropy, Renyi entropy, spectral centroid, spectral bandwidth, spectral flatness measure, spectral crest factor, and Mel-frequency cepstral coefficients in modeling audio clips using GMM for fingerprinting. We test the robustness of the fingerprints under a large number of distortions. To make the system robust, we use some of the distorted versions of the audio for training. However, we show that the audio fingerprints modeled using GMM are not only robust to the distortions used in training but also to distortions not used in training. Among the features tested, spectral centroid performs best with an identification rate of 99.2% at a false positive rate of 10^-4. All of the features give an identification rate of more than 90% at a false positive rate of 10^-3 Gaussian Mixture Modeling of Short-Time Fourier Transform Features for Audio Fingerprinting Arunan Ramalingam Sridhar Krishnan doi:10.1109/TIFS.2006.885036 IEEE Transactions on Information Forensics and Security, Vol. 1, No. 4. (December 2006), pp. 457-463. 2008-02-28T02:15:33-00:00 2006 IEEE Transactions on Information Forensics and Security 1 4 457 463 analysis audio automatic bandwidth centroid cepstral clip coefficient crest data entropy extraction factor feature fingerprint fingerprinting flatness fourier gaussian identification measure mel-frequency mixture modeling models of processes processing renyi security shannon short-time signal song spectral transform transforms