Skip to main content
SpringerLink
Log in

Relation Discovery from Thai News Articles Using Association Rule Mining

  • Conference paper
Intelligence and Security Informatics (PAISI 2009)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5477))

Included in the following conference series:

Abstract

Association among news articles is useful information for us to track situation related to events, persons, organizations and other concerned issues as well as to detect inconsistency among news. In this paper, we propose an association-based approach towards mining relations in Thai news articles by exploiting coincident terms. This approach first transforms news documents into term-document representation, applies term weighting techniques and generates association by means of statistics. In the work, either unigram or bigram is used for term representation, term frequency, boolean frequency and their modification with inverse document frequency are alternatively applied for term weighting, and confidence or conviction is in turn selected for association measure. Due to this combination, sixteen possible methods are investigated using approximately 811 Thai news of three categories, i.e., politics, economics, and crime. The ranked relations obtained by each method are compared with evaluation done by human. As the result, the method using bigram, term frequency, and conviction achieves the best performance with a rank-order mismatch of 0.84% on the top-50 mined relations. For the top-300 mined relations, the method with bigram, term frequency with inverse document frequency and conviction performs the best with 6.98% rank-order mismatch.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Fukumoto, F., Suzuki, Y.: Topic tracking based on bilingual comparable corpora and semisupervised clustering. ACM TALIP 6(3) (2007)

    Google Scholar 

  2. Kumaran, G., Allan, J.: Using names and topics for new event detection. In: Proc. of HLT-EMNLP, pp. 121–128 (2005)

    Google Scholar 

  3. Kuo, J., Chen, H.: Multidocument summary generation: Using informative and event words. ACM TALIP 7(1), 1–23 (2008)

    Article  MathSciNet  Google Scholar 

  4. Montalvo, S., Martnez, R., Casillas, A., Fresno, V.: Multilingual news clustering: Feature translation vs. identification of cognate named entities. Pattern Recognition Letters 28(16), 2305–2311 (2007)

    Article  Google Scholar 

  5. Kalczynski, P.J., Chou, A.: Temporal document retrieval model for business news archives. IPM 41(3), 635–650 (2005)

    Google Scholar 

  6. Mengle, S., Goharian, N., Platt, A.: Discovering relationships among categories using misclassification information. In: Proc. of ACM SAC, pp. 932–937 (2008)

    Google Scholar 

  7. Lin, F., Liang, C.: Storyline-based summarization for news topic retrospection. Decision Support Systems 45(3), 473–490 (2008)

    Article  Google Scholar 

  8. Jaruskulchai, C., Kruengkrai, C.: A practical text summarizer by paragraph extraction for thai. In: Proc. of IRAL, pp. 9–16 (2003)

    Google Scholar 

  9. Sriphaew, K., Theeramunkong, T.: Quality evaluation for document relation discovery using citation information. IEICE Trans. Inf. Syst. E90-D(8), 1225–1234 (2007)

    Article  Google Scholar 

  10. Larose, D.T.: Discovering Knowledge in Data: an Introduction to Data Mining. John Wiley and Sons, Inc., Hoboken (2005)

    MATH  Google Scholar 

  11. Brin, S., Motwani, R., Ullman, J., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: Proc. of ACM SIGMOD, pp. 255–264 (1997)

    Google Scholar 

  12. Jorge, A., Azevedo, P.: An experiment with association rules and classification: Post-bagging and conviction. In: Hoffmann, A., Motoda, H., Scheffer, T. (eds.) DS 2005. LNCS, vol. 3735, pp. 137–149. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. David, H.: The Method of Paired Comparisons. Oxford University Press, Oxford (1988)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sirindhorn International Institute of Technology, Thammasat University, Thailand

    Nichnan Kittiphattanabawon & Thanaruk Theeramunkong

Authors
  1. Nichnan Kittiphattanabawon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thanaruk Theeramunkong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The University of Arizona, Tucson, AZ, USA

    Hsinchun Chen

  2. Drexel University, Philadelphia, PA, USA

    Christopher C. Yang

  3. The University of Hong Kong, Hong Kong, China

    Michael Chau

  4. National Taiwan University, Taipei, Taiwan, R.O.C.

    Shu-Hsing Li

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kittiphattanabawon, N., Theeramunkong, T. (2009). Relation Discovery from Thai News Articles Using Association Rule Mining. In: Chen, H., Yang, C.C., Chau, M., Li, SH. (eds) Intelligence and Security Informatics. PAISI 2009. Lecture Notes in Computer Science, vol 5477. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01393-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01393-5_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01392-8

  • Online ISBN: 978-3-642-01393-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation