Sciweavers

477 search results - page 56 / 96
» Algorithms for Non-negative Matrix Factorization
Sort
View
CVPR
2006
IEEE
14 years 1 months ago
Nonlinear Mean Shift for Clustering over Analytic Manifolds
The mean shift algorithm is widely applied for nonparametric clustering in Euclidean spaces. Recently, mean shift was generalized for clustering on matrix Lie groups. We further e...
Raghav Subbarao, Peter Meer
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
KDD
2009
ACM
298views Data Mining» more  KDD 2009»
14 years 2 months ago
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
Rong Pan, Martin Scholz
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
14 years 8 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
CORR
2011
Springer
209views Education» more  CORR 2011»
12 years 11 months ago
Analysis and Improvement of Low Rank Representation for Subspace segmentation
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
Siming Wei, Zhouchen Lin