Skip to main content

Feature Selection, Rule Extraction, and Score Model: Making ATC Competitive with SVM

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4062))

Included in the following conference series:

  • 1005 Accesses

Abstract

Many studies have shown that association-based classification can achieve higher accuracy than traditional rule based schemes. However, when applied to text classification domain, the high dimensionality, the diversity of text data sets and the class skew make classification tasks more complicated. In this study, we present a new method for associative text categorization tasks. First,we integrate the feature selection into rule pruning process rather than a separate preprocess procedure. Second, we combine several techniques to efficiently extract rules. Third, a new score model is used to handle the problem caused by imbalanced class distribution. A series of experiments on various real text corpora indicate that by applying our approaches, associative text classification (ATC) can achieve as competitive classification performance as well-known support vector machines (SVM) do.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Liu, B., Hsu, W., Ma, Y.: Integrating Classification and Association Rule Mining. In: SIGKDD (1998)

    Google Scholar 

  2. Li, W., Han, J., Pei, J.: CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules. In: ICDM (2001)

    Google Scholar 

  3. Quinlan, R.: C4.5: programs for machine learning. Morgan Kaufmann Publishers Inc., San Francisco (1993)

    Google Scholar 

  4. Antonie, M., Zaiane, O.R.: Text Document Categorization by Term Association. In: ICDM (2002)

    Google Scholar 

  5. Feng, J., Liu, H., Zou, J.: SAT-MOD: Moderate Itemset Fittest for Text Classification. In: WWW (2005)

    Google Scholar 

  6. Wang, J., Karypis, G.: HARMONY: Efficiently Mining the Best Rules for Classification. In: SDM (2005)

    Google Scholar 

  7. Joachims, T.: A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization. In: ICML (1997)

    Google Scholar 

  8. Yang, Y., Pederson, J.O.: A Comparative Study on Feature Selection in Text Categorization. In: ICML (1997)

    Google Scholar 

  9. Dumais, S.T., Platt, J., Heckerman, D., Sahami, M.: Inductive learning algorithms and Representations for Text Categorization. In: CIKM (1998)

    Google Scholar 

  10. Zaki, M.J., Aggarwal, C.C.: XRules: An Effective Structural Classifier for XML Data. In: SIGKDD (2003)

    Google Scholar 

  11. Liu, B., Hsu, W., Ma, Y.: Pruning and Summarizing the Discovered Associations. In: SIGKDD (1999)

    Google Scholar 

  12. Barbara, D., Domeniconi, C., Kang, N.: Classifying Documents Without Labels. In: SDM (2004)

    Google Scholar 

  13. McCallum, A., Nigam, K.: A Comparison of Event Models for Naïve Bayes Text Classification. In: AAAI/ICML 1998 Workshop on Learning for Text Categorization (1998)

    Google Scholar 

  14. Forman, G.: An Extensive Empirical Study of Feature Selection Metrics for Text Classification. JMLR 3, 1289–1305 (2003)

    Article  MATH  Google Scholar 

  15. Chang, C.-C., Lin, C.-J.: LIBSVM at http://www.csie.ntu.edu.tw/~cjlin/libsvm/

  16. Reutres at http://www.daviddlewis.com/resources/testcollections/reuters21578/

  17. WebKB at http://www.cs.cmu.edu/afs/cs.cmu.edu/project/theo-11/www/wwkb/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Qian, T., Wang, Y., Xiang, L., Gong, W. (2006). Feature Selection, Rule Extraction, and Score Model: Making ATC Competitive with SVM. In: Wang, GY., Peters, J.F., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2006. Lecture Notes in Computer Science(), vol 4062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795131_69

Download citation

  • DOI: https://doi.org/10.1007/11795131_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36297-5

  • Online ISBN: 978-3-540-36299-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics