We present a description of three different algorithms that use background knowledge to improve text classifiers. One uses the background knowledge as an index into the set of tra...
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
Neil Yorke-Smith, Kristen Brent Venable, Francesca...
This paper proposes a unique map learning method for mobile robots based on the co-visibility infor mation of objects i.e., the information on whether two objects are visible at...
Unlike conventional data or text, Web pages typically contain a large amount of information that is not part of the main contents of the pages, e.g., banner ads, navigation bars, ...
This paper studies the dynamics of agent mediated combinatorial trading at the macroscopic level. The combinatorial marketplace consists of a retailer who wishes to sell bundles o...
With domain ontology, a meaningful index of document indexing, such as the domain events structure in this paper, can be defined. Since the construction of domain ontology is cost...
Single-Class Classification (SCC) seeks to distinguish one class of data from the universal set of multiple classes. We present a new SCC algorithm that efficiently computes an ac...
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Bayesian network models are widely used for discriminative prediction tasks such as classification. Usually their parameters are determined using 'unsupervised' methods ...