A Triadic Approach to Formal Concept Analysis
ICCS '95 Proceedings of the Third International Conference on Conceptual Structures: Applications, Implementation and Theory
Mining frequent closed cubes in 3D datasets
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Ontologies are us: A unified model of social networks and semantics
Web Semantics: Science, Services and Agents on the World Wide Web
Constraint-based concept mining and its application to microarray data analysis
Intelligent Data Analysis
Discovering shared conceptualizations in folksonomies
Web Semantics: Science, Services and Agents on the World Wide Web
AIMS '08 Proceedings of the 2nd international conference on Autonomous Infrastructure, Management and Security: Resilient Networks and Services
Closed patterns meet n-ary relations
ACM Transactions on Knowledge Discovery from Data (TKDD)
Data & Knowledge Engineering
A quadratic approach for trend detection in folksonomies
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
A personalized recommender system based on users' information in folksonomies
Proceedings of the 22nd international conference on World Wide Web companion
Interesting pattern mining in multi-relational data
Data Mining and Knowledge Discovery
Hi-index | 0.00 |
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 .