{"title":"Online sketching for big data subspace learning","authors":"M. Mardani, G. Giannakis","doi":"10.1109/EUSIPCO.2015.7362837","DOIUrl":null,"url":null,"abstract":"Sketching (a.k.a. subsampling) high-dimensional data is a crucial task to facilitate data acquisition process e.g., in magnetic resonance imaging, and to render affordable `Big Data' analytics. Multidimensional nature and the need for realtime processing of data however pose major obstacles. To cope with these challenges, the present paper brings forth a novel real-time sketching scheme that exploits the correlations across data stream to learn a latent subspace based upon tensor PARAFAC decomposition `on the fly.' Leveraging the online subspace updates, we introduce a notion of importance score, which is subsequently adapted into a randomization scheme to predict a minimal subset of important features to acquire in the next time instant. Preliminary tests with synthetic data corroborate the effectiveness of the novel scheme relative to uniform sampling.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 23rd European Signal Processing Conference (EUSIPCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUSIPCO.2015.7362837","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Sketching (a.k.a. subsampling) high-dimensional data is a crucial task to facilitate data acquisition process e.g., in magnetic resonance imaging, and to render affordable `Big Data' analytics. Multidimensional nature and the need for realtime processing of data however pose major obstacles. To cope with these challenges, the present paper brings forth a novel real-time sketching scheme that exploits the correlations across data stream to learn a latent subspace based upon tensor PARAFAC decomposition `on the fly.' Leveraging the online subspace updates, we introduce a notion of importance score, which is subsequently adapted into a randomization scheme to predict a minimal subset of important features to acquire in the next time instant. Preliminary tests with synthetic data corroborate the effectiveness of the novel scheme relative to uniform sampling.