Mining Association Rules in Folksonomies
Studies in classification, data analysis, and knowledge organizationPublished 4 September 2006
Christoph Schmitz, Andreas Hotho, Robert Jäschke, Gerd Stumme
Citations191
SJR quartileQ4
SJR score0.13
SNIP0.15
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
How association rule mining can be adopted to analyze and structure folksonomies, and how the results can be used for ontology learning and supporting emergent semantics is discussed.
Abstract
Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. These systems provide currently relatively few structure. We discuss in this paper, how association rule mining can be adopted to analyze and structure folksonomies, and how the results can be used for ontology learning and supporting emergent semantics. We demonstrate our approach on a large scale dataset stemming from an online system.
Keywords
Computer Science
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Formal Concept Analysis: Mathematical Foundations
4,282 Citations1998Bernhard Ganter, Rudolf Wille +1 more
Formal Concept Analysis
3,078 Citations1999Bernhard Ganter, Rudolf Wille
Lecture notes in computer scienceRESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
2,092 Citations2009Rudolf Wille
Restructuring lattice theory is an attempt to reinvigorate connections with the authors' general culture by interpreting the theory as concretely as possible, and in this way to promote better communication between lattice theorists and potential users of lattices theory.
Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts
1,590 Citations1982Rudolf Wille
CHARM: An Efficient Algorithm for Closed Itemset Mining
896 Citations2002Mohammed J. Zaki, Ching-Jui Hsiao
CHARM is an efficient algorithm for mining all frequent closed itemsets that enumerates closed sets using a dual itemset-tidset search tree, using an efficient hybrid search that skips many levels, and uses a technique called diffsets to reduce the memory footprint of intermediate computations.
Lecture notes in computer scienceInformation Retrieval in Folksonomies: Search and Ranking
853 Citations2006Andreas Hotho, Robert Jäschke +2 more
A formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy and is applied to find communities within the folksonomic and is used to structure search results.
Lecture notes in computer scienceOntologies Are Us: A Unified Model of Social Networks and Semantics
663 Citations2005Peter Mika
Lecture notes in computer scienceA triadic approach to formal concept analysis
242 Citations1995Fritz Lėhmann, Rudolf Wille
The ordinal structure of the triadic concepts of a triadic context can be analysed and graphically represented and can be understood order-theoretically as “complete trilattices” up to isomorphism.
Autonomous Agents and Multi-Agent SystemsThe Origins of Ontologies and Communication Conventions in Multi-Agent Systems
200 Citations1998Luc Steels
This work proposes to replace propositional formulas in the AGM framework of theory change by pairs of propositional formula, representing the rule based character of norms, and to add several principles from the input/output logic framework.
Closed Set Based Discovery of Small Covers for Association Rules.
71 Citations1999Nicolas Pasquier, Yves Bastide +2 more
New algorithms based on the Galois closed sets are proposed to limit the extraction to small informative covers for exact and approximate rules, and small structural covers for approximate rules.
Lecture notes in computer scienceA Finite State Model for On-Line Analytical Processing in Triadic Contexts
25 Citations2005Gerd Stumme
This paper discusses how traditional line diagrams of standard (dyadic) concept lattices can be used for exploring and navigating triadic data, and uses the formalisms of finite state machines for modeling the navigation patterns a user might follow.