Multi-label classification via label correlation and first order feature dependance in a data stream

被引:41
作者
Tien Thanh Nguyen [1 ]
Thi Thu Thuy Nguyen [2 ]
Anh Vu Luong [3 ]
Quoc Viet Hung Nguyen [2 ]
Liew, Alan Wee-Chung [2 ]
Stantic, Bela [2 ]
机构
[1] Robert Gordon Univ, Sch Comp Sci & Digital Media, Aberdeen, Scotland
[2] Griffith Univ, Sch Informat & Commun Technol, Nathan, Qld, Australia
[3] Hanoi Univ Sci & Technol, Sch Appl Math & Informat, Hanoi, Vietnam
关键词
Multi-label classification; Multi-label learning; Online learning; Data stream; Concept drift; Label correlation; Feature dependence; MISSING VALUE IMPUTATION; NAIVE BAYES; STATISTICAL COMPARISONS; FEATURE-SELECTION; CLASSIFIERS; EFFICIENT; ENSEMBLE;
D O I
10.1016/j.patcog.2019.01.007
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many batch learning algorithms have been introduced for offline multi-label classification (MLC) over the years. However, the increasing data volume in many applications such as social networks, sensor networks, and traffic monitoring has posed many challenges to batch MLC learning. For example, it is often expensive to re-train the model with the newly arrived samples, or it is impractical to learn on the large volume of data at once. The research on incremental learning is therefore applicable to a large volume of data and especially for data stream. In this study, we develop a Bayesian-based method for learning from multi-label data streams by taking into consideration the correlation between pairs of labels and the relationship between label and feature. In our model, not only the label correlation is learned with each arrived sample with ground truth labels but also the number of predicted labels are adjusted based on Hoeffding inequality and the label cardinality. We also extend the model to handle missing values, a problem common in many real-world data. To handle concept drift, we propose a decay mechanism focusing on the age of the arrived samples to incrementally adapt to the change of data. The experimental results show that our method is highly competitive compared to several well-known benchmark algorithms under both the stationary and concept drift settings. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页码:35 / 51
页数:17
相关论文
共 73 条
[1]  
[Anonymous], 2011, IJCAI Proceedings-International Joint Conference on Artificial Intelligence, DOI DOI 10.5591/978-1-57735-516-8/IJCAI11-220
[2]  
[Anonymous], 2017, ADV NEURAL INFORM PR
[3]  
[Anonymous], 2016, J Mach Learn Res
[4]  
Bifet A., 2007, P ICDM
[5]  
Bifet A., 2010, J MACH LEARN RES WOR, V11
[6]  
Bifet A, 2009, LECT NOTES COMPUT SC, V5772, P249, DOI 10.1007/978-3-642-03915-7_22
[7]  
Bifet A, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P139
[8]   Learning multi-label scene classification [J].
Boutell, MR ;
Luo, JB ;
Shen, XP ;
Brown, CM .
PATTERN RECOGNITION, 2004, 37 (09) :1757-1771
[9]  
Chen Yao-Nan, 2012, Advances in Neural Information Processing Systems, P1538
[10]  
Clare A, 2001, LNCS LNAI, P42, DOI DOI 10.1007/3-540-44794-6_4