Sciweavers

2312 search results - page 300 / 463
» On the Dimensionality of Face Space
Sort
View
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
15 years 6 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
CORR
2010
Springer
200views Education» more  CORR 2010»
15 years 6 months ago
A Multilevel Approach For Nonnegative Matrix Factorization
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particul...
Nicolas Gillis, François Glineur
CSDA
2008
158views more  CSDA 2008»
15 years 6 months ago
Outlier identification in high dimensions
A computationally fast procedure for identifying outliers is presented, that is particularly effective in high dimensions. This algorithm utilizes simple properties of principal c...
Peter Filzmoser, Ricardo A. Maronna, Mark Werner
CORR
2006
Springer
151views Education» more  CORR 2006»
15 years 6 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
JMLR
2008
117views more  JMLR 2008»
15 years 6 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac