SparkDict: A fast dictionary learning algorithm. Schnier, T., Bockelmann, C., & Dekorsy, A. In 2017 25th European Signal Processing Conference (EUSIPCO), pages 1564-1568, Aug, 2017.
![SparkDict: A fast dictionary learning algorithm [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper doi abstract bibtex
Paper doi abstract bibtex For the always increasing amount of data new tools are needed to effectively harvest important information out of them. One of the core fields for data mining is Dictionary Learning, the search for a sparse representation of given data, which is widely used in signal processing and machine learning. In this paper we present a new algorithm in this field that is based on random projections of the data. In particular, we show that our proposition needs a lot less training samples and is a lot faster to achieve the same dictionary accuracy as state of the art algorithms, especially in the medium to high sparsity regions. As the spark, the minimum number of linear dependent columns of a matrix, plays an important role in the design of our contribution, we coined our contribution SparkDict.
@InProceedings{8081472,
author = {T. Schnier and C. Bockelmann and A. Dekorsy},
booktitle = {2017 25th European Signal Processing Conference (EUSIPCO)},
title = {SparkDict: A fast dictionary learning algorithm},
year = {2017},
pages = {1564-1568},
abstract = {For the always increasing amount of data new tools are needed to effectively harvest important information out of them. One of the core fields for data mining is Dictionary Learning, the search for a sparse representation of given data, which is widely used in signal processing and machine learning. In this paper we present a new algorithm in this field that is based on random projections of the data. In particular, we show that our proposition needs a lot less training samples and is a lot faster to achieve the same dictionary accuracy as state of the art algorithms, especially in the medium to high sparsity regions. As the spark, the minimum number of linear dependent columns of a matrix, plays an important role in the design of our contribution, we coined our contribution SparkDict.},
keywords = {data mining;image representation;learning (artificial intelligence);sparse matrices;data mining;sparse representation;signal processing;machine learning;high sparsity regions;SparkDict;fast dictionary learning algorithm;random data projections;Dictionaries;Signal processing algorithms;Machine learning;Sparks;Signal processing;Sparse matrices;Algorithm design and analysis;Dictionary Learning;Spark;Sparsity},
doi = {10.23919/EUSIPCO.2017.8081472},
issn = {2076-1465},
month = {Aug},
url = {https://www.eurasip.org/proceedings/eusipco/eusipco2017/papers/1570341620.pdf},
}Downloads: 0
{"_id":"g9Ts2fgjsEjTDgJ5Z","bibbaseid":"schnier-bockelmann-dekorsy-sparkdictafastdictionarylearningalgorithm-2017","authorIDs":[],"author_short":["Schnier, T.","Bockelmann, C.","Dekorsy, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["T."],"propositions":[],"lastnames":["Schnier"],"suffixes":[]},{"firstnames":["C."],"propositions":[],"lastnames":["Bockelmann"],"suffixes":[]},{"firstnames":["A."],"propositions":[],"lastnames":["Dekorsy"],"suffixes":[]}],"booktitle":"2017 25th European Signal Processing Conference (EUSIPCO)","title":"SparkDict: A fast dictionary learning algorithm","year":"2017","pages":"1564-1568","abstract":"For the always increasing amount of data new tools are needed to effectively harvest important information out of them. One of the core fields for data mining is Dictionary Learning, the search for a sparse representation of given data, which is widely used in signal processing and machine learning. In this paper we present a new algorithm in this field that is based on random projections of the data. In particular, we show that our proposition needs a lot less training samples and is a lot faster to achieve the same dictionary accuracy as state of the art algorithms, especially in the medium to high sparsity regions. As the spark, the minimum number of linear dependent columns of a matrix, plays an important role in the design of our contribution, we coined our contribution SparkDict.","keywords":"data mining;image representation;learning (artificial intelligence);sparse matrices;data mining;sparse representation;signal processing;machine learning;high sparsity regions;SparkDict;fast dictionary learning algorithm;random data projections;Dictionaries;Signal processing algorithms;Machine learning;Sparks;Signal processing;Sparse matrices;Algorithm design and analysis;Dictionary Learning;Spark;Sparsity","doi":"10.23919/EUSIPCO.2017.8081472","issn":"2076-1465","month":"Aug","url":"https://www.eurasip.org/proceedings/eusipco/eusipco2017/papers/1570341620.pdf","bibtex":"@InProceedings{8081472,\n author = {T. Schnier and C. Bockelmann and A. Dekorsy},\n booktitle = {2017 25th European Signal Processing Conference (EUSIPCO)},\n title = {SparkDict: A fast dictionary learning algorithm},\n year = {2017},\n pages = {1564-1568},\n abstract = {For the always increasing amount of data new tools are needed to effectively harvest important information out of them. One of the core fields for data mining is Dictionary Learning, the search for a sparse representation of given data, which is widely used in signal processing and machine learning. In this paper we present a new algorithm in this field that is based on random projections of the data. In particular, we show that our proposition needs a lot less training samples and is a lot faster to achieve the same dictionary accuracy as state of the art algorithms, especially in the medium to high sparsity regions. As the spark, the minimum number of linear dependent columns of a matrix, plays an important role in the design of our contribution, we coined our contribution SparkDict.},\n keywords = {data mining;image representation;learning (artificial intelligence);sparse matrices;data mining;sparse representation;signal processing;machine learning;high sparsity regions;SparkDict;fast dictionary learning algorithm;random data projections;Dictionaries;Signal processing algorithms;Machine learning;Sparks;Signal processing;Sparse matrices;Algorithm design and analysis;Dictionary Learning;Spark;Sparsity},\n doi = {10.23919/EUSIPCO.2017.8081472},\n issn = {2076-1465},\n month = {Aug},\n url = {https://www.eurasip.org/proceedings/eusipco/eusipco2017/papers/1570341620.pdf},\n}\n\n","author_short":["Schnier, T.","Bockelmann, C.","Dekorsy, A."],"key":"8081472","id":"8081472","bibbaseid":"schnier-bockelmann-dekorsy-sparkdictafastdictionarylearningalgorithm-2017","role":"author","urls":{"Paper":"https://www.eurasip.org/proceedings/eusipco/eusipco2017/papers/1570341620.pdf"},"keyword":["data mining;image representation;learning (artificial intelligence);sparse matrices;data mining;sparse representation;signal processing;machine learning;high sparsity regions;SparkDict;fast dictionary learning algorithm;random data projections;Dictionaries;Signal processing algorithms;Machine learning;Sparks;Signal processing;Sparse matrices;Algorithm design and analysis;Dictionary Learning;Spark;Sparsity"],"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/Roznn/EUSIPCO/main/eusipco2017url.bib","creationDate":"2021-02-13T16:38:25.685Z","downloads":0,"keywords":["data mining;image representation;learning (artificial intelligence);sparse matrices;data mining;sparse representation;signal processing;machine learning;high sparsity regions;sparkdict;fast dictionary learning algorithm;random data projections;dictionaries;signal processing algorithms;machine learning;sparks;signal processing;sparse matrices;algorithm design and analysis;dictionary learning;spark;sparsity"],"search_terms":["sparkdict","fast","dictionary","learning","algorithm","schnier","bockelmann","dekorsy"],"title":"SparkDict: A fast dictionary learning algorithm","year":2017,"dataSources":["2MNbFYjMYTD6z7ExY","uP2aT6Qs8sfZJ6s8b"]}