Proceedings

Mining Soft-Matching Rules from Textual Data

Download BibTeX Cite

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 979-985.

© 2001 International Joint Conferences on Artificial Intelligence

Abstract

Text mining concerns the discovery of knowledge from unstructured textual data. One important task is the discovery of rules that relate specific words and phrases. Although existing methods for this task learn traditional logical rules, soft-matching methods that utilize word-frequency information generally work better for textual data. This paper presents a rule induction system, T EXT RISE, that allows for partial matching of text-valued features by combining rule-based and instance-based learning. We present initial experiments applying T EXT RISE to corpora of book descriptions and patent documents retrieved from the web and compare its results to those of traditional rule and instance based methods.

  1. [Agrawal and Srikant, 1994] Rakesh Agrawal and Ramakr- ishnan Srikant. Fast algorithms for mining association rules. In Proceedings of the 20th International Confer- ence on Very Large Databases (VLDB-94), pages 487- 499, Santiago, Chile, September 1994.
  2. [Ahonen et al., 1998] Helena Ahonen, Oskari Heinonen, Mika Klemettinen, and A. Inkeri Verkamo. Applying data mining techniques for descriptive phrase extraction in dig- ital document collections. In Proceedings of the IEEE Fo- rum on Research and Technology Advances in Digital Li- braries, pages 2-11, Santa Barbara, CA, April 1998.
  3. [Ahonen-Myka et al., 1999] Helena Ahonen-Myka, Oskari Heinonen, Mika Klemettinen, and A. Inkeri Verkamo. Finding co-occurring text phrases by combining sequence and frequent set discovery. In Ronen Feldman, editor, Proceedings of the Sixteenth International Joint Confer- ence on Artificial Intelligence (IJCAI-99) Workshop on Text Mining: Foundations, Techniques and Applications, pages 1-9, Stockholm, Sweden, August 1999.
  4. [Bayardo Jr. and Agrawal, 1999] Roberto J. Bayardo Jr. and Rakesh Agrawal. Mining the most interesting rules. In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining (KDD-99), pages 145-154, San Diego, CA, August 1999.
  5. [Borgelt, 2000] Christian Borgelt. Apriori version 2.6. http://fuzzy.cs.Uni-Magdeburg.de/˜borgelt/, 2000. Link
  6. [Cohen, 1995] William W. Cohen. Fast effective rule induc- tion. In Proceedings of the Twelfth International Con- ference on Machine Learning (ICML-95), pages 115-123, San Francisco, CA, 1995.
  7. [Cohen, 1998] William W. Cohen. Providing database-like access to the web using queries based on textual similarity. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD-98), pages 558-560, Seattle, WA, June 1998.
  8. [Domingos, 1996] Pedro Domingos. Unifying instance- based and rule-based induction. Machine Learning, 24:141-168, 1996.
  9. [Feldman and Hirsh, 1996] Ronen Feldman and Haym Hirsh. Mining associations in text in the presence of background knowledge. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), pages 343-346, Portland, OR, August 1996.
  10. [Feldman, 1999] Ronen Feldman, editor. Proceedings of the Sixteenth International Joint Conference on Artificial In- telligence (IJCAI-99) Workshop on Text Mining: Founda- tions, Techniques and Applications, Stockholm, Sweden, August 1999.
  11. [Fellbaum, 1998] Christiane D. Fellbaum. WordNet: An Electronic Lexical Database. MIT Press, Cambridge, MA, 1998.
  12. [Ghani et al., 2000] Rayid Ghani, Rosie Jones, Dunja Mladenić, Kamal Nigam, and Sean Slattery. Data min- ing on symbolic knowledge extracted from the web. In Dunja Mladenić, editor, Proceedings of the Sixth Interna- tional Conference on Knowledge Discovery and Data Min- ing (KDD-2000) Workshop on Text Mining, pages 29-36, Boston, MA, August 2000.
  13. Marti Hearst. Untangling text data mining. In Proceedings of the 37th Annual Meeting of the Associa- tion for Computational Linguistics (ACL-99), pages 3-10, College Park, MD, June 1999.
  14. [McCallum, 1996] Andrew Kachites McCallum. Bow: A toolkit for statistical language model- ing, text retrieval, classification and clustering. http://www.cs.cmu.edu/˜mccallum/bow, 1996. Link
  15. [Mladenić, 2000] Dunja Mladenić, editor. Proceedings of the Sixth International Conference on Knowledge Discov- ery and Data Mining (KDD-2000) Workshop on Text Min- ing, Boston, MA, August 2000.
  16. [Nahm and Mooney, 2000a] Un Yong Nahm and Ray- mond J. Mooney. A mutually beneficial integration of data mining and information extraction. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000), pages 627-632, Austin, TX, July 2000.
  17. [Nahm and Mooney, 2000b] Un Yong Nahm and Ray- mond J. Mooney. Using information extraction to aid the discovery of prediction rules from texts. In Proceedings of the Sixth International Conference on Knowledge Dis- covery and Data Mining (KDD-2000) Workshop on Text Mining, pages 51-58, Boston, MA, August 2000.
  18. [Peterson, 1976] James L. Peterson. Computation sequence sets. Journal of Computer and System Sciences, 13(1):1- 24, August 1976.
  19. [Quinlan, 1993] J. Ross Quinlan. C4.5: Programs for Ma- chine Learning. Morgan Kaufmann, San Mateo,CA, 1993.
  20. [Salton, 1989] Gerard Salton. Automatic Text Processing: The Transformation, Analysis and Retrieval of Informa- tion by Computer. Addison-Wesley, 1989.
  21. [Wagner and Fisher, 1974] Robert A. Wagner and Michael J. Fisher. The string to string correction problem. Journal of the Association for Computing Machinery, 21:168-173, 1974.
  22. [Yang, 1999] Yiming Yang. An evaluation of statistical ap- proaches to text categorization. Journal of Information Re- trieval, 1(1/2):67-88, May 1999.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards