Abstract
One way to organize knowledge and make its search and retrieval easier is to create a structural representation divided by hierarchically related topics. Once this structure is built, it is necessary to find labels for each of the obtained clusters. In many cases the labels have to be built using only the terms in the documents of the collection. This paper presents the SeCLAR (Selecting Candidate Labels using Association Rules) method, which explores the use of association rules for the selection of good candidates for labels of hierarchical document clusters. The candidates are processed by a classical method to generate the labels. The idea of the proposed method is to process each parent-child relationship of the nodes as an antecedent-consequent relationship of association rules. The experimental results show that the proposed method can improve the precision and recall of labels obtained by classical methods.
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
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487–499. Morgan Kaufmann Publishers Inc., San Francisco (1994)
Bast, H., Dupret, G., Majumdar, D., Piwowarski, B.: Discovering a term taxonomy from term similarities using principal component analysis. In: Ackermann, M., Berendt, B., Grobelnik, M., Hotho, A., Mladenič, D., Semeraro, G., Spiliopoulou, M., Stumme, G., Svátek, V., van Someren, M. (eds.) EWMF 2005 and KDO 2005. LNCS (LNAI), vol. 4289, pp. 103–120. Springer, Heidelberg (2006)
Glover, E.J., Pennock, D.M., Lawrence, S., Krovetz, R.: Inferring hierarchical descriptions. In: CIKM, pp. 507–514. ACM, New York (2002)
Larsen, B., Aone, C.: Fast and effective text mining using linear-time document clustering. In: KDD 1999: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 16–22. ACM, New York (1999)
Lopes, A., Pinho, R., Paulovich, F., Minghim, R.: Visual text mining using association rules. In: ScienceDirect, pp. 316–326 (2007)
Mahgoub, H., Rösner, D., Ismail, N., Torkey, F.: A text mining technique using association rules extraction. International Journal of Computational Intelligence, 21–28 (2008)
Moura, M.F., Rezende, S.O.: A simple method for labeling hierarchical document clusters. In: Proceedings of AIA 2010 - Artificial Intelligence and Applications, Innsbruck, Austria (2010)
Popescul, A., Ungar, L.: Automatic labeling of document clusters (2000) (unpublished manuscript), http://www.cis.upenn.edu/~popescul/Publications/popescul00labeling.pdf
Porter, M.F.: An algorithm for suffix stripping. Readings in Information Retrieval, 313–316 (1997)
Salton, G., Buckley, C.: Term weighting approaches in automatic text retrieval. Technical report, Ithaca, NY, USA (1987)
Searle, S.R.: Linear models. J. Wiley, New York (1971)
Treeratpituk, P., Callan, J.: Automatically labeling hierarchical clusters. In: dg.o 2006: Proceedings of the 2006 international conference on Digital government research, pp. 167–176. ACM, New York (2006)
Weiss, S.M., Indurkhya, N., Zhang, T., Damerau, F.J.: Text Mining - Predictive Methods for Analizing Unstructured Information. Springer Science+Business Media, Inc., Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
dos Santos, F.F., de Carvalho, V.O., Oliveira Rezende, S. (2010). Selecting Candidate Labels for Hierarchical Document Clusters Using Association Rules. In: Sidorov, G., Hernández Aguirre, A., Reyes García, C.A. (eds) Advances in Soft Computing. MICAI 2010. Lecture Notes in Computer Science(), vol 6438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16773-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-16773-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16772-0
Online ISBN: 978-3-642-16773-7
eBook Packages: Computer ScienceComputer Science (R0)