模式识别与人工智能
Thursday, Apr. 3, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2011, Vol. 24 Issue (1): 97-102    DOI:
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
Active Learning Algorithm Based on Neighborhood Entropy
WANG Zhen-Yu, WANG Xi-Zhao
Key Laboratory of Machine Learning and Computational Intelligence,
College of Mathematics and Computer Science, Hebei University, Baoding 071002

Download: PDF (367 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  Neighborhood entropy is adopted as the sample selection criteria in active learning. The example with the highest entropy value is considered as the most uncertain one based on current nearest neighbor rule. And labeling the most uncertain example can achieve higher accuracy with fewer samples. An active learning algorithm based on neighborhood entropy is proposed. The scheme estimates entropy value of neighbor unlabeled sample and label the sample with the highest value. Experimental results show the example selection based on neighborhood entropy achieves higher accuracy compared with maximal distance sampling and random sampling.
Key wordsActive Learning      Nearest Neighbor      Maximum Entropy      Example Selection     
Received: 07 April 2010     
ZTFLH: TP301.6  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
WANG Zhen-Yu
WANG Xi-Zhao
Cite this article:   
WANG Zhen-Yu,WANG Xi-Zhao. Active Learning Algorithm Based on Neighborhood Entropy[J]. , 2011, 24(1): 97-102.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2011/V24/I1/97
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn