Full Paper (PDF 376832 bytes). - Vanderbilt University School of
... Cen Li and Gautam Biswas, Senior Member, IEEE AbstractÐThis paper presents a Similarity-Based Agglomerative Clustering (SBAC) algorithm that works well for data with mixed numeric and nominal features. A similarity measure, proposed by Goodall for biological taxonomy [15], that gives greater weight ...
... Cen Li and Gautam Biswas, Senior Member, IEEE AbstractÐThis paper presents a Similarity-Based Agglomerative Clustering (SBAC) algorithm that works well for data with mixed numeric and nominal features. A similarity measure, proposed by Goodall for biological taxonomy [15], that gives greater weight ...
Lecture Notes in Computer Science:
... automatically improved by executing a theory revision process through the use of inductive logic programming (ILP) [27, 29, 34]. This process is called Theory REvisioN on the Design of Distributed Databases (TREND3). The improvement process may be carried out by providing two input parameters to the ...
... automatically improved by executing a theory revision process through the use of inductive logic programming (ILP) [27, 29, 34]. This process is called Theory REvisioN on the Design of Distributed Databases (TREND3). The improvement process may be carried out by providing two input parameters to the ...
Free Heyting algebras: revisited
... Free Heyting algebras have been the subject of intensive investigation for decades. The one-generated free Heyting algebra was constructed by Rieger and Nishimura in the 50s. In the 70s Urquhart gave an algebraic characterization of finitely generated free Heyting algebras. A very detailed descripti ...
... Free Heyting algebras have been the subject of intensive investigation for decades. The one-generated free Heyting algebra was constructed by Rieger and Nishimura in the 50s. In the 70s Urquhart gave an algebraic characterization of finitely generated free Heyting algebras. A very detailed descripti ...
Relational Dynamic Bayesian Networks
... directed edges in the graph from the parent to the child. • A conditional probability model for P (R|P a(R)) which is a function with range [0,1] defined over all the variables in P a(R). 2 Semantics: A relational Bayesian network defines a Bayesian network on the ground predicates in the relational ...
... directed edges in the graph from the parent to the child. • A conditional probability model for P (R|P a(R)) which is a function with range [0,1] defined over all the variables in P a(R). 2 Semantics: A relational Bayesian network defines a Bayesian network on the ground predicates in the relational ...
Complete Workshop Proceedings
... is obvious: whereas symbolic theories are based on recursion and compositionality allowing the computation of (potentially) infinitely many meanings from a finite basis, such principles are not available for connectionist networks. On the other hand, neural networks have been proven to be a robust t ...
... is obvious: whereas symbolic theories are based on recursion and compositionality allowing the computation of (potentially) infinitely many meanings from a finite basis, such principles are not available for connectionist networks. On the other hand, neural networks have been proven to be a robust t ...
From Agent Theory to Agent Construction: A Case Study
... distinguish between them [16]. The critical distinction that we do make, however, is that between agents and autonomous agents, an important aspect often overlooked. In short, we propose a four-tiered hierarchy of entities comprising entities, objects, agents and autonomous agents. The basic idea un ...
... distinguish between them [16]. The critical distinction that we do make, however, is that between agents and autonomous agents, an important aspect often overlooked. In short, we propose a four-tiered hierarchy of entities comprising entities, objects, agents and autonomous agents. The basic idea un ...
Computational Semiotics : An Approach for the Study of Intelligent
... Human intelligence has always been of interest and curiosity in the scientific world. First incursions in understanding and modeling intelligence and knowledge is rooted in Plato (Plato, 1991) and his philosophical speculations, being under constant investigation since then. With the arise of digita ...
... Human intelligence has always been of interest and curiosity in the scientific world. First incursions in understanding and modeling intelligence and knowledge is rooted in Plato (Plato, 1991) and his philosophical speculations, being under constant investigation since then. With the arise of digita ...
Visualizing Inference Henry Lieberman and Joe Henke MIT Media Lab
... and “Bottle IsA Drink” were inferred from the incorrect KB assertion, “Glass IsA Drink” (probably a failure of our parser on something like, “A glass of water is a drink”). Assertions around it like “Wine IsA Drink”, “Beer…” etc. ...
... and “Bottle IsA Drink” were inferred from the incorrect KB assertion, “Glass IsA Drink” (probably a failure of our parser on something like, “A glass of water is a drink”). Assertions around it like “Wine IsA Drink”, “Beer…” etc. ...
Tarek R. Besold, Kai
... This volume contains the proceedings of the 2nd International Workshop for Computational Creativity, Concept Invention, and General Intelligence held in conjunction with IJCAI 2013 in Beijing, China. Continuing the mission started by the 1st edition of the workshop series in 2012 at Montpellier, the ...
... This volume contains the proceedings of the 2nd International Workshop for Computational Creativity, Concept Invention, and General Intelligence held in conjunction with IJCAI 2013 in Beijing, China. Continuing the mission started by the 1st edition of the workshop series in 2012 at Montpellier, the ...
A WK-Means Approach for Clustering
... data. It has been used for storing and representing large amounts of information as data. Cluster analysis can be defined as discovering natural hidden groups of objects. It has been used for assigning the same objects to the same groups [22], where different objects are in different groups. Cluster ...
... data. It has been used for storing and representing large amounts of information as data. Cluster analysis can be defined as discovering natural hidden groups of objects. It has been used for assigning the same objects to the same groups [22], where different objects are in different groups. Cluster ...
A New Operator for ABox Revision in DL-Lite Sibei Gao Guilin Qi
... TBox revision suffers from the problem of non-determinism, i.e., the output of the algorithm may change if we run it several times. In contrast, the result of ABox revision is uniquely defined. The algorithms for ABox revision run in polynomial time. However, they need to compute the ABox closure w. ...
... TBox revision suffers from the problem of non-determinism, i.e., the output of the algorithm may change if we run it several times. In contrast, the result of ABox revision is uniquely defined. The algorithms for ABox revision run in polynomial time. However, they need to compute the ABox closure w. ...
Ontology Integration Experienced on Medical Terminologies
... Intuitively, categories should have been introduced for the purpose of categorizing concepts (similar to semantic types in the UMLS). This is what the name ”categories” seems to imply. However, as mentioned before, there exist different kinds of relationship between concepts and categories of the AC ...
... Intuitively, categories should have been introduced for the purpose of categorizing concepts (similar to semantic types in the UMLS). This is what the name ”categories” seems to imply. However, as mentioned before, there exist different kinds of relationship between concepts and categories of the AC ...
An Annotated Dataset for Extracting Definitions and Hypernyms from
... Only few papers try to cope with the generality of patterns and domains in real-world corpora (like the web). In the GlossExtractor web-based system (Velardi et al., 2008), to improve precision while keeping pattern generality, candidates are pruned using more refined stylistic patterns and lexical ...
... Only few papers try to cope with the generality of patterns and domains in real-world corpora (like the web). In the GlossExtractor web-based system (Velardi et al., 2008), to improve precision while keeping pattern generality, candidates are pruned using more refined stylistic patterns and lexical ...
1. View-Concepts: Knowledge-Based Access to
... LIM uses three different caching schemes, for two purposes. The first purpose is the conventional one of improving performance; the second is related to preserving referential integrity in an Object-Oriented system. For improved performance, LIM can make use of the CIDI’s results cache: the CIDI sto ...
... LIM uses three different caching schemes, for two purposes. The first purpose is the conventional one of improving performance; the second is related to preserving referential integrity in an Object-Oriented system. For improved performance, LIM can make use of the CIDI’s results cache: the CIDI sto ...
Lecture 1: Lattice ideals and lattice basis ideals
... To see this, let F ∈ K [y1 , . . . , yP m ] be a polynomial with F (tb1 , . . . , tbm ) = 0. Say, F = c ac yc with ac ∈ K . Then ...
... To see this, let F ∈ K [y1 , . . . , yP m ] be a polynomial with F (tb1 , . . . , tbm ) = 0. Say, F = c ac yc with ac ∈ K . Then ...
Improving Semantic Integration by Learning
... paths to semantic paths to aid in the interpretation of scientific text. This can be useful both for question answering and in integrating additional information into a knowledge base. In order to evaluate this approach it will be necessary to construct a corpus of introductory level sentences in ei ...
... paths to semantic paths to aid in the interpretation of scientific text. This can be useful both for question answering and in integrating additional information into a knowledge base. In order to evaluate this approach it will be necessary to construct a corpus of introductory level sentences in ei ...
Conceptual Graphs and First Order Logic
... CGs in their general form has led to the belief that a CG is a formalism somehow different from the logical one, or possessing some complex logical characterization. For instance, many conceptual graph operators or extra notions, such as the maximal join [7], have been introduced without background ...
... CGs in their general form has led to the belief that a CG is a formalism somehow different from the logical one, or possessing some complex logical characterization. For instance, many conceptual graph operators or extra notions, such as the maximal join [7], have been introduced without background ...
Integrated Access to Cultural Heritage
... information resources. Once there is digital access to the content of museums, libraries and archives, there is also the tremendous opportunity to merge collections from different locations into virtual, federated institutions, thus increasing access across collections and institutional boundaries. ...
... information resources. Once there is digital access to the content of museums, libraries and archives, there is also the tremendous opportunity to merge collections from different locations into virtual, federated institutions, thus increasing access across collections and institutional boundaries. ...
Pattern Recognition Algorithms for Cluster
... delivery engagements for workforce management and planning [Hu et al.,2007] as well as to study genome data [Baldi & Hatfield, 2002] in biology. Data clustering has been used for the following three main purposes: ...
... delivery engagements for workforce management and planning [Hu et al.,2007] as well as to study genome data [Baldi & Hatfield, 2002] in biology. Data clustering has been used for the following three main purposes: ...
Class Library Implementation of an Open Architecture Knowledge
... The jigsaw puzzle diagram of Figure 1 indicates how complex system architectures may be developed by integration of a heterogeneous collection of specific application sub-systems. However, it does not show the functionality of a particular application or how much of this is drawn from the standard m ...
... The jigsaw puzzle diagram of Figure 1 indicates how complex system architectures may be developed by integration of a heterogeneous collection of specific application sub-systems. However, it does not show the functionality of a particular application or how much of this is drawn from the standard m ...
Analogy Generation with HowNet
... allows others – potential analogues – to occupy the same reduced semantic space. The further we exacerbate this deficiency, indexing each definition on an increasingly diluted version of itself, the more distant and creative will be the analogies that are generated. For example, excluding the hypern ...
... allows others – potential analogues – to occupy the same reduced semantic space. The further we exacerbate this deficiency, indexing each definition on an increasingly diluted version of itself, the more distant and creative will be the analogies that are generated. For example, excluding the hypern ...
J. Harding, Orthomodularity of decompositions in a categorical
... In this note we generalize Harding’s result to show that the direct product decompositions of any object in a suitable type of category form a type of orthomodular structure known as an orthoalgebra. This categorical approach has a number of advantages. It provides a relatively simple method to dete ...
... In this note we generalize Harding’s result to show that the direct product decompositions of any object in a suitable type of category form a type of orthomodular structure known as an orthoalgebra. This categorical approach has a number of advantages. It provides a relatively simple method to dete ...
The Instance Store: DL Reasoning with Large Numbers of Individuals
... In practice, several refinements to the above procedure are used to improve the performance of iS . In the first place, as it is potentially costly, we should try to minimise the DL reasoning required in order to compute realisations (when instance axioms are added to the ABox) and to check if indiv ...
... In practice, several refinements to the above procedure are used to improve the performance of iS . In the first place, as it is potentially costly, we should try to minimise the DL reasoning required in order to compute realisations (when instance axioms are added to the ABox) and to check if indiv ...
(pdf)
... − ◦ − : C(Y, Z) × C(X, Y ) → C(X, Z), such that for all morphisms f : W → X, g : X → Y and h : Y → Z, the following holds: (h ◦ g) ◦ f = h ◦ (g ◦ f ). • For each object X ∈ Ob(C), an identity morphism 1X : X → X such that, for each morphism f : X → Y , we have f ◦ 1X = f = 1Y ◦ f. The most familiar ...
... − ◦ − : C(Y, Z) × C(X, Y ) → C(X, Z), such that for all morphisms f : W → X, g : X → Y and h : Y → Z, the following holds: (h ◦ g) ◦ f = h ◦ (g ◦ f ). • For each object X ∈ Ob(C), an identity morphism 1X : X → X such that, for each morphism f : X → Y , we have f ◦ 1X = f = 1Y ◦ f. The most familiar ...
Robotic tool use and problem solving based on
... retrieve one modality given the others [23]. Therefore, by using this approach we can obtain the same expressive power of the BNs (i.e. the possibility of infer any set of variables given any other set of variables), but with the advantage of using continuous data and online incremental estimation o ...
... retrieve one modality given the others [23]. Therefore, by using this approach we can obtain the same expressive power of the BNs (i.e. the possibility of infer any set of variables given any other set of variables), but with the advantage of using continuous data and online incremental estimation o ...