• DocumentCode
    3178733
  • Title

    A SVM Text Classification Approch Based on Binary Tree

  • Author

    Weifa, Zheng

  • Author_Institution
    Educ. Technol. Center, Guangdong Univ. of Bus. Studies(GDBC), Guangzhou, China
  • Volume
    3
  • fYear
    2009
  • fDate
    25-27 Dec. 2009
  • Firstpage
    455
  • Lastpage
    458
  • Abstract
    Support vector machine(SVM ) is based on minimal structure analysis principle, it can it can solve the dimension disaster, regionally minimal problems, etc. But the common SVM can only solve binary classification. Some research develope algorithm that can solve multi-class classification through constructing binary tree with several binary SVM, the research yields some fruits. Linguistics research result show that of all the extracted feature word, noun and verb make up a great proportions, about 65.5%. Based the above knowledge, we improve the SVM multi-class classification by introducing an algorithm of constructing binary tree, which use the Chinese part-of-speech information to reduce the dimension; we also optimize the binary tree node sequence by calculating the distances of the classes. Experimental results shows that the proposed SVM-multi-class classification have high precision and recall rate.
  • Keywords
    pattern classification; support vector machines; text analysis; trees (mathematics); Chinese part-of-speech information; SVM text classification approach; binary classification; binary tree; minimal structure analysis principle; support vector machine; Application software; Binary trees; Classification tree analysis; Computer applications; Computer errors; Educational technology; Error correction; Support vector machine classification; Support vector machines; Text categorization; Binary Tree; Part-of-Speech; Support Vector Machine; Text Classification;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science-Technology and Applications, 2009. IFCSTA '09. International Forum on
  • Conference_Location
    Chongqing
  • Print_ISBN
    978-0-7695-3930-0
  • Electronic_ISBN
    978-1-4244-5423-5
  • Type

    conf

  • DOI
    10.1109/IFCSTA.2009.351
  • Filename
    5384927