Sciweavers

460 search results - page 50 / 92
» An Index Structure for Data Mining and Clustering
Sort
View
TODS
2002
92views more  TODS 2002»
14 years 11 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
CEC
2007
IEEE
15 years 6 months ago
On some symmetry based validity indices
—Identification of the correct number of clusters and the corresponding partitioning are two important considerations in clustering. In this paper, a newly developed point symme...
Sriparna Saha, Sanghamitra Bandyopadhyay
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
15 years 1 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly
SAC
2005
ACM
15 years 5 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
KDD
2003
ACM
142views Data Mining» more  KDD 2003»
16 years 7 days ago
Mining phenotypes and informative genes from gene expression data
Mining microarray gene expression data is an important research topic in bioinformatics with broad applications. While most of the previous studies focus on clustering either gene...
Chun Tang, Aidong Zhang, Jian Pei