2011 IEEE 11th International Conference on Data Mining (2011)
Dec. 11, 2011 to Dec. 14, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2011.147
In this paper, we investigate how to design an optimized discriminating order for boosting multiclass classification. The main idea is to optimize a binary tree architecture, referred to as Sequential Discriminating Tree (SDT), that performs the multiclass classification through a hierarchical sequence of coarse-to-fine binary classifiers. To infer such a tree architecture, we employ the constrained large margin clustering procedure which enforces samples belonging to the same class to locate at the same side of the hyper plane while maximizing the margin between these two partitioned class subsets. The proposed SDT algorithm has a theoretic error bound which is shown experimentally to effectively guarantee the generalization performance. Experiment results indicate that SDT clearly beats the state-of-the-art multiclass classification algorithms.
Discriminating Order, Multiclass, Sequential Discriminating Tree
S. Chang, D. Liu, H. Zhang, X. Hua, Y. Mu and S. Yan, "Towards Optimal Discriminating Order for Multiclass Classification," 2011 IEEE 11th International Conference on Data Mining(ICDM), Vancouver, Canada, 2011, pp. 388-397.