Using soft-matching mined rules to improve information extraction

AAAI Workshop - Technical Report

Volumn WS-04-01, Issue , 2004, Pages 27-32

  Nahm, Un Yong ^a   Mooney, Raymond J ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION EXTRACTION; SOFT-MATCHING MINES; TEXTUAL DATA;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATA MINING;

INFORMATION RETRIEVAL;

EID: 32144448362     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Agrawal, R., and Srikant, R. 1994. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases (VLDB-94), 487-499.
2. Berry, M. W., ed. 2003. Proceedings of the Third SIAM International Conference on Data Mining(SDM-2003) Workshop on Text Mining.
3. Califf, M. E., and Mooney, R. J. 1999. Relational learning of pattern-match rules for information extraction. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), 328-334.
4. Cohen, W. W.; Hurst, M.; and Jensen, L. S. 2002. A flexible learning system for wrapping tables and lists in HTML documents. In Proceedings of the Eleventh International World Wide Web Conference (WWW-2002), 232-241. Honolulu, HI: ACM.
5. Cohen, W. W. 1996. Learning to classify English text with ILP methods. In De Raedt, L., ed., Advances in Inductive Logic Programming. Amsterdam: IOS Press. 124-143.
6. Cohen, W. W. 2003. Improving a page classifier with anchor extraction and link analysis. In Becker, S.; Thrun, S.; and Obermayer, K., eds., Advances in Neural Information Processing Systems 15, 1481-1488. Cambridge, MA: MIT Press.
7. DARPA., ed. 1998. Proceedings of the Seventh Message Understanding Evaluation and Conference (MUC-98). Fairfax, VA: Morgan Kaufmann.
8. Freitag, D., and Kushmerick, N. 2000. Boosted wrapper induction. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000), 577-583. Austin, TX: AAAI Press / The MIT Press.
9. Freund, Y., and Schapire, R. E. 1996. Experiments with a new boosting algorithm. In Saitta, L., ed., Proceedings of the Thirteenth International Conference on Machine Learning (ICML-96), 148-156. Morgan Kaufmann.
10. Ghani, R., and Fano, A. E. 2002. Using text mining to infer semantic attirbutes for retail data mining. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM-2002), 195-202. Maebash City, Japan: IEEE Computer Society.
11. Ghani, R.; Jones, R.; Mladenić, D.; Nigam, K.; and Slattery, S. 2000. Data mining on symbolic knowledge extracted from the Web. In Mladenić, D., ed., Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining (KDD-2000) Workshop on Text Mining, 29-36.
12. Grobelnik, M., ed. 2003. Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence(IJCAI-2003) Workshop on Text Mining and Link Analysis (TextLink-2003).
13. Gusfield, D. 1997. Algorithms on Strings, Trees and Sequences. New York: Cambridge University Press.
14. Hearst, M. A. 2003. What is text mining? http://www.sims.berkeley.edu/ ~hearst/text-mining.html.
15. McCallum, A., and Jensen, D. 2003. A note on the unification of information extraction and data mining using conditional-probability, relational models. In Proceedings of the IJCAI-2003 Workshop on Learning Statistical Models from Relational Data.
16. McCallum, A., and Nigam, K. 1998. A comparison of event models for naive Bayes text classification. In Papers from the AAAI-98 Workshop on Text Categorization, 41-48.
17. Nahm, U. Y., and Mooney, R. J. 2000. A mutually beneficial integration of data mining and information extraction. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000), 627-632.
18. Nahm, U. Y., and Mooney, R. J. 2001. Mining soft-matching rules from textual data. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-2001), 979-984.
19. Nahm, U. Y., and Mooney, R. J. 2002. Mining soft-matching association rules. In Proceedings of the Eleventh International Conference on Information and Knowledge Management (CIKM-2002), 681-683.
20. Needleman, S. B., and Wunsch, C. D. 1970. A general method applicable to the search for similarities in the amino acid sequences of two proteins. Journal of Molecular Biology 48:443-453.
21. Pierre, J. M. 2002. Mining knowledge from text collections using automatically generated metadata. In Karagiannis, D., and Reimer, U., eds., Proceedings of the Fourth International Conference on Practical Aspects of Knowledge Management (PAKM-2002), 537-548. Vienna, Austria: Springer. Lecture Notes in Computer Sicnece Vol. 2569.
22. Quinlan, J. R. 1993. C4.5: Programs for Machine Learning. San Mateo,CA: Morgan Kaufmann.
23. Salton, G. 1989. Automatic Text Processing: The Transformation, Analysis and Retrieval of Information by Computer. Addison-Wesley.
24. Savasere, A.; Omiecinski, E.; and Navathe, S. B. 1998. Mining for strong negative associations in a large database of customer transactions. In Proceedings of the 14th International Conference on Data Engineering (ICDE-98), 494-502. Orlando, FL: IEEE Computer Society.
25. Schapire, R. E., and Singer, Y. 1998. Improved boosting algorithms using confidence-rated predictions. In Piatetsky-Shapiro, G.; Agrawal, R.; and Stolorz, P. E., eds., Proceedings of the 11th Annual Conference on Computational Learning Theory, 80-91. Madison, WI: ACM.
26. Soderland, S.; Etzioni, O.; Shaked, T.; and Weld, D. S. 2004. The use of Web-based statistics to validate information extraction. To appear in Papers from the AAAI-2004 Workshop on Adaptive Text Extraction and Mining(ATEM-2004) Workshop, San Jose, CA.
27. Wu, X.; Zhang, C.; and Zhang, S. 2002. Mining both positive and negative association rules. In Sammut, C., and Hoffmann, A. G., eds., Proceedings of the Ninteenth International Conference on Machine Learning (ICML-2002), 658-665. Sydney, Australia: Morgan Kaufmann.