Sciweavers

115 search results - page 8 / 23
» Summarising Data by Clustering Items
Sort
View
DIS
2005
Springer
14 years 27 days ago
Active Constrained Clustering by Examining Spectral Eigenvectors
Abstract. This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examini...
Qianjun Xu, Marie desJardins, Kiri Wagstaff
ICML
2009
IEEE
14 years 8 months ago
Multi-assignment clustering for Boolean data
Conventional clustering methods typically assume that each data item belongs to a single cluster. This assumption does not hold in general. In order to overcome this limitation, w...
Andreas P. Streich, Mario Frank, David A. Basin, J...
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 4 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
ERCIMDL
2008
Springer
112views Education» more  ERCIMDL 2008»
13 years 9 months ago
Releasing the Power of Digital Metadata: Examining Large Networks of Co-related Publications
Bibliographic metadata plays a key role in scientific literature, not only to summarise and establish the facts of the publication record, but also to track citations between publ...
David Tarrant, Les Carr, Terry R. Payne
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 7 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley