Sciweavers

353 search results - page 39 / 71
» A framework for privacy-preserving cluster analysis
Sort
View

Publication
197views
14 years 2 months ago
Convex non-negative matrix factorization for massive datasets
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...
C. Thurau, K. Kersting, M. Wahabzada, and C. Bauck...
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
16 years 1 months ago
Hunting for Coherent Co-clusters in High Dimensional and Noisy Datasets
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...
Meghana Deodhar, Joydeep Ghosh, Gunjan Gupta, Hyuk...
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 7 months ago
Discovering significant OPSM subspace clusters in massive gene expression data
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
Byron J. Gao, Obi L. Griffith, Martin Ester, Steve...
MM
2005
ACM
122views Multimedia» more  MM 2005»
16 years 7 days ago
Image clustering with tensor representation
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
Xiaofei He, Deng Cai, Haifeng Liu, Jiawei Han
NIPS
2001
15 years 8 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi