Manifold Adaptive Experimental Design for Text Categorization

Authors:
Deng Cai;Xiaofei He
Affiliations:
Zhejiang Univerisity, Hangzhou;Zhejiang University, Hangzhou
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
2012

Citing 0
Cited 4

Recursive "concave-convex" Fisher Linear Discriminant with applications to face, handwritten digit and terrain recognition

Pattern Recognition
Batch Mode Active Sampling Based on Marginal Probability Distribution Matching

ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on ACM SIGKDD 2012
Locally discriminative spectral clustering with composite manifold

Neurocomputing
Active learning via neighborhood reconstruction

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many information processing tasks, labels are usually expensive and the unlabeled data points are abundant. To reduce the cost on collecting labels, it is crucial to predict which unlabeled examples are the most informative, i.e., improve the classifier the most if they were labeled. Many active learning techniques have been proposed for text categorization, such as {\rm SVM}_{Active} and Transductive Experimental Design. However, most of previous approaches try to discover the discriminant structure of the data space, whereas the geometrical structure is not well respected. In this paper, we propose a novel active learning algorithm which is performed in the data manifold adaptive kernel space. The manifold structure is incorporated into the kernel space by using graph Laplacian. This way, the manifold adaptive kernel space reflects the underlying geometry of the data. By minimizing the expected error with respect to the optimal classifier, we can select the most representative and discriminative data points for labeling. Experimental results on text categorization have demonstrated the effectiveness of our proposed approach.