Homepage for Mining Structured Data

Home
Structures
Graphs
Molecules
Trees
Relational Databases
Events
Trees

2PXMiner Publication Year: 2004
Purpose: enumerate all frequent rooted induced unordered subtrees with possibly wildcards as labels.
  1. L. Yang, M. Lee, W. Hsu, X. Guo. 2PXMiner - An Efficient Two Pass Mining of Frequent XML Query Patterns. In: Proceedings of the SIGKDD2004. 2004.
Chopper/XSpanner Publication Year: 2004
Purpose: enumerate all frequent embedded ordered subtrees in a database of ordered trees.
  1. Chen Wang, Mingsheng Hong, Jian Pei, Haofeng Zhou, Wei Wang, Baile Shi. Efficient Pattern-Growth Methods for Frequent Tree Pattern Mining. In: PAKDD-2004, 2004.
  2. Chen Wang, Mingsheng Hong, Jian Pei, Haofeng Zhou, Wei Wang, Baile Shi. Chopper: An Efficient Algorithm for Tree Mining, Journal of Computer Science and Technology, Vol.19, No.3, pp:309-319, May 2004.
CMTreeMiner Publication Year: 2003-2004
Purpose: enumerate all closed and maximal frequent unordered induced subtrees in a set of unordered trees.
  1. HOMEPAGE
  2. Yun Chi, Yirong Yang, Richard R. Muntz. CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees. In: UCLA Computer Science Department Technical Report CSD-TR #030053, 2003.
  3. Yun Chi, Yirong Yang, Richard R. Muntz. CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees. In: The Eighth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'04), 2004.
CousinPairs Publication Year: 2004
Purpose: enumerate all frequent cousin pairs in a set of unordered trees.
  1. D. Shasha, J. Wang, S. Zhang. Unordered Tree Mining with Applications to Phylogeny. In: Proceedings of the 20th International Conference on Data Engineering (ICDE 2004), 2004.
Dryade Publication Year: 2004
Purpose: enumerate all closed frequent embedded unordered subtrees in unordered trees where siblings in the patterns are uniquely labeled.
  1. A. Termier, M-C. Rousset, M. Sebag. Dryade: a new approach for discovering closed frequent trees in heterogeneous tree databases. In: Proceedings of the IEEE International Conference on Data Mining (ICDM2004), 2004.
FreeTreeMiner Publication Year: 2003
for Free Trees Purpose: enumerate all frequent (free) subtrees in a set of (free) trees.
  1. HOMEPAGE
  2. Yun Chi, Yirong Yang, Richard R. Muntz. Indexing and Mining Free Trees. In: Proceedings of the International Conference on Data Mining 2003 (ICDM2003), 2003.
  3. Yun Chi, Yirong Yang, Richard R. Muntz. Indexing and Mining Free Trees. In: UCLA Computer Science Department Technical Report #030041, 2003.
FreeTreeMiner Publication Year: 2003-2004
for Graphs Purpose: enumerate all free subtrees in a set of graphs that satisfy constraints specified by the user, optionally using version spaces if other constraints than minimum frequency constraints are used.
  1. Ulrich Rückert, Stefan Kramer. Generalized Version Space Trees. In: Proceedings of the 2nd International Workshop on Knowledge Discovery in Inductive Databases (KDID2004), 2003.
  2. Ulrich Rückert, Stefan Kramer. Frequent Free Tree Discovery in Graph Data. In: Special Track on Data Mining, ACM Symposium on Applied Computing (SAC2004), 2004.
Freqt Publication Year: 2002
Purpose: enumerate all frequent ordered induced subtrees in a set of ordered trees.
  1. WEBPAGE
  2. Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa. Efficient Substructure Discovery from Large Semi-structured Data. In: Proceedings of the 2nd Annual SIAM Symposium on Data Mining, 2002.
  3. Kenji Abe, Shinji Kawasoe, Tatsuya Asai, Hiroki Arimura, Setsuo Arikawa, Optimized Substructure Discovery for Semi-structured Data. In: Proceedings of 6th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD2002), pages 1-14, 2002.
HybridTreeMiner Publication Year: 2003-2004
Purpose: enumerate all frequent (free) subtrees in a set of (free) trees.
  1. HOMEPAGE
  2. Yun Chi, Yirong Yang, Richard R. Muntz. Mining Frequent Rooted Trees and Free Trees Using Canonical Forms. In: UCLA Computer Science Department Technical Report, 2004.
  3. Yun Chi, Yirong Yang, Richard R. Muntz. HybridTreeMiner: An Efficient Algorithm for Mining Frequent Rooted Trees and Free Trees Using Canonical Forms. In: The 16th International Conference on Scientific and Statistical Database Management (SSDBM'04), 2004.
OEM-Miner Publication Year: 2000
Purpose: enumerate all frequent (induced) subtrees in a set of trees represented by the OEM model.
  1. Ke Wang, Huiqing Liu. Discovering Structural Association of Semistructured Data. In: IEEE transactions on knowledge and data engineering 12, 2000.
PathJoin Publication Year: 2003
Purpose: enumerate all frequent induced unordered subtrees in a set of unordered trees.
  1. Yongqiao Xiao, Jenq-Foung Yao, Zhigang Li, Margaret H. Dunham. Efficient Data Mining for Maximal Frequent Subtrees. In: Proceedings of the International Conference on Data Mining 2003 (ICDM2003), 2003.
TreeMiner Publication Year: 2002
Purpose: enumerate all frequent ordered embedded subtrees in a set of ordered trees.
  1. Mohammed Zaki. Efficiently Mining Frequent Trees in a Forest. In: Proceedings of the SIGKDD 2002, 2002.
uFreqt Publication Year: 2003
Purpose: enumerate all frequent unordered induced subtrees in a set of unordered trees.
  1. Siegfried Nijssen, Joost N. Kok. Efficient Discovery of Frequent Unordered Trees. In: First International Workshop on Mining Graphs, Trees and Sequences, 2003.
uNot Publication Year: 2003
Purpose: enumerate all frequent unordered induced subtrees in a set of unordered trees.
  1. Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-ichi Nakano. Discovering Frequent Substructures in Large Unordered Trees. Technical Report 216, University of Kyushuu, 2003.