Efficient nonnegative matrix factorization with random projections

Fei Wang, Ping Li

Research output: Contribution to conferencePaper

23 Citations (Scopus)

Abstract

The recent years have witnessed a surge of interests in Nonnegative Matrix Factorization (NMF) in data mining and machine learning fields. Despite its elegant theory and empirical success, one of the limitations of NMF based algorithms is that it needs to store the whole data matrix in the entire process, which requires expensive storage and computation costs when the data set is large and high-dimensional. In this paper, we propose to apply the random projection techniques to accelerate the NMF process. Both theoretical analysis and experimental validations will be presented to demonstrate the effectiveness of the proposed strategy.

Original languageEnglish (US)
Pages281-292
Number of pages12
StatePublished - Dec 1 2010
Externally publishedYes
Event10th SIAM International Conference on Data Mining, SDM 2010 - Columbus, OH, United States
Duration: Apr 29 2010May 1 2010

Other

Other10th SIAM International Conference on Data Mining, SDM 2010
CountryUnited States
CityColumbus, OH
Period4/29/105/1/10

Fingerprint

Factorization
Data mining
Learning systems
Costs

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Wang, F., & Li, P. (2010). Efficient nonnegative matrix factorization with random projections. 281-292. Paper presented at 10th SIAM International Conference on Data Mining, SDM 2010, Columbus, OH, United States.
Wang, Fei ; Li, Ping. / Efficient nonnegative matrix factorization with random projections. Paper presented at 10th SIAM International Conference on Data Mining, SDM 2010, Columbus, OH, United States.12 p.
@conference{5a8340e9a2bb493cb0fbef569d0544af,
title = "Efficient nonnegative matrix factorization with random projections",
abstract = "The recent years have witnessed a surge of interests in Nonnegative Matrix Factorization (NMF) in data mining and machine learning fields. Despite its elegant theory and empirical success, one of the limitations of NMF based algorithms is that it needs to store the whole data matrix in the entire process, which requires expensive storage and computation costs when the data set is large and high-dimensional. In this paper, we propose to apply the random projection techniques to accelerate the NMF process. Both theoretical analysis and experimental validations will be presented to demonstrate the effectiveness of the proposed strategy.",
author = "Fei Wang and Ping Li",
year = "2010",
month = "12",
day = "1",
language = "English (US)",
pages = "281--292",
note = "10th SIAM International Conference on Data Mining, SDM 2010 ; Conference date: 29-04-2010 Through 01-05-2010",

}

Wang, F & Li, P 2010, 'Efficient nonnegative matrix factorization with random projections' Paper presented at 10th SIAM International Conference on Data Mining, SDM 2010, Columbus, OH, United States, 4/29/10 - 5/1/10, pp. 281-292.

Efficient nonnegative matrix factorization with random projections. / Wang, Fei; Li, Ping.

2010. 281-292 Paper presented at 10th SIAM International Conference on Data Mining, SDM 2010, Columbus, OH, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Efficient nonnegative matrix factorization with random projections

AU - Wang, Fei

AU - Li, Ping

PY - 2010/12/1

Y1 - 2010/12/1

N2 - The recent years have witnessed a surge of interests in Nonnegative Matrix Factorization (NMF) in data mining and machine learning fields. Despite its elegant theory and empirical success, one of the limitations of NMF based algorithms is that it needs to store the whole data matrix in the entire process, which requires expensive storage and computation costs when the data set is large and high-dimensional. In this paper, we propose to apply the random projection techniques to accelerate the NMF process. Both theoretical analysis and experimental validations will be presented to demonstrate the effectiveness of the proposed strategy.

AB - The recent years have witnessed a surge of interests in Nonnegative Matrix Factorization (NMF) in data mining and machine learning fields. Despite its elegant theory and empirical success, one of the limitations of NMF based algorithms is that it needs to store the whole data matrix in the entire process, which requires expensive storage and computation costs when the data set is large and high-dimensional. In this paper, we propose to apply the random projection techniques to accelerate the NMF process. Both theoretical analysis and experimental validations will be presented to demonstrate the effectiveness of the proposed strategy.

UR - http://www.scopus.com/inward/record.url?scp=79951743210&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79951743210&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:79951743210

SP - 281

EP - 292

ER -

Wang F, Li P. Efficient nonnegative matrix factorization with random projections. 2010. Paper presented at 10th SIAM International Conference on Data Mining, SDM 2010, Columbus, OH, United States.