Abstract
Clustering is a powerful tool for analyzing and finding useful information in text collections. However, document clustering is a difficult clustering problem because of the unstructured form and textual characteristics of documents. As a consequence, the quality of document clustering depends not only on clustering algorithms but also on document representation models. In this work we introduce a tolerance rough set model (TRSM) for representing documents as an alternative way of considering semantics relatedness between documents. Using TRSM we develop two hierarchical and nonhierarchical clustering algorithms for documents and apply these clustering methods to information retrieval. The TRSM clustering methods and the TRSM cluster-based information retrieval method are carefully evaluated and validated by comparative experiments on test collections.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baeza-Yates, R. and Ribeiro-Neto, B. (1999). Modern Information Retrieval, Addison Wesley, 1999.
Fakes, W. B. and Baeza-Yates (eds.), (1992). Information Retrieval. Data Structures and Algorithms,Prentice Hall.
Ho, T. B. and Funakoshi K. (1998). Information retrieval using rough sets’ Journal of Japanese Society for Artificial Intelligence, Vol. 13, N. 3, 424–433.
Kawasaki, S, Nguyen, N.B. and Ho, T.B. (2000). Hierarchical Document Clustering Based on Tolerance Rough Set Mode, 4th European Conference on Principles and Practice of Knowledge Discovery in Databases, September 2000. Lecture Notes in Artificial Intelligence, Springer, xx-xx.
Landau, D., Feldman, R., Aumann, Y., Fresko, M., Lindell, Y., Lipshtat, O., and Zamir, O. (1996). TextVis: An integrated visual environment for text mining, Principles of Data Mining and Knowledge Discovery, Springer, 56–64.
Larsen, B. and Aone, C. (1999). Fast and effective text mining using linear-time document clustering, Proc. Knowledge Discovery and Data Mining KDD’99, 16–22.
Lebart, L., Salem, A., and Berry, L. (1998). Exploring Textual Data,Kluwer Academic Publishers.
Lin, T. Y. and Cercone, N. (eds.), (1997), Rough Sets and Data Mining. Analysis of Imprecise Data,Kluwer Academic Publishers.
Manning, C. D. and Schutze, H. (1999). Foundations of Statistical Natural Language Processing,The MIT Press.
Pawlak, Z. (1991). Rough sets: Theoretical Aspects of Reasoning about Data,Kluwer Academic Publishers.
Polkowski, L. and Skowron, A. (eds.), (1998). Rough Sets in Knowledge Discovery 2. Applications, Case Studies and Software Systems,Physica-Verlag.
Skowron, A. and Stepaniuk, J. (1994). Generalized approximation spaces, The 3rd International Workshop on Rough Sets and Soft Computing, 156–163.
Willet, P. (1988). Recent trends in hierarchical document clustering: A critical review, Information Processing and Management, 577–597.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ho, T.B., Kawasaki, S., Nguyen, N.B. (2003). Documents Clustering Using Tolerance Rough Set Model and Its Application to Information Retrieval. In: Szczepaniak, P.S., Segovia, J., Kacprzyk, J., Zadeh, L.A. (eds) Intelligent Exploration of the Web. Studies in Fuzziness and Soft Computing, vol 111. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1772-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1772-0_12
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-2519-0
Online ISBN: 978-3-7908-1772-0
eBook Packages: Springer Book Archive