DocumentCode
1800315
Title
Improving deep classification by centroid-based candidate selection strategy
Author
He, Li ; Tan, Junwu ; Jia, Yan ; Han, Weihong ; Tan, Shuang
Author_Institution
Sch. of Comput. Sci., Nat. Univ. of Defense Technol., Changsha, China
Volume
3
fYear
2011
fDate
24-26 Dec. 2011
Firstpage
1419
Lastpage
1423
Abstract
According to the Large Scale Hierarchical Classification Workshop of the ECIR 2010 [6], we know that the performance of classification for the large scale hierarchy, such as Open Directory Project (ODP), is still lower. Obviously, we need to improve the performance of hierarchical classification urgently. While a deep classification method [1] was proposed to make the problem tractable, the candidate selection method might be a bottleneck in the deep classification. In this paper, we used a centroid-based classification algorithm as the candidate selection strategy to enhance the deep classification. We conducted experiments with all the Chinese categories on the Open Directory Project. The experimental results show that the proposed method improved the performance of classification through selecting candidate accurately.
Keywords
Internet; pattern classification; Chinese categories; ODP; centroid-based candidate selection strategy; centroid-based classification algorithm; deep classification; large scale hierarchical classification workshop; open directory project; Complexity theory; Educational institutions; Irrigation; Text categorization; centroid-based candidate selection; deep classification; large scale hierarchy classification;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Network Technology (ICCSNT), 2011 International Conference on
Conference_Location
Harbin
Print_ISBN
978-1-4577-1586-0
Type
conf
DOI
10.1109/ICCSNT.2011.6182231
Filename
6182231
Link To Document