http://www.bibsonomy.org/burst/concept/tag/Matching,BibSonomy BuRST Feed for /concept/tag/Matching,2008-10-16T08:55:15+02:00CCNLab BibTeXhttp://www.bibsonomy.org/bibtex/26a5a8e107cddea99de1ad22407259245/brian.mingusbrian.mingus2008-09-16T23:39:07+02:00stay durations, effects, matching, long-term schedules, extinction, short-term allocation, time concurrent pigeons, CCP reinforcer choice, JRR, <span style="color:#555555;">R. L. <a href="http://www.bibsonomy.org/author/Buckner">Buckner</a> und L. <a href="http://www.bibsonomy.org/author/Green">Green</a> und J. <a href="http://www.bibsonomy.org/author/Myerson">Myerson</a> </span><em>Journal of the Experimental Analysis of Behavior</em>(<em>1993</em>)Tue Sep 16 23:39:07 CEST 2008Journal of the Experimental Analysis of Behavior293-307Short-term and long-term effects of reinforcers on choice591993stay durations, effects, matching, long-term schedules, extinction, short-term allocation, time concurrent pigeons, CCP reinforcer choice, JRR, http://www.bibsonomy.org/bibtex/2710c4715009596ab4db03cb7ac9af90e/pdeleenhpdeleenh2008-07-07T16:45:32+02:00clones reengineering, plans, pattern matching, metrics, <span style="color:#555555;">K. <a href="http://www.bibsonomy.org/author/Kontogiannis">Kontogiannis</a> und R. <a href="http://www.bibsonomy.org/author/De Mori">De Mori</a> und E. <a href="http://www.bibsonomy.org/author/Merlo">Merlo</a> und M. <a href="http://www.bibsonomy.org/author/Galler">Galler</a> und M. <a href="http://www.bibsonomy.org/author/Bernstein">Bernstein</a> </span><em>3(1/2):79-108</em><em>June1996. </em>Mon Jul 07 16:45:32 CEST 2008June1/279-108Pattern Matching for clone and Concept Detection31996clones reengineering, plans, pattern matching, metrics, http://www.bibsonomy.org/bibtex/2b142e489b96aa53eabb1213c9eb306a6/brazovayeyebrazovayeye2008-06-19T17:35:00+02:00agents, intelligent knowledge state finite acquisition, templates, software programming, autonomous algorithms, patterns, Bayesian belief matching, machines, development, networks, dialogue-act conversational matching pattern genetic mental behavioural bases, language finite-state <span style="color:#555555;">Jin-Hyuk <a href="http://www.bibsonomy.org/author/Hong">Hong</a> und Sungsoo <a href="http://www.bibsonomy.org/author/Lim">Lim</a> und Sung-Bae <a href="http://www.bibsonomy.org/author/Cho">Cho</a> </span><em>IEEE Transactions on Evolutionary Computation</em><em>11(2):213--225</em><em>April2007. </em>Thu Jun 19 17:35:00 CEST 2008IEEE Transactions on Evolutionary ComputationApril2213--225Autonomous Language Development Using Dialogue-Act Templates and Genetic Programming112007agents, intelligent knowledge state finite acquisition, templates, software programming, autonomous algorithms, patterns, Bayesian belief matching, machines, development, networks, dialogue-act conversational matching pattern genetic mental behavioural bases, language finite-state In recent years, the concept of autonomous mental development (AMD) has been applied to the construction of artificial systems such as conversational agents, in order to resolve some of the difficulties involved in the manual definition of their knowledge bases and behavioural patterns. AMD is a new paradigm for developing autonomous machines, which are adaptive and flexible to the environment. Language development, a kind of mental development, is an important aspect of intelligent conversational agents. we propose an intelligent conversational agent and its language development mechanism by putting together five promising techniques: Bayesian networks, pattern matching, finite-state machines, templates, and genetic programming (GP). Knowledge acquisition implemented by finite-state machines and templates, and language learning by GP are used for language development. Several illustrations and usability tests show the usefulness of the proposed developmental conversational agentContext-aware business processeshttp://www.bibsonomy.org/bibtex/2dd66194d51b931b083d83bfb7bae8e32/p_ansellp_ansell2007-05-04T05:48:10+02:00interoperability, information knowledge matching, retrieval, integration, similarity semantic engineering, measures ontology management, <span style="color:#555555;">M.A. <a href="http://www.bibsonomy.org/author/Rodriguez">Rodriguez</a> und M.J. <a href="http://www.bibsonomy.org/author/Egenhofer">Egenhofer</a> </span><em>IEEE Transactions on Knowledge and Data Engineering</em><em>15(2):442--456</em>(<em>2003</em>)Fri May 04 05:48:10 CEST 2007IEEE Transactions on Knowledge and Data Engineering2442--456Determining Semantic Similarity among Entity Classes from Different Ontologies152003interoperability, information knowledge matching, retrieval, integration, similarity semantic engineering, measures ontology management, Semantic similarity measures play an important role in information retrieval and information integration. Traditional approaches to modeling semantic similarity compute the semantic distance between definitions within a single ontology. This single ontology is either a domain-independent ontology or the result of the integration of existing ontologies. We present an approach to computing semantic similarity that relaxes the requirement of a single ontology and accounts for differences in the levels of explicitness and formalization of the different ontology specifications. A similarity function determines similar entity classes by using a matching process over synonym sets, semantic neighborhoods, and distinguishing features that are classified into parts, functions, and attributes. Experimental results with different ontologies indicate that the model gives good results when ontologies have complete and detailed representations of entity classes. While the combination of word matching and semantic neighborhood matching is adequate for detecting equivalent entity classes, feature matching allows us to discriminate among similar, but not necessarily equivalent entity classes.http://www.bibsonomy.org/bibtex/2b6dca810d0efa05cda5a7297e2fd6dd8/schmitzschmitz2006-07-04T16:33:03+02:00Semistructured Data Model Matching, Databases, Heterogeneous Management, <span style="color:#555555;">S. <a href="http://www.bibsonomy.org/author/Melnik">Melnik</a> und H. <a href="http://www.bibsonomy.org/author/Garcia-Molina">Garcia-Molina</a> und E. <a href="http://www.bibsonomy.org/author/Rahm">Rahm</a> </span><em>Proc. 18th ICDE Conf., </em>(<em>2001</em>)Tue Jul 04 16:33:03 CEST 2006{Proc. 18th ICDE Conf.}Similarity Flooding: A Versatile Graph Matching Algorithm2001Semistructured Data Model Matching, Databases, Heterogeneous Management,