Abstract
We describe Athena: a system for creating, exploiting, and maintaining a hierarchy of textual documents through interactive miningbased operations. Requirements of any such system include speed and minimal end-user effort. Athena satisfies these requirements through linear-time classification and clustering engines which are applied interactively to speed the development of accurate models.
Naive Bayes classifiers are recognized to be among the best for classifying text. We show that our specialization of the Naive Bayes classifier is considerably more accurate (7 to 29% absolute increase in accuracy) than a standard implementation. Our enhancements include using Lidstone’s law of succession instead of Laplace’s law, under-weighting long documents, and over-weighting author and subject.
We also present a new interactive clustering algorithm, C-Evolve, for topic discovery. C-Evolve first finds highly accurate cluster digests (partial clusters), gets user feedback to merge and correct these digests, and then uses the classification algorithm to complete the partitioning of the data. By allowing this interactivity in the clustering process, C-Evolve achieves considerably higher clustering accuracy (10 to 20% absolute increase in our experiments) than the popular K-Means and agglomerative clustering methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal, R. Bayardo, and R. Srikant. Athena: Mining-based interactive management of text databases. Research Report RJ 10153, IBM Almaden Research Center, San Jose, CA 95120, July 1999. Available from http://www.almaden.ibm.com/cs/quest.
C. Apte, F. Damerau, and S.M. Weiss. Automated Learning of Decision Rules for Text Categorization. ACM Transactions on Information Systems, 1994.
S. Chakrabarti, B. Dom, R. Agrawal, and P. Raghavan. Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases. In Proc. of the 23rd Int’l Conf. on Very Large Databases, pages 446–455, 1997.
W.W. Cohen. Learning Rules that Classify E-Mail. In Proc. of the 1996 AAAI Spring Symposium on Machine Learning in Information Access, 1996.
D.R. Cutting, K.R. David, J.O. Pedersen, and J.W. Tukey. Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections. In Proc. of the 15th Intl ACM SIGIR Conf. on Research and Development in Information Retrieval, 1992.
I.J. Good. The Estimation of Probabilities: An Essay on Modern Bayesian Methods. M.I.T. Press, 1965.
G. Hardy. Correspondence. Insurance Record, 1889.
R. Kohavi. Scaling Up the Accuracy of Naive-Bayes Classifiers: a Decision-Tree Hybrid. In Proc. of the Second Int’l Conf. on Knowledge Discovery and Data Mining, 1996.
R. Kohavi, B. Becker, and D. Sommerfield. Improving simple bayes. In The 9th European Conference on Machine Learning, Poster Papers, 1997.
P. Kontkanen, P. Myllymaki, T. Silander, and H. Tirri. BAYDA: Software for Bayesian Classification and Feature Selection. In Proc. of the Fourth Int’l Conf. on Knowledge Discovery and Data Mining, 1998.
K. Lang. News Weeder: Learning to Filter Net-News. In Proc. of the 12th Int’l Conf. on Machine Learning, pages 331–339, 1995.
D.D. Lewis and M. Ringuette. A comparison of two learning algorithms for text categorization. In In Third Annual Symposium on Document Analysis and Information Retrieval, pages 81–92, 1994.
G. Lidstone. Note on the general case of the Bayes-Laplace formula for inductive or a posteriori probabilities. Trans. Fac. Actuaries, 8:182–192, 1920.
Lotus Notes. http://www.notes.net.
P. Maes. Agents that Reduce Work and Information Overload. Communications of the ACM, 37(7):31–40, 1994.
Andrew McCallum and Kamal Nigam. A Comparison of Event Models for Naive Bayes Text Classification. In AAAI-98 Workshop on “Learning for Text Categorization”, 1998.
Andrew McCallum, Ronald Rosenfeld, Tom Mitchell, and Andrew Ng. Improving Text Classification by Shrinkage in a Hierarchy of Classes. In Intl. Conf. on Machine Learning, 1998.
Tom M. Mitchell. Machine Learning, chapter 6. McGraw-Hill, 1997.
T.R. Payne and P. Edwards. Interface Agents that Learn: An Investigation of Learning Issues in a Mail Agent Interface. Applied Artificial Intelligence, 11:1–32, 1997.
M. Pazzani and D. Billsus. Learning and Revising User Profiles: The identification of interesting web sites. Machine Learning, 27:313–331, 1997.
E. Rasmussen. Information Retrieval: Data Structures and Algorithms, chapter Clustering algorithms, pages 419–442. Prentice Hall, Englewood Cliffs, NJ, 1991.
E.S. Ristad. A Natural Law of Succession. Technical report, Princeton University, 1995. Research Report CS-TR-495-95.
M. Sahami, S. Dumais, D. Heckerman, and E. Horvitz. A Bayesian Approach to Filtering Junk E-mail. In Proc. of the AAAI’98 Workshop on Learning for Text Categorization, Madison, Wisconsin, 1998.
M. Sahami, S. Yusufali, and M.Q.W. Baldonado. Sonia: A service for organizing networked information autonomously. In Proc. of the Third ACM Conference on Digital Libraries, pages 200–209, 1998.
R. Segal and J. Kephart. MailCat: An Intelligent Assistant for Organizing E-Mail. In Proc. of the Third Int’l Conf. on Autonomous Agents, 1999.
John Shafer, Rakesh Agrawal, and Manish Mehta. SPRINT: A Scalable Parallel Classifier for Data Mining. In Proc. of the 22nd Int’l Conference on Very Large Databases, Bombay, India, September 1996.
Yahoo! http://www.yahoo.com.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agrawal, R., Bayardo, R., Srikant, R. (2000). Athena: Mining-Based Interactive Management of Text Databases. In: Zaniolo, C., Lockemann, P.C., Scholl, M.H., Grust, T. (eds) Advances in Database Technology — EDBT 2000. EDBT 2000. Lecture Notes in Computer Science, vol 1777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46439-5_25
Download citation
DOI: https://doi.org/10.1007/3-540-46439-5_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67227-2
Online ISBN: 978-3-540-46439-6
eBook Packages: Springer Book Archive