Scalable Mining of Frequent Tri-concepts from Folksonomies
Mining frequent tri-concepts from folksonomies is an interesting problem with broad applications. Most of the previous tri-concepts mining based algorithms avoided a straightforward handling of the triadic contexts and paid attention to an unfruitful projection of the induced search space into dyadic contexts. As a such projection is very computationally expensive since several tri-concepts are computed redundantly, scalable mining of folksonomies remains a challenging problem. In this paper, we introduce a new algorithm, called Tricons, that directly tackles the triadic form of folksonomies towards a scalable extraction of tri-concepts. The main thrust of the introduced algorithm stands in the application of an appropriate closure operator that splits the search space into equivalence classes for the the localization of tri-minimal generators. These tri-minimal generators make the computation of the tri-concepts less arduous than do the pioneering approches of the literature.The experimental results show that the Tricons enables the scalable frequent tri-concepts mining over two real-life folksonomies.
KeywordsFolksonomies Triadic Concept Analysis Closure Operator Equivalence Classes Triadic Concepts
Unable to display preview. Download preview PDF.
- 1.Besson, J., Robardet, C., Boulicaut, J., Rome, S.: Constraint-based concept mining and its application to microarray data analysis. Intelligent Data Analysis 9, 59–82 (2005)Google Scholar
- 4.Ganter, B., Wille, R.: Formal Concept Analysis. Springer (1999)Google Scholar
- 7.Ji, L., Tan, K.L., Tung, A.K.H.: Mining frequent closed cubes in 3d datasets. In: Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, pp. 811–822 (2006)Google Scholar
- 10.Zaki, M.J.: Closed itemset mining and non-redundant association rule mining. In: Liu, L., Ozsu, M.T. (eds.) Encyclopedia of Database Systems. Springer (2009)Google Scholar