Sciweavers

1191 search results - page 56 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
103
Voted
ICML
2005
IEEE
16 years 3 months ago
Supervised clustering with support vector machines
Supervised clustering is the problem of training a clustering algorithm to produce desirable clusterings: given sets of items and complete clusterings over these sets, we learn ho...
Thomas Finley, Thorsten Joachims
114
Voted
APPINF
2003
15 years 4 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
130
Voted
ICMLA
2010
15 years 23 hour ago
Incremental Learning of Relational Action Rules
Abstract--In the Relational Reinforcement learning framework, we propose an algorithm that learns an action model allowing to predict the resulting state of each action in any give...
Christophe Rodrigues, Pierre Gérard, C&eacu...
133
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Sparse coding and dictionary learning based on the MDL principle
The power of sparse signal coding with learned overcomplete dictionaries has been demonstrated in a variety of applications and fields, from signal processing to statistical infe...
Ignacio Ramírez, Guillermo Sapiro
149
Voted
SIGIR
2004
ACM
15 years 8 months ago
Effectiveness of web page classification on finding list answers
List question answering (QA) offers a unique challenge in effectively and efficiently locating a complete set of distinct answers from huge corpora or the Web. In TREC-12, the med...
Hui Yang, Tat-Seng Chua