Skip to main content

Semantic-Based Temporal Text-Rule Mining

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5449))

Abstract

In many contexts today, documents are available in a number of versions. In addition to explicit knowledge that can be queried/searched in documents, these documents also contain implicit knowledge that can be found by text mining. In this paper we will study association rule mining of temporal document collections, and extend previous work within the area by 1) performing mining based on semantics as well as 2) studying the impact of appropriate techniques for ranking of rules.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Banerjee, S., Pedersen, T.: Extended gloss overlaps as a measure of semantic relatedness. In: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (2003)

    Google Scholar 

  2. Basu, S., Mooney, R.J., Pasupuleti, K.V., Ghosh, J.: Evaluating the novelty of text mined rules using lexical knowledge. In: Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining (2001)

    Google Scholar 

  3. Chakrabarti, S.: Mining the Web - Discovering Knowledge from Hypertext Data. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  4. Dunham, M.: Data Mining: Introductory and Advanced Topics. Prentice-Hall, Englewood Cliffs (2003)

    Google Scholar 

  5. Feldman, R., Sanger, J.: The Text Mining Handbook. Cambridge (2007)

    Google Scholar 

  6. Holt, J.D., Chung, S.M.: Efficient mining of association rules in text databases. In: Proceedings of CIKM 1999 (1999)

    Google Scholar 

  7. Hovy, E.H., Marcus, M.P., Palmer, M., Ramshaw, L.A., Weischedel, R.M.: OntoNotes: the 90% solution. In: Proceedings of the Human Language Technology Conference of the North American Chapter of the ACL (2006)

    Google Scholar 

  8. Janetzko, D., Cherfi, H., Kennke, R., Napoli, A., Toussaint, Y.: Knowledge-based selection of association rules for text mining. In: Proceedings of ECAI 2004 (2004)

    Google Scholar 

  9. Jiang, J.J., Conrath, D.W.: Semantic Similarity Based on Corpus Statistics and Lexical Taxonomy. In: Proceedings of International Conference Research on Computational Linguistics (ROCLING X) (1997)

    Google Scholar 

  10. Lee, C.-H., Lin, C.-R., Chen, M.-S.: On mining general temporal association rules in a publication database. In: Proceedings of ICDM 2001(2001)

    Google Scholar 

  11. Lent, B., Agrawal, R., Srikant, R.: Discovering trends in text databases. In: Proceedings of KDD 1997 (1997)

    Google Scholar 

  12. Lesk, M.: Automatic sense disambiguation using machine readable dictionaries: How to tell a pine cone from an ice cream cone. In: Proceedings of the 5th Annual International Conference on Systems Documentation (SIGDOC 1986) (1986)

    Google Scholar 

  13. Lu, H., Feng, L., Han, J.: Beyond intratransaction association analysis: mining multidimensional intertransaction association rules. ACM Trans. Inf. Syst. 18(4), 423–454 (2000)

    Article  Google Scholar 

  14. Manning, C., Schütze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (1999)

    MATH  Google Scholar 

  15. Mei, Q., Zhai, C.: Discovering evolutionary theme patterns from text: an exploration of temporal text mining. In: Proceedings of KDD 2005 (2005)

    Google Scholar 

  16. Nørvåg, K., Skogstad, K.-I., Eriksen, T.: Mining association rules in temporal document collections. In: Esposito, F., Raś, Z.W., Malerba, D., Semeraro, G. (eds.) ISMIS 2006. LNCS, vol. 4203. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Roddick, J.F., Spiliopoulou, M.: Survey of temporal knowledge discovery paradigms and methods. IEEE Transactions on Knowledge and Data Engineering 14(4), 750–767 (2002)

    Article  Google Scholar 

  18. Tan, P.-N., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: Proceedings of KDD 2002 (2002)

    Google Scholar 

  19. Toutanova, K., Manning, C.: Enriching the knowledge sources used in a maximum entropy part-of-speech tagger. In: Proceedings of the Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora (2000)

    Google Scholar 

  20. Tung, A.K.H., Lu, H., Han, J., Feng, L.: Efficient mining of intertransaction association rules. IEEE Transactions on Knowledge and Data Engineering 15(1), 43–56 (2003)

    Article  Google Scholar 

  21. Zhao, Y., Zhang, C., Zhang, S.: Discovering interesting association rules by clustering. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS, vol. 3339, pp. 1055–1061. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nørvåg, K., Fivelstad, O.K. (2009). Semantic-Based Temporal Text-Rule Mining. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2009. Lecture Notes in Computer Science, vol 5449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00382-0_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00382-0_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00381-3

  • Online ISBN: 978-3-642-00382-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics