Sciweavers

1013 search results - page 36 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
CVPR
2003
IEEE
14 years 9 months ago
Robust Data Clustering
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...
Ana L. N. Fred, Anil K. Jain
TCSB
2008
13 years 7 months ago
Clustering Time-Series Gene Expression Data with Unequal Time Intervals
Clustering gene expression data given in terms of time-series is a challenging problem that imposes its own particular constraints, namely exchanging two or more time points is not...
Luis Rueda, Ataul Bari, Alioune Ngom
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 4 days ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
ICML
2005
IEEE
14 years 8 months ago
Supervised versus multiple instance learning: an empirical comparison
We empirically study the relationship between supervised and multiple instance (MI) learning. Algorithms to learn various concepts have been adapted to the MI representation. Howe...
Soumya Ray, Mark Craven
SDM
2007
SIAM
184views Data Mining» more  SDM 2007»
13 years 9 months ago
Mining Naturally Smooth Evolution of Clusters from Dynamic Data
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...
Yi Wang, Shi-Xia Liu, Jianhua Feng, Lizhu Zhou