Sciweavers

2434 search results - page 233 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
COLT
2010
Springer
15 years 2 months ago
Robust Hierarchical Clustering
One of the most widely used techniques for data clustering is agglomerative clustering. Such algorithms have been long used across many different fields ranging from computational...
Maria-Florina Balcan, Pramod Gupta
ICPR
2004
IEEE
16 years 5 months ago
Image and Feature Co-Clustering
The visual appearance of an image is closely associated with its low-level features. Identifying the set of features that best characterizes the image is useful for tasks such as ...
Guoping Qiu
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
15 years 8 months ago
Decision Tree Induction: How Effective is the Greedy Heuristic?
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
Sreerama K. Murthy, Steven Salzberg
AAAI
2008
15 years 6 months ago
Single Document Keyphrase Extraction Using Neighborhood Knowledge
Existing methods for single document keyphrase extraction usually make use of only the information contained in the specified document. This paper proposes to use a small number o...
Xiaojun Wan, Jianguo Xiao
ICMLA
2007
15 years 5 months ago
Phase transition and heuristic search in relational learning
Several works have shown that the covering test in relational learning exhibits a phase transition in its covering probability. It is argued that this phase transition dooms every...
Érick Alphonse, Aomar Osmani