Sciweavers

847 search results - page 11 / 170
» Approximation algorithms for projective clustering
Sort
View
APBC
2004
164views Bioinformatics» more  APBC 2004»
15 years 4 months ago
Cluster Ensemble and Its Applications in Gene Expression Analysis
Huge amount of gene expression data have been generated as a result of the human genomic project. Clustering has been used extensively in mining these gene expression data to find...
Xiaohua Hu, Illhoi Yoo
CIARP
2010
Springer
15 years 2 months ago
Improving the Dynamic Hierarchical Compact Clustering Algorithm by Using Feature Selection
Abstract. Feature selection has improved the performance of text clustering. In this paper, a local feature selection technique is incorporated in the dynamic hierarchical compact ...
Reynaldo Gil-García, Aurora Pons-Porrata
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 5 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
PODS
2008
ACM
153views Database» more  PODS 2008»
16 years 3 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
SADM
2008
178views more  SADM 2008»
15 years 2 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon