Sciweavers

3133 search results - page 104 / 627
» Representing clusters for retrieval
Sort
View
93
Voted
WACV
2005
IEEE
15 years 3 months ago
Ensemble Methods in the Clustering of String Patterns
We address the problem of clustering of contour images from hardware tools based on string descriptions, in a comparative study of cluster combination techniques. Several clusteri...
André Lourenço, Ana L. N. Fred
SDM
2007
SIAM
152views Data Mining» more  SDM 2007»
14 years 11 months ago
HP2PC: Scalable Hierarchically-Distributed Peer-to-Peer Clustering
In distributed data mining models, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose...
Khaled M. Hammouda, Mohamed S. Kamel
PR
2010
156views more  PR 2010»
14 years 8 months ago
Semi-supervised clustering with metric learning: An adaptive kernel method
Most existing representative works in semi-supervised clustering do not sufficiently solve the violation problem of pairwise constraints. On the other hand, traditional kernel met...
Xuesong Yin, Songcan Chen, Enliang Hu, Daoqiang Zh...
NIPS
1998
14 years 11 months ago
Restructuring Sparse High Dimensional Data for Effective Retrieval
The task in text retrieval is to find the subset of a collection of documents relevant to a user's information request, usually expressed as a set of words. Classically, docu...
Charles Lee Isbell Jr., Paul A. Viola
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
15 years 10 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...