Sciweavers

2190 search results - page 321 / 438
» Learning with the Set Covering Machine
Sort
View
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 7 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
ICML
2010
IEEE
13 years 7 months ago
Comparing Clusterings in Space
This paper proposes a new method for comparing clusterings both partitionally and geometrically. Our approach is motivated by the following observation: the vast majority of previ...
Michael H. Coen, M. Hidayath Ansari, Nathanael Fil...
ICMLA
2009
13 years 6 months ago
Exploring Scale-Induced Feature Hierarchies in Natural Images
Recently there has been considerable interest in topic models based on the bag-of-features representation of images. The strong independence assumption inherent in the bag-of-feat...
Jukka Perkiö, Tinne Tuytelaars, Wray L. Bunti...
COMBINATORICA
2010
13 years 6 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 9 months ago
Local decomposition for rare class analysis
Given its importance, the problem of predicting rare classes in large-scale multi-labeled data sets has attracted great attentions in the literature. However, the rare-class probl...
Junjie Wu, Hui Xiong, Peng Wu, Jian Chen