Sciweavers

120 search results - page 10 / 24
» HYDRA: A Noise-tolerant Relational Concept Learning Algorith...
Sort
View
ISCI
1998
139views more  ISCI 1998»
13 years 7 months ago
A Rough Set Approach to Attribute Generalization in Data Mining
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...
Chien-Chung Chan
ECML
2006
Springer
13 years 11 months ago
Unsupervised Multiple-Instance Learning for Functional Profiling of Genomic Data
Multiple-instance learning (MIL) is a popular concept among the AI community to support supervised learning applications in situations where only incomplete knowledge is available....
Corneliu Henegar, Karine Clément, Jean-Dani...
APWEB
2010
Springer
13 years 11 months ago
Learning to Find Interesting Connections in Wikipedia
To help users answer the question, what is the relation between (real world) entities or concepts, we might need to go well beyond the borders of traditional information retrieval ...
Marek Ciglan, Etienne Riviere, Kjetil Nørv&...
AAAI
2011
12 years 7 months ago
Markov Logic Sets: Towards Lifted Information Retrieval Using PageRank and Label Propagation
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
Marion Neumann, Babak Ahmadi, Kristian Kersting
AI
1998
Springer
13 years 7 months ago
Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
Tom Bylander