Sciweavers

692 search results - page 12 / 139
» A new clustering algorithm for coordinate-free data
Sort
View
RECOMB
2002
Springer
14 years 8 months ago
A new approach to analyzing gene expression time series data
We present algorithms for time-series gene expression analysis that permit the principled estimation of unobserved timepoints, clustering, and dataset alignment. Each expression p...
Ziv Bar-Joseph, Georg Gerber, David K. Gifford, To...
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
14 years 28 days ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
Boriana L. Milenova, Marcos M. Campos
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
14 years 2 months ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 1 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
ICDM
2005
IEEE
150views Data Mining» more  ICDM 2005»
14 years 1 months ago
Combining Multiple Clusterings by Soft Correspondence
Combining multiple clusterings arises in various important data mining scenarios. However, finding a consensus clustering from multiple clusterings is a challenging task because ...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu