Text mining: Predictive methods for analyzing unstructured information

Text Mining: Predictive Methods for Analyzing Unstructured Information

Volumn , Issue , 2005, Pages 1-237

  Weiss, Sholom M ^a   Indurkhya, Nitin ^b   Zhang, Tong ^a   Damerau, Fred J ^a  

^a IBM RESEARCH   (United States)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84891388102     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-0-387-34555-0     Document Type: Book

References (124)

1. C. Apté, F. Damerau, and S. Weiss. Automated learning of decision rules for text categorization. ACM Transactions on Information Systems, 12(3):233-251, 1994.
2. A. Banerjee and J. Langford. An objective evaluation criterion for clustering. In Proceedings of KDD-2004, ACM Press, New York, NY, 2004.
3. R. Bekkerman, R. El-Yaniv, N. Tishby, and Y. Winter. Distributional word clusters vs. words for text categorization. Journal of Machine Learning Research, 3:1183-1208, 2003.
4. D. Bikel, S. Miller, R. Schwartz, and R. Weischedel. Nymble: A high-performance learning name finder. In The Fifth Conference on Applied Natural Language Processing, pages 194-201, ACM Press, New York, NY, 1997.
5. D. Bikel, R. Schwartz, and R. Weischedel. An algorithm that learns what's in a name. Machine Learning, 34(1-3):211-231, 1999.
6. A. Blum and T. Mitchell. Combining labeled and unlabeled data with co-training. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, pages 92-100, ACM Press, New York, NY, 1998.
7. A. Borthwick. A Maximum Entropy Approach to Named Entity Recognition. Ph. D. thesis, New York University, 1999.
8. L. Breiman. Prediction games and arcing algorithms. Neural Computation, 11:1493-1517, 1999.
9. E. Brill. Transformation-based error-driven learning and natural language processing: A case study in part-ofspeech tagging. Computational Linguistics, 21(4):543-565, 1995. http://www.cis.upenn. edu/~adwait/penntools.html.
10. M. Califf and R. Mooney. Relational learning of pattern-match rules for information extraction. In Working Notes of AAAI Spring Symposium on Applying Machine Learning to Discourse Processing, pages 6-11, AAAI Press, Menlo Park, CA, 1998.
11. C. Cardie and K. Wagstaff. Noun phrase coreference as clustering. In Proceedings of the Joint SIGDAT Conference on Empirical Methods in NLP and Very Large Corpora, pages 82-89, ACL, East Stroudsburg, PA, 1999.
12. E. Charniak. Statistical techniques for natural language parsing. AI Magazine, 18(4):33-43, 1997.
13. D. Chiang. Statistical parsing with an automaticallyextracted tree adjoining grammar. In Proceedings of the ACL 2000, pages 456-463, ACL, East Stroudsburg, PA, 2000.
14. W. Cohen. Learning rules that classify email. In Proceedings of the AAAI Spring Symposium on Machine Learning in Information Access, AAAI Press, Menlo Park, CA, 1996.
15. M. Collins. Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proceedings of EMNLP'02, ACL, East Stroudsburg, PA, 2002.
16. M. Craven and S. Slattery. Relational learning with statistical predicate invention: Better models for hypertext. Machine Learning, 43:97-119, 2001.
17. D. Cutting, D. Karger, J. Pedersen, and J. Tukey. Scatter/Gather: A cluster-based approach to browsing large document collections. In Proceedings of SIGIR-92, pages 1-12, ACM Press, New York, NY, 1992.
18. F. Damerau, T. Zhang, S. Weiss, and N. Indurkhya. Text categorization for a comprehensive time-dependent benchmark. Information Processing and Management, 40(2):209-221, 2004.
19. F. Damerau. Problems and some solutions in customization of natural language database front ends. ACM Transactions on Information Systems, 3(2):165-184, 1985.
20. J. Darroch and D. Ratcliff. Generalized iterative scaling for log-linear models. The Annals of Mathematical Statistics, 43:1470-1480, 1972.
21. A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society Series B, 39(1):1-38, 1977. With discussion.
22. I. Dhillon and D. Modha. Concept decompositions for large sparse text data using clustering. Machine Learning, 42(1):143-175, 2001.
23. S. Dumais and H. Chen. Hierarchical classification of web content. In Proceedings of the 23rd ACM International Conference on Research and Development in Information Retrieval, pages 256-263, ACM Press, New York, NY, 2000.
24. J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102, 1970.
25. C. Eastman and S. Weiss. A tree algorithm for nearest neighbor searching in document retrieval systems. In Proceedings of the ACM-SIGIR International Conference on Information Storage and Retrieval, pages 131-149, ACM Press, New York, NY, 1978.
26. C. Elkan. Using the triangle inequality to accelerate k-Means. In Proceedings of the Twentieth International Conference on Machine Learning, pages 147-153, AAAI Press, Menlo Park, CA, 2003.
27. C. Feldbaum, editor. Wordnet: An Electronic Lexical Database, MIT Press, Cambridge, MA, 1998.
28. R. Florian, A. Ittycheriah, H. Jing, and T. Zhang. Named entity recognition through classifier combination. In Proceedings of CoNLL-2003, pages 168-171, ACL, East Stroudsburg, PA, 2003.
29. G. Forman. An extensive empirical study of feature selection metrics for text classification. Journal of Machine Learning Research, 3:1289-1305, 2003.
30. D. Freitag. Information extraction from HTML: Application of a general machine learning approach. In Proceedings of the 15th National Conference on Artificial Intelligence, pages 517-523, AAAI Press, Menlo Park, CA, 1998.
31. Y. Freund and R. Schapire. A decisiontheoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
32. J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: A statistical view of boosting. The Annals of Statistics, 28(2):337-407, 2000. With discussion.
33. E. Garfield. Citation analysis as a tool in journal evaluation. Science, 178:471-479, 1972.
34. P. Graham. Better bayesian filtering. In Proceedings of the 2003 Spam Conference, 2003. http://spamconference.org/proceedings2003.html.
35. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Springer Series in Statistics, Springer-Verlag, New York, NY, 2001.
36. P. Hayes and S. Weinstein. Construe/tis: A system for content-based indexing of a database of news stories. In Proceedings of the 2nd Conference on Innovative Applications of Artificial Intelligence, pages 49-66, AAAI Press, Menlo Park, CA, 1990.
37. S. Huffman. Learning information extraction patterns from examples. In IJCAI Workshop on New Approaches to Learning for Natural Language Processing, pages 246-260, IJCAI, San Francisco, CA, 1995.
38. N. Ide and J. Véronis. Word sense disambiguation: The state of the art. Computational Linguistics, 24(1):1-40, 1998.
39. V. Iyengar, C. Apté, and T. Zhang. Active learning using adaptive resampling. In The Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 91-98, ACM Press, New York, NY, 2000.
40. N. Jardine and C. van Rijsbergen. The use of hierarchical clustering in information retrieval. Information Storage and Retrieval, 7:217-240, 1971.
41. E. Jaynes. Information theory and statistical mechanics. Physical Review, 106:620-630, 1957.
42. T. Joachims. Text categorization with support vector machines: Learning with many relevant features. In Proceedings of the 10th European Conference on Machine Learning, Springer-Verlag, New York, NY, 1998.
43. D. Jurafsky and J. Martin. An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition, Prentice-Hall, Englewood Cliffs, NJ, 2000.
44. M. Kearns, Y. Mansour, and A-Y. Ng. An information-thoretic analysis of hard and soft assignment methods for clustering. In Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, pages 282-293, Morgan Kaufmann, San Francisco, CA, 1997.
45. J. Kim and D. Moldovan. Acquisition of linguistic patterns for knowledge-based information extraction. IEEE Transactions on Knowledge and Data Engineering, 7(5):713-724, 1995.
46. J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
47. A. Kolcz and J. Alspector. SVM-based filtering of e-mail spam with content-specific misclassification costs. In Proceedings of Workshop on Text Mining, IEEE ICDM-2001, IEEE Press, Piscataway, NJ, 2001.
48. G. Krupka and K. Hausman. IsoQuest Inc.: Description of the NetOwl TM extractor system as used for MUC-7. In Proceedings of the Seventh Message Understanding Conference (MUC-7), NIST, Washington, DC, 1998.
49. T. Kudoh and Y. Matsumoto. Use of support vector learning for chunk identification. In Proceedings of CoNLL-2000 and LLL-2000, pages 142-144, ACL, East Stroudsburg, PA, 2000.
50. J. Lafferty, A. McCallum, and F. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of ICML-01, pages 282-289, Morgan Kaufmann, San Francisco, CA, 2001.
51. S. Lappin and H. Leass. An algorithm for pronominal anaphora resolution. Computational Linguistics, 20(4):535-561, 1994.
52. D. Lewis and J. Catlett. Heterogeneous uncertainty sampling for supervised learning. In Proceedings of the Eleventh International Conference on Machine Learning, pages 148-156, Morgan Kaufmann, San Francisco, CA, 1994.
53. D. Lewis, Y. Yang, T. Rose, and F. Li. RCV1: A new benchmark collection for text categorization research. Journal of Machine Learning Research, 5:361-397, 2004.
54. D. Lewis. Feature selection and feature extraction for text categorization. In Proceedings of the Speech and Natural Language Workshop, pages 212-217, Morgan Kaufmann, San Francisco, CA, 1992.
55. F. Li and Y. Yang. A loss function analysis for classification methods in text categorization. In Proceedings of the Twentieth International Conference on Machine Learning, pages 472-479, AAAI Press, Menlo Park, CA, 2003.
56. R. Liere and P. Tadepalli. Active learning with committees for text categorization. In Proceedings of the 14th National Conference on Artificial Intelligence, pages 591-596, AAAI Press, Menlo Park, CA, 1997.
57. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
58. H. Luhn. The automatic creation of literature abstracts. IBM Journal of Research and Development, 2(2):159-165, 1958.
59. H. Luhn. Auto-encoding of documents for information retrieval systems. In M. Boaz, editor, Modern Trends in Documentation, pages 45-58, Pergamon Press, London, 1959.
60. J. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pages 281-297, University of California Press, Berkeley, CA, 1967.
61. M. Maloof. Incremental rule learning with partial instance memory for changing concepts. In Proceedings of the International Joint Conference on Neural Networks (IJCNN '03), pages 2764-2769, IEEE Press, Piscataway, NJ, 2003.
62. C. Manning and H. Schütze. Foundations of Statistical Natural Language Processing, MIT Press, Cambridge, MA, 1999.
63. M. Maron and J. Kuhns. On relevance, probabilistic indexing and information retrieval. Journal of the ACM, 7:216-244, 1960.
64. B. Masand, G. Linoff, and D. Waltz. Classifying news stories using memory based reasoning. In Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 59-65, ACM Press, New York, NY, 1992.
65. A. McCallum and K. Nigam. A comparison of event models for naive Bayes text classification. In AAAI/ICML-98 Workshop on Learning for Text Categorization, pages 41-48, AAAI Press, Menlo Park, CA, 1998.
66. J. McCarthy and W. Lehnert. Using decision trees for coreference resolution. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 1050-1055, Morgan Kaufmann, San Francisco, CA, 1995.
67. M. McCord. Slot grammar: A system for simple construction of practical natural language grammars. In Proceedings of the International Symposium on Natural Language and Logic, pages 118-145, Springer-Verlag, New York, NY, 1989.
68. K. McKeown, R. Barzilay, D. Evans, V. Hatzivassiloglou, J. Klavans, A. Nenkova, C. Sable, B. Schiffman, and S. Sigelman. Tracking and summarizing news on a daily basis with Columbia's newsblaster. In Proceedings of the Human Languages Technology Conference, ACL, East Stroudsburg, PA, 2002.
69. A. Mikheev, C. Grover, and M. Moens. Description of the LTG system used for MUC-7. In Proceedings of the Seventh Message Understanding Conference (MUC-7), NIST, Washington, DC, 1998.
70. S. Miller, M. Crystal, H. Fox, L. Ramshaw, R. Schwartz, R. Stone, and R. Weischedel. BBN: Description of the SIFT system as used for MUC-7. In Proceedings of the Seventh Message Understanding Conference (MUC-7), NIST, Washington, DC, 1998.
71. K. Nigam, A. McCallum, S. Thrun, and T. Mitchell. Text classification from labeled and unlabeled documents using EM. Machine Learning, 39(2/3):1-32, 2000.
72. K. Nigam. Using Unlabeled Data to Improve Text Classification. Ph. D. thesis, Carnegie Mellon University, 2001.
73. L. Page and S. Brin. The anatomy of a search engine. In Proceedings of the 7th International WWW Conference (WWW 98), http://www7.scu.edu.au, Brisbane, Australia, 1998.
74. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Stanford Digital Libraries Technologies Project, 1998.
75. S. Pietra, V. Pietra, and J. Lafferty. Inducing features of random fields. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(4):380-393, 1997.
76. M. Porter. An algorithm for suffix stripping. Program, 14(3):130-137, 1980.
77. D. Radev and S. Tenfel, editors. Proceedings of the HLT NAACL 2003 Workshop on Text Summarization, ACL, East Stroudsburg, PA, 2003.
78. D. Radev, M. Topper, and A. Winkel. Multidocument centroid-based text summarization. In Proceedings of ACL-02 Demo Session, pages 112-113, ACL, East Stroudsburg, PA, 2002.
79. L. Ramshaw and M. Marcus. Text chunking using transformation-based learning. In Proceedings of the Third Workshop on Very Large Corpora, pages 82-94, ACL, East Stroudsburg, PA, 1995.
80. A. Ratnaparkhi. A maximum entropy part-ofspeech tagger. Computational Linguistics, 21(4):543-565, 1995. http://www.cis.upenn. edu/~adwait/penntools. html.
81. A. Ratnaparkhi. Learning to parse natural language with maximum entropy models. Machine Learning, 34:151-178, 1999.
82. E. Ray. Learning XML, O'Reilly & Associates, Sebastopol, CA, 2001.
83. E. Riloff. Automatically constructing a dictionary for information extraction tasks. In Proceedings of the 11th National Conference on Artificial Intelligence, pages 811-816, AAAI Press, Menlo Park, CA, 1993.
84. S. Robertson, S. Walker, S. Jones, M. Hancock-Beaulieu, and M. Gatford. Okapi at TREC-3. In Proceedings of the Third Text Retrieval Conference, pages 109-126, NIST, Washington, DC, 1994. http://trec.nist.gov/pubs/trec3/papers/ city.ps.gz.
85. F. Rosenblatt. Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanisms, Spartan, New York, 1962.
86. D. Roth and W. Yih. Relational learning via propositional algorithms: An information extraction case study. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, pages 1257-1263, Morgan Kaufmann, San Francisco, CA, 2001.
87. G. Salton and M. Lesk. The SMART automatic document retrieval system - An illustration. Communications of the ACM, 8(6):391-398, 1965.
88. G. Salton and M. Lesk. Computer evaluation of indexing and text processing. Journal of the Association for Computing Machinery, 15(1):8-36, 1968.
89. G. Salton and H. Wu. A term weighting model based on utility theory. In Proceedings of SIGIR, pages 9-22, ACM Press, New York, NY, 1980.
90. G. Salton, A. Wong, and C. Yang. A vector space model for automatic indexing. Communications of the ACM, 18:613-620, 1975.
91. G. Salton. A document retrieval system for manmachine interaction. In Proceedings of the 19th Annual International ACM National Conference, pages L2.3.1-L2.3.20, ACM Press, New York, NY, 1964.
92. G. Salton. The SMART Retrieval System, Prentice-Hall, Englewood Cliffs, NJ, 1971.
93. E. Sang and S. Buchholz. Introduction to the CoNLL-2000 shared task: Chunking. In Proceedings of the CoNLL-2000 and LLL-2000, pages 127-132, ACL, East Stroudsburg, PA, 2000.
94. E. Sang and F. De Meulder. Introduction to the CoNLL-2003 shared task: Language independent named entity recognition. In W. Daelemans and M. Osborne, editors, Proceedings of CoNLL-2003, pages 142-147, ACL, East Stroudsburg, PA, 2003.
95. R. Schapire and Y. Singer. Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37:297-336, 1999.
96. R. Schapire and Y. Singer. BoosTexter: A boosting-based system for text categorization. Machine Learning, 39(2/3):135-168, 2000.
97. S. Seshasai. Winston, Katz sue Ask Jeeves: AI lab researchers attempt to enforce natural language patent. The Tech (MIT), 2000. http://www-tech.mit.edu/ V119/N66/.
98. S. Soderland, D. Fisher, J. Aseltine, and W. Lehnert. CRYSTAL: Inducing a conceptual dictionary. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 1314-1319, Morgan Kaufmann, San Francisco, CA, 1995.
99. S. Soderland. Learning information extraction rules for semi-structured and free text. Machine Learning, 34(1-3):233-272, 1999.
100. W-M. Soon, H-T. Ng, and C-Y. Lim. A machine learning approach to coreference resolution of noun phrases. Computational Linguistics, 27(4):521-544, 2001.
101. G. Stein, A. Bagga, and G. Wise. Multi-document summarization: Methodologies and evaluations. In Proceedings of the 7th Conference on Automatic Natural Language Processing (TALN'00), pages 337-346, ATALA Press, Paris, France, 2000.
102. P. Tan, H. Blau, S. Harp, and R. Goldman. Textual data mining of service center call records. In Proceedings of KDD-2000, pages 417-423, ACM Press, New York, NY, 2000.
103. C-M. Tan, Y-F. Wang, and C-D. Lee. The use of bigrams to enhance text categorization. Information Processing and Management, 38(4):529-546, 2002.
104. M. Tomita. Efficient Parsing for Natural Language, Kluwer Academic Publishers, Dordrecht, 1985.
105. V. Vapnik. Statistical Learning Theory, John Wiley & Sons, New York, 1998.
106. E. Voorhees and L. Buckland, editors. NIST Special Publication 500-251: The Eleventh Text Retrieval Conference (TREC 2002), Gaithersburg, Maryland, November 19-22, 2002, NIST Press, Washington, DC, 2002. Co-sponsored by DARPA and ARDA.
107. E. Voorhees. The cluster hypothesis revisited. In Proceedings of SIGIR-85, pages 188-196, ACM Press, New York, NY, 1985.
108. D. Walker, D. Clements, M. Darwin, and J. Amtrup. Sentence boundary detection: A comparison of paradigms for improving MT quality. In Proceedings of the Eighth Machine Translation Summit, ACL, East Stroudsburg, PA, 2001.
109. S. Weiss and N. Verma. A system for real-time competitive market intelligence. In Proceedings of SIGKDD-2002, ACM Press, New York, NY, 2002.
110. S. Weiss, C. Apté, F. Damerau, et al. Maximizing text-mining performance. IEEE Intelligent Systems, 14(4):63-69, 1999.
111. S. Weiss, B. White, and C. Apté. Lightweight document clustering. In Proceedings of PKDD-2000, pages 665-672, Springer-Verlag, New York, NY, 2000.
112. S. Weiss, B. White, C. Apté, and F. Damerau. Lightweight document matching for help-desk applications. IEEE Intelligent Systems, 15(2):57-61, 2000.
113. P. Willett. Recent trends in hierarchic document clustering. Information Processing and Management, 24:577-597, 1988.
114. J. Xu and B. Croft. Corpus-based stemming using cooccurrence of word variants. ACM Topics on Information Systems, 16(1):61-81, 1998.
115. Y. Yang and J. Pedersen. A comparative study of feature selection in text categorization. In Proceedings of the Fourteenth International Conference on Machine Learning, pages 412-420, Morgan Kaufmann, San Francisco, CA, 1997.
116. D. Zelenko, C. Aone, and A. Richardella. Kernel methods for relation extraction. Journal of Machine Learning Research, 3:1083-1106, 2003.
117. T. Zhang and D. Johnson. A robust risk minimization based named entity recognition system. In Proceedings of CoNLL-2003, pages 204-207, ACL, East Stroudsburg, PA, 2003.
118. T. Zhang and F. Oles. A probability analysis on the value of unlabeled data for classification problems. In Proceedings of ICML-00, pages 1191-1198, Morgan Kaufmann, San Francisco, CA, 2000.
119. T. Zhang and F. Oles. Text categorization based on regularized linear classification methods. Information Retrieval, 4:5-31, 2001.
120. T. Zhang, F. Damerau, and D. Johnson. Text chunking based on a generalization of Winnow. Journal of Machine Learning Research, 2(5):615-637, 2002.
121. T. Zhang, F. Damerau, and D. Johnson. Updating an NLP system to fit new domains: An empirical study on the sentence segmentation problem. In Proceedings of the Seventh Conference on Natural Language Learning, CoNLL-2003, pages 56-62, ACL, East Stroudsburg, PA, 2003.
122. T. Zhang. On the dual formulation of regularized linear systems. Machine Learning, 46:91-129, 2002.
123. T. Zhang. Statistical behavior and consistency of classification methods based on convex risk minimization. The Annals of Statistics, 32(1):56-134, 2004. With discussion.
124. S. Zhong and J. Ghosh. A unified framework for model-based clustering. Journal of Machine Learning Research, 4:1001-1037, 2003.