Learning Cumulatively to Become More Knowledgeable

被引:57
作者
Fei, Geli [1 ]
Wang, Shuai [1 ]
Liu, Bing [1 ]
机构
[1] Univ Illinois, Dept Comp Sci, Chicago, IL 60607 USA
来源
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING | 2016年
基金
美国国家科学基金会;
关键词
Cumulative machine learning; lifelong machine learning; unseen classes; open world classification;
D O I
10.1145/2939672.2939835
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In classic supervised learning, a learning algorithm takes a fixed training data of several classes to build a classifier. In this paper, we propose to study a new problem, i.e., building a learning system that learns cumulatively. As time goes by, the system sees and learns more and more classes of data and becomes more and more knowledgeable. We believe that this is similar to human learning. We humans learn continuously, retaining the learned knowledge, identifying and learning new things, and updating the existing knowledge with new experiences. Over time, we cumulate more and more knowledge. A learning system should be able to do the same. As algorithmic learning matures, it is time to tackle this cumulative machine learning (or simply cumulative learning) problem, which is a kind of lifelong machine learning problem. It presents two major challenges. First, the system must be able to detect data from unseen classes in the test set. Classic supervised learning, however, assumes all classes in testing are known or seen at the training time. Second, the system needs to be able to selectively update its models whenever a new class of data arrives without re-training the whole system using the entire past and present training data. This paper proposes a novel approach and system to tackle these challenges. Experimental results on two datasets with learning from 2 classes to up to 100 classes show that the proposed approach is highly promising in terms of both classification accuracy and computational efficiency.
引用
收藏
页码:1565 / 1574
页数:10
相关论文
共 42 条
[1]  
[Anonymous], 1993, Technical report
[2]  
[Anonymous], 2013, CoRR
[3]  
[Anonymous], 1996, NIPS
[4]   A polynomial-time algorithm for learning noisy linear threshold functions [J].
Blum, A ;
Frieze, A ;
Kannan, R ;
Vempala, S .
37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, :330-338
[5]  
Bravo Cristian, 2008, 2008 8th International Conference on Hybrid Intelligent Systems (HIS), P649, DOI 10.1109/HIS.2008.112
[6]  
Brunskill E, 2014, PR MACH LEARN RES, V32, P316
[7]  
Buckley C., 1994, SIGIR '94. Proceedings of the Seventeenth Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval, P292
[8]  
Carlson A., 2010, AAAI, V5, P3
[9]  
Cauwenberghs G., 2000, Incremental and decremental support vector machine learning
[10]   LIBSVM: A Library for Support Vector Machines [J].
Chang, Chih-Chung ;
Lin, Chih-Jen .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2011, 2 (03)