Earticle

현재 위치 Home

Text Representation Based on Key Terms of Document for Text Categorization

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJDTA) 바로가기
  • 간행물
    International Journal of Database Theory and Application SCOPUS 바로가기
  • 통권
    Vol.9 No.4 (2016.04)바로가기
  • 페이지
    pp.1-22
  • 저자
    Jieming Yang, Zhiying Liu, Zhaoyang Qu
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A272707

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
The text representation, “bag of words” or vector space model, is widely used by most of the classifiers in text categorization. All the documents fed into the classifier are represented as a vector in the vector space, which consists of all the terms extracted from training set. Due to the characteristics of high dimensionality, feature selection algorithm is usually used to reduce the dimensionality of the vector space. Through feature selection, each document is represented by some representative terms extracted from the training set. Although the classification results based on this document representation methodare better, it is inevitable that some documents may contain few even none representative terms, and these documents must be misclassified. In this paper, we proposed a new text representation method, KT-of-DOC, which represents one document using some key terms extracted from this document. We selected key terms of each document based on six feature selection algorithms, Improved Gini Index (GINI), Information Gain (IG), Mutual Information (MI), Odds Ratio (OR), Ambiguity Measure (AM) and DIA association factor (DIA), respectively, and evaluated the performance of two classifiers, Support Vector Machines (SVM) and K-Nearest Neighbors (KNN), on three benchmark collections, 20-Newsgroups, Reuters-21578 and WebKB. The results show that the proposed representation method can significantly improve the performance of classifier.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Algorithm Description
  3.1. Problem and Motivation
  3.2. Algorithm Implement
  3.3 Complexity Analysis
 4. Experiment Setup
  4.1 Feature-Selection Algorithms
  4.2. Data Sets
  4.3 Classifiers
  4.4. Performance Measures
 5. Results
  5.1 Results of Algorithm for SVM
  5.2 Results of Algorithm for KNN  
 6. Discussions
 7. Conclusion
 Acknowledgment
 References

키워드

text representation feature selection key term text categorization

저자

  • Jieming Yang [ College of Information Engineering, Northeast Dianli University, Jilin, Jilin, China ] Corresponding author
  • Zhiying Liu [ College of Information Engineering, Northeast Dianli University, Jilin, Jilin, China ]
  • Zhaoyang Qu [ College of Information Engineering, Northeast Dianli University, Jilin, Jilin, China ]

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJDTA) [Science & Engineering Research Support Center, Republic of Korea(IJDTA)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Database Theory and Application
  • 간기
    격월간
  • pISSN
    2005-4270
  • 수록기간
    2008~2016
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Database Theory and Application Vol.9 No.4

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장