Sciweavers

23 search results - page 4 / 5
» Solving Consensus and Semi-supervised Clustering Problems Us...
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 9 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
JC
2007
94views more  JC 2007»
13 years 8 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
ICAISC
2010
Springer
13 years 10 months ago
Sequential Coordinate-Wise DNMF for Face Recognition
Abstract. This paper proposes the Sequential Coordinate-Wise Algorithm (SCWA) to Discriminant Nonnegative Matrix Factorization (DNMF) for improving face recognition. DNMF incorpora...
Rafal Zdunek, Andrzej Cichocki
SIGIR
2008
ACM
13 years 8 months ago
Knowledge transformation from word space to document space
In most IR clustering problems, we directly cluster the documents, working in the document space, using cosine similarity between documents as the similarity measure. In many real...
Tao Li, Chris H. Q. Ding, Yi Zhang 0005, Bo Shao
CVPR
2012
IEEE
11 years 11 months ago
Fixed-rank representation for unsupervised visual learning
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
Risheng Liu, Zhouchen Lin, Fernando De la Torre, Z...