Learning similarity with cosine similarity ensemble

被引:298
作者
Xia, Peipei [1 ,2 ]
Zhang, Li [1 ,2 ,3 ]
Li, Fanzhang [1 ,2 ]
机构
[1] Soochow Univ, Sch Comp Sci & Technol, Suzhou 215006, Jiangsu, Peoples R China
[2] Soochow Univ, Prov Key Lab Comp Informat Proc Technol, Suzhou 215006, Jiangsu, Peoples R China
[3] Collaborat Innovat Ctr Novel Software Technol & I, Nanjing 210000, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Similarity learning; Cosine similarity; Ensemble learning; Selective ensemble; Machine learning; NEURAL-NETWORKS;
D O I
10.1016/j.ins.2015.02.024
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
There is no doubt that similarity is a fundamental notion in the field of machine learning and pattern recognition. How to represent and measure similarity appropriately is a pursuit of many researchers. Many tasks, such as classification and clustering, can be accomplished perfectly when a similarity metric is well-defined. Cosine similarity is a widely used metric that is both simple and effective. This paper proposes a cosine similarity ensemble (CSE) method for learning similarity. In CSE, diversity is guaranteed by using multiple cosine similarity learners, each of which makes use of a different initial point to define the pattern vectors used in its similarity measures. The CSE method is not limited to measuring similarity using only pattern vectors that start at the origin. In addition, the thresholds of these separate cosine similarity learners are adaptively determined. The idea of using a selective ensemble is also implemented in CSE, and the proposed CSE method outperforms other compared methods on various data sets. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:39 / 52
页数:14
相关论文
共 35 条
[1]  
[Anonymous], P NIPS
[2]  
Bartlett P. L., 2003, Journal of Machine Learning Research, V3, P463, DOI 10.1162/153244303321897690
[3]   A tutorial on Support Vector Machines for pattern recognition [J].
Burges, CJC .
DATA MINING AND KNOWLEDGE DISCOVERY, 1998, 2 (02) :121-167
[4]  
Chakrabarti Soumen., 2000, ACM SIGKDD Explorations, P1, DOI 10.1145/846183.846187
[5]  
Chawla NV, 2004, SIGKDD Explor. Newsl., V6, P1
[6]   Predictive Ensemble Pruning by Expectation Propagation [J].
Chen, Huanhuan ;
Tino, Peter ;
Yao, Xin .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2009, 21 (07) :999-1013
[7]  
Chen LB, 2002, 2002 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-4, PROCEEDINGS, P2152, DOI 10.1109/ICMLC.2002.1175419
[8]   Learning a similarity metric discriminatively, with application to face verification [J].
Chopra, S ;
Hadsell, R ;
LeCun, Y .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :539-546
[9]   NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+
[10]  
Cristianini Nello, 2000, An introduction to support vector machines and other kernel-based learning methods