5046 search results - page 62 / 1010 » Non-redundant data clustering |
192
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
195
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
Many clustering algorithms have been proposed to partition a set of static data points into groups. In this paper, we consider an evolutionary clustering problem where the input d...
162
click to vote
SIGIR
2003
ACM
15 years 11 months ago
2003
ACM
Most existing clustering algorithms cluster highly related data objects such as Web pages and Web users separately. The interrelation among different types of data objects is eith...
167
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...
184
click to vote
BMCBI
2011
14 years 9 months ago
2011
Background: The implementation of high throughput sequencing for exploring biodiversity poses high demands on bioinformatics applications for automated data processing. Here we in...