Sciweavers

1013 search results - page 9 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
DMIN
2008
152views Data Mining» more  DMIN 2008»
13 years 9 months ago
PCS: An Efficient Clustering Method for High-Dimensional Data
Clustering algorithms play an important role in data analysis and information retrieval. How to obtain a clustering for a large set of highdimensional data suitable for database ap...
Wei Li 0011, Cindy Chen, Jie Wang
ICML
2010
IEEE
13 years 7 months ago
Nonparametric Information Theoretic Clustering Algorithm
In this paper we propose a novel clustering algorithm based on maximizing the mutual information between data points and clusters. Unlike previous methods, we neither assume the d...
Lev Faivishevsky, Jacob Goldberger
NIPS
2008
13 years 9 months ago
Learning Taxonomies by Dependence Maximization
We introduce a family of unsupervised algorithms, numerical taxonomy clustering, to simultaneously cluster data, and to learn a taxonomy that encodes the relationship between the ...
Matthew B. Blaschko, Arthur Gretton
BMCBI
2004
150views more  BMCBI 2004»
13 years 7 months ago
Cross-species comparison significantly improves genome-wide prediction of cis-regulatory modules in Drosophila
Background: The discovery of cis-regulatory modules in metazoan genomes is crucial for understanding the connection between genes and organism diversity. It is important to quanti...
Saurabh Sinha, Mark D. Schroeder, Ulrich Unnerstal...
ICML
2009
IEEE
14 years 8 months ago
Information theoretic measures for clusterings comparison: is a correction for chance necessary?
Information theoretic based measures form a fundamental class of similarity measures for comparing clusterings, beside the class of pair-counting based and set-matching based meas...
Xuan Vinh Nguyen, Julien Epps, James Bailey