title: Unsupervised active learning based on hierarchical graph-theoretic clustering.
abstract: Most existing active learning approaches are supervised. Supervised active learning has the following problems: inefficiency in dealing with the semantic gap between the distribution of samples in the feature space and their labels, lack of ability in selecting new samples that belong to new categories that have not yet appeared in the training samples, and lack of adaptability to changes in the semantic interpretation of sample categories. To tackle these problems, we propose an unsupervised active learning framework based on hierarchical graph-theoretic clustering. In the framework, two promising graph-theoretic clustering algorithms, namely, dominant-set clustering and spectral clustering, are combined in a hierarchical fashion. Our framework has some advantages, such as ease of implementation, flexibility in architecture, and adaptability to changes in the labeling. Evaluations on data sets for network intrusion detection, image classification, and video classification have demonstrated that our active learning framework can effectively reduce the workload of manual classification while maintaining a high accuracy of automatic classification. It is shown that, overall, our framework outperforms the support-vector-machine-based supervised active learning, particularly in terms of dealing much more efficiently with new samples whose categories have not yet appeared in the training samples.
authors.affiliation: National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China. wmhu@nlpr.ia.ac.cn
authors.forename: Weiming
authors.initials: W
authors.lastname: Hu
authors.forename: Wei
authors.initials: W
authors.lastname: Hu
authors.forename: Nianhua
authors.initials: N
authors.lastname: Xie
authors.forename: Steve
authors.initials: S
authors.lastname: Maybank