Matching in Frequent Tree Discovery
Published 31 March 2005Open access
B. Bringmann
Citations9
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
A notion of tree matching for use in frequent tree mining is introduced and it is shown that it generalizes the framework of Zaki while still being more specific than that of Termier et al.
Abstract
status: Published
Keywords
Computer Science
gSpan: graph-based substructure pattern mining
2,030 Citations2003Xifeng Yan, Jiawei Han
A novel algorithm called gSpan (graph-based substructure pattern mining), which discovers frequent substructures without candidate generation by building a new lexicographic order among graphs, and maps each graph to a unique minimum DFS code as its canonical label.
Frequent subgraph discovery
1,063 Citations2002M. Kuramochi, George Karypis
The empirical results show that the algorithm scales linearly with the number of input transactions and it is able to discover frequent subgraphs from a set of graph transactions reasonably fast, even though it has to deal with computationally hard problems such as canonical labeling of graphs and subgraph isomorphism which are not necessary for traditional frequent itemset discovery.
Lecture notes in computer scienceAn Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
1,029 Citations2000Akihiro Inokuchi, Takashi Washio +1 more
A novel approach named AGM to efficiently mine the association rules among the frequently appearing substructures in a given graph data set through the extended algorithm of the basket analysis is proposed.
Efficient Substructure Discovery from Large Semi-structured Data
363 Citations2002Tatsuya Asai, Kenji Abe +4 more
ACM SIGKDD Explorations NewsletterKDD-Cup 2000 organizers' report
255 Citations2000Ron Kohavi, Carla E. Brodley +3 more
KDD-Cup 2000, the yearly competition in data mining, is described, for the first time the Cup included insight problems in addition to prediction problems, thus posing new challenges in both the knowledge discovery and the evaluation criteria and highlighting the need to "peel the onion" and drill deeper into the reasons for the initial patterns found.
TreeFinder: a first step towards XML data mining
185 Citations2003Alexandre Termier, M.-C. Rousset +1 more
This paper considers the problem of searching frequent trees from a collection of tree-structured data modeling XML data, and shows that TreeFinder reaches completeness or falls short for a range of experimental settings.
Machine LearningXRules: An effective algorithm for structural classification of XML data
59 Citations2006Mohammed J. Zaki, Charų C. Aggarwal
This paper discusses the problem of rule based classification of XML data by using frequent discriminatory substructures within XML documents and shows the effectiveness of the method with respect to other classifiers.