502 search results - page 82 / 101 » Sparse Subspace Clustering |
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
PRL
2008
14 years 9 months ago
2008
In recent years, relevance feedback has been studied extensively as a way to improve performance of content-based image retrieval (CBIR). Since users are usually unwilling to prov...
117
click to vote
TKDE
2011
14 years 4 months ago
2011
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
SDM
2011
SIAM
14 years 18 days ago
2011
SIAM
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...
143
click to vote
Book
This book is aimed at senior undergraduates and graduate students in Engineering, Science, Mathematics, and Computing. It expects familiarity with calculus, probability theory, and...