Swarm Intelligence for Non-Negative Matrix Factorization

被引:41
作者
Janecek, Andreas [1 ]
Tan, Ying [2 ,3 ,4 ]
机构
[1] Peking Univ, Sch Elect Engn & Comp Sci, Beijing, Peoples R China
[2] Peking Univ, Key Lab Machine Percept MOE, Beijing, Peoples R China
[3] Peking Univ, Dept Machine Intelligence, EECS, Beijing, Peoples R China
[4] Peking Univ, CIL, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Differential Evolution; Email Classification; Fireworks Algorithm; Fish School Search; Genetic Algorithms; NMF Initialization; Nonnegative Matrix Factorization (NMF); Particle Swarm Optimization;
D O I
10.4018/jsir.2011100102
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Non-negative Matrix Factorization (NMF) is a special low-rank approximation which allows for an additive parts- based and interpretable representation of the data. This article presents efforts to improve the convergence, approximation quality, and classification accuracy of NMF using five different meta-heuristics based on swarm intelligence. Several properties of the NMF objective function motivate the utilization of meta-heuristics: this function is non-convex, discontinuous, and may possess many local minima. The proposed optimization strategies are two-fold: On the one hand, a new initialization strategy for NMF is presented in order to initialize the NMF factors prior to the factorization; on the other hand, an iterative update strategy is proposed, which improves the accuracy per runtime for the multiplicative update NMF algorithm. The success of the proposed optimization strategies are shown by applying them on synthetic data and data sets coming from the areas of spam filtering/email classification, and evaluate them also in their application context. Experimental results show that both optimization strategies are able to improve NMF in terms of faster convergence, lower approximation error, and better classification accuracy. Especially the initialization strategy leads to significant reductions of the runtime per accuracy ratio for both, the NMF approximation as well as the classification results achieved with NMF.
引用
收藏
页码:12 / 34
页数:23
相关论文
共 38 条
[1]  
Bastos CJA, 2009, STUD COMPUT INTELL, V193, P261
[2]   Algorithms and applications for approximate nonnegative matrix factorization [J].
Berry, Michael W. ;
Browne, Murray ;
Langville, Amy N. ;
Pauca, V. Paul ;
Plemmons, Robert J. .
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2007, 52 (01) :155-173
[3]   LARGE-SCALE SPARSE SINGULAR VALUE COMPUTATIONS [J].
BERRY, MW .
INTERNATIONAL JOURNAL OF SUPERCOMPUTER APPLICATIONS AND HIGH PERFORMANCE COMPUTING, 1992, 6 (01) :13-49
[4]   Matrices, vector spaces, and information retrieval [J].
Berry, MW ;
Drmac, Z ;
Jessup, ER .
SIAM REVIEW, 1999, 41 (02) :335-362
[5]  
Blackwell T., 2007, EVOLUTIONARY COMPUTA, P29, DOI [10.1007/978-3-540-49774-5_2, DOI 10.1007/978-3-540-49774-5_2]
[6]   SVD based initialization: A head start for nonnegative matrix factorization [J].
Boutsidis, C. ;
Gallopoulos, E. .
PATTERN RECOGNITION, 2008, 41 (04) :1350-1362
[7]   Defining a standard for particle swarm optimization [J].
Bratton, Daniel ;
Kennedy, James .
2007 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2007, :120-+
[8]  
Haupt R. L., 2005, PRACTICAL GENETIC AL
[9]  
Janecek A., 2011, 2011 Seventh International Conference on Natural Computation (ICNC 2011), P1668, DOI 10.1109/ICNC.2011.6022356
[10]  
Janecek A., 2010, EFFICIENT FEATURE RE