Clustering in extreme learning machine feature space

被引:78
作者
He, Qing [1 ]
Jin, Xin [1 ,2 ]
Du, Changying [1 ,2 ]
Zhuang, Fuzhen [1 ]
Shi, Zhongzhi [1 ]
机构
[1] Chinese Acad Sci, Inst Comp Technol, Key Lab Intelligent Informat Proc, Beijing 100190, Peoples R China
[2] Chinese Acad Sci, Grad Univ, Beijing 100049, Peoples R China
基金
中国国家自然科学基金;
关键词
Extreme learning machine (ELM); ELM feature space; Data clustering; Nonnegative matrix factorization (NMF); ELM kMeans; ELM NMF clustering; EFFICIENT ALGORITHM; KERNEL;
D O I
10.1016/j.neucom.2012.12.063
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Extreme learning machine (ELM), used for the "generalized" single-hidden-layer feedforward networks (SLFNs), is a unified learning platform that can use a widespread type of feature mappings. In theory, ELM can approximate any target continuous function and classify any disjoint regions; in application, many experiment results have already demonstrated the good performance of ELM. In view of the good properties of the ELM feature mapping, the clustering problem using ELM feature mapping techniques is studied in this paper. Experiments show that the proposed ELM Weans algorithm and ELM NMF (nonnegative matrix factorization) clustering can get better clustering results than the corresponding Mercer kernel based methods and the traditional algorithms using the original data. Moreover, the proposed methods have the advantage of being more convenient to implementation and computation, as the ELM feature mapping is much simpler than the Mercer kernel function based feature mapping methods. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:88 / 95
页数:8
相关论文
共 37 条
[1]  
[Anonymous], 2003, P 26 ANN INT ACM SIG, DOI DOI 10.1145/860435.860485
[2]  
[Anonymous], 2007, Uci machine learning repository
[3]   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
[4]   Nonnegative matrix factorization in polynomial feature space [J].
Buciu, Ioan ;
Nikolaidis, Nikos ;
Pitas, Ioannis .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2008, 19 (06) :1090-1100
[5]   A novel kernel method for clustering [J].
Camastra, F ;
Verri, A .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (05) :801-U4
[6]  
Cieri C, 2002, KLUW S INF, V12, P33
[7]  
DEERWESTER S, 1990, J AM SOC INFORM SCI, V41, P391, DOI 10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO
[8]  
2-9
[9]   EFFICIENT ALGORITHM FOR A COMPLETE LINK METHOD [J].
DEFAYS, D .
COMPUTER JOURNAL, 1977, 20 (04) :364-366
[10]  
Ester M., 1996, KDD-96 Proceedings. Second International Conference on Knowledge Discovery and Data Mining, P226