Sciweavers

4066 search results - page 191 / 814
» Almost Complete Sets
Sort
View
CLA
2006
15 years 8 months ago
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
Formal Concept Analysis (FCA) considers attributes as a non-ordered set. This is appropriate when the data set is not structured. When an attribute taxonomy exists, existing techni...
Peggy Cellier, Sébastien Ferré, Oliv...
ACL
1997
15 years 7 months ago
Combining Unsupervised Lexical Knowledge Methods for Word Sense Disambiguation
This paper presents a method to combine a set of unsupervised algorithms that can accurately disambiguate word senses in a large, completely untagged corpus. Although most of the ...
German Rigau, Jordi Atserias, Eneko Agirre
IJCAI
1989
15 years 7 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
AIPS
2009
15 years 7 months ago
Minimal Sufficient Explanations for Factored Markov Decision Processes
Explaining policies of Markov Decision Processes (MDPs) is complicated due to their probabilistic and sequential nature. We present a technique to explain policies for factored MD...
Omar Zia Khan, Pascal Poupart, James P. Black
DATAMINE
2000
113views more  DATAMINE 2000»
15 years 6 months ago
Informix under CONTROL: Online Query Processing
The goal of the CONTROL project at Berkeley is to develop systems for interactive analysis of large data sets. We focus on systems that provide users with iteratively refining answ...
Joseph M. Hellerstein, Ron Avnur, Vijayshankar Ram...