Probabilistic Subspace Clustering Via Sparse Representations. Adler, A., Elad, M., & Hel-Or, Y. IEEE Signal Processing Letters, 20(1):63–66, January, 2013. Conference Name: IEEE Signal Processing Lettersdoi abstract bibtex We present a probabilistic subspace clustering approach that is capable of rapidly clustering very large signal collections. Each signal is represented by a sparse combination of basis elements (atoms), which form the columns of a dictionary matrix. The set of sparse representations is utilized to derive the co-occurrences matrix of atoms and signals, which is modeled as emerging from a mixture model. The components of the mixture model are obtained via a non-negative matrix factorization (NNMF) of the co-occurrences matrix, and the subspace of each signal is estimated according to a maximum-likelihood (ML) criterion. Performance evaluation demonstrate comparable clustering accuracies to state-of-the-art at a fraction of the computational load.
@article{adler_probabilistic_2013,
title = {Probabilistic {Subspace} {Clustering} {Via} {Sparse} {Representations}},
volume = {20},
issn = {1558-2361},
doi = {10.1109/LSP.2012.2229705},
abstract = {We present a probabilistic subspace clustering approach that is capable of rapidly clustering very large signal collections. Each signal is represented by a sparse combination of basis elements (atoms), which form the columns of a dictionary matrix. The set of sparse representations is utilized to derive the co-occurrences matrix of atoms and signals, which is modeled as emerging from a mixture model. The components of the mixture model are obtained via a non-negative matrix factorization (NNMF) of the co-occurrences matrix, and the subspace of each signal is estimated according to a maximum-likelihood (ML) criterion. Performance evaluation demonstrate comparable clustering accuracies to state-of-the-art at a fraction of the computational load.},
language = {en},
number = {1},
journal = {IEEE Signal Processing Letters},
author = {Adler, Amir and Elad, Michael and Hel-Or, Yacov},
month = jan,
year = {2013},
note = {Conference Name: IEEE Signal Processing Letters},
keywords = {\#Clustering, \#Representation, \#Sparse, \#Statistics, /unread, Accuracy, Aspect model, Clustering algorithms, Complexity theory, Dictionaries, Noise, Probabilistic logic, Sparse matrices, dictionary, non-negative matrix factorization, sparse representation, subspace clustering},
pages = {63--66},
}
Downloads: 0
{"_id":"dvhGmjeSdRwnjJJJx","bibbaseid":"adler-elad-helor-probabilisticsubspaceclusteringviasparserepresentations-2013","author_short":["Adler, A.","Elad, M.","Hel-Or, Y."],"bibdata":{"bibtype":"article","type":"article","title":"Probabilistic Subspace Clustering Via Sparse Representations","volume":"20","issn":"1558-2361","doi":"10.1109/LSP.2012.2229705","abstract":"We present a probabilistic subspace clustering approach that is capable of rapidly clustering very large signal collections. Each signal is represented by a sparse combination of basis elements (atoms), which form the columns of a dictionary matrix. The set of sparse representations is utilized to derive the co-occurrences matrix of atoms and signals, which is modeled as emerging from a mixture model. The components of the mixture model are obtained via a non-negative matrix factorization (NNMF) of the co-occurrences matrix, and the subspace of each signal is estimated according to a maximum-likelihood (ML) criterion. Performance evaluation demonstrate comparable clustering accuracies to state-of-the-art at a fraction of the computational load.","language":"en","number":"1","journal":"IEEE Signal Processing Letters","author":[{"propositions":[],"lastnames":["Adler"],"firstnames":["Amir"],"suffixes":[]},{"propositions":[],"lastnames":["Elad"],"firstnames":["Michael"],"suffixes":[]},{"propositions":[],"lastnames":["Hel-Or"],"firstnames":["Yacov"],"suffixes":[]}],"month":"January","year":"2013","note":"Conference Name: IEEE Signal Processing Letters","keywords":"#Clustering, #Representation, #Sparse, #Statistics, /unread, Accuracy, Aspect model, Clustering algorithms, Complexity theory, Dictionaries, Noise, Probabilistic logic, Sparse matrices, dictionary, non-negative matrix factorization, sparse representation, subspace clustering","pages":"63–66","bibtex":"@article{adler_probabilistic_2013,\n\ttitle = {Probabilistic {Subspace} {Clustering} {Via} {Sparse} {Representations}},\n\tvolume = {20},\n\tissn = {1558-2361},\n\tdoi = {10.1109/LSP.2012.2229705},\n\tabstract = {We present a probabilistic subspace clustering approach that is capable of rapidly clustering very large signal collections. Each signal is represented by a sparse combination of basis elements (atoms), which form the columns of a dictionary matrix. The set of sparse representations is utilized to derive the co-occurrences matrix of atoms and signals, which is modeled as emerging from a mixture model. The components of the mixture model are obtained via a non-negative matrix factorization (NNMF) of the co-occurrences matrix, and the subspace of each signal is estimated according to a maximum-likelihood (ML) criterion. Performance evaluation demonstrate comparable clustering accuracies to state-of-the-art at a fraction of the computational load.},\n\tlanguage = {en},\n\tnumber = {1},\n\tjournal = {IEEE Signal Processing Letters},\n\tauthor = {Adler, Amir and Elad, Michael and Hel-Or, Yacov},\n\tmonth = jan,\n\tyear = {2013},\n\tnote = {Conference Name: IEEE Signal Processing Letters},\n\tkeywords = {\\#Clustering, \\#Representation, \\#Sparse, \\#Statistics, /unread, Accuracy, Aspect model, Clustering algorithms, Complexity theory, Dictionaries, Noise, Probabilistic logic, Sparse matrices, dictionary, non-negative matrix factorization, sparse representation, subspace clustering},\n\tpages = {63--66},\n}\n\n\n\n","author_short":["Adler, A.","Elad, M.","Hel-Or, Y."],"key":"adler_probabilistic_2013","id":"adler_probabilistic_2013","bibbaseid":"adler-elad-helor-probabilisticsubspaceclusteringviasparserepresentations-2013","role":"author","urls":{},"keyword":["#Clustering","#Representation","#Sparse","#Statistics","/unread","Accuracy","Aspect model","Clustering algorithms","Complexity theory","Dictionaries","Noise","Probabilistic logic","Sparse matrices","dictionary","non-negative matrix factorization","sparse representation","subspace clustering"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/zzhenry2012","dataSources":["nZHrFJKyxKKDaWYM8"],"keywords":["#clustering","#representation","#sparse","#statistics","/unread","accuracy","aspect model","clustering algorithms","complexity theory","dictionaries","noise","probabilistic logic","sparse matrices","dictionary","non-negative matrix factorization","sparse representation","subspace clustering"],"search_terms":["probabilistic","subspace","clustering","via","sparse","representations","adler","elad","hel-or"],"title":"Probabilistic Subspace Clustering Via Sparse Representations","year":2013}