Sciweavers

5046 search results - page 294 / 1010
» Non-redundant data clustering
Sort
View
ICML
2010
IEEE
15 years 4 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...
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
16 years 1 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
CIBCB
2005
IEEE
16 years 11 days ago
Functional Distances for Genes Based on GO Feature Maps and their Application to Clustering
— With the invention of high throughput methods, researchers are capable of producing large amounts of biological data. During the analysis of such data, the need for a functiona...
Nora Speer, Holger Fröhlich, Christian Spieth...
ICPR
2002
IEEE
15 years 11 months ago
A Large Scale Clustering Scheme for Kernel K-Means
Kernel functions can be viewed as a non-linear transformation that increases the separability of the input data by mapping them to a new high dimensional space. The incorporation ...
Rong Zhang, Alexander I. Rudnicky
ECAI
2010
Springer
15 years 7 months ago
A Very Fast Method for Clustering Big Text Datasets
Large-scale text datasets have long eluded a family of particularly elegant and effective clustering methods that exploits the power of pair-wise similarities between data points ...
Frank Lin, William W. Cohen