Efficient Substructure Discovery from Large Semi-structured Data
Tatsuya Asai, Kenji Abe, Shinji Kawasoe et al. · SIAM International Conference on Data Mining · 2002
1 Introduction By rapid progress of network and storage technologies, a huge amount of electronic data such as Web pages and XML data [23] has been available on intra and internet. These electronic data are heterogeneous collection of ill-structured data that have no rigid structures, and often called semi-structured data [1]. Hence, there have been increasing demands for automatic methods for extracting useful information, particularly, for discovering rules or patterns from large collections of semi-structured data, namely, semi-structured data mining [6, 11, 18, 19, 21, 25].
Cited by 364 works. doi:10.1137/1.9781611972726.10
Authors
References
- Mining frequent patterns without candidate generation
- Data Structures and Algorithms
- The Lorel query language for semistructured data
- Efficiently mining long patterns from databases
- Generic Schema Matching with Cupid
- An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
- Wrapper induction: Efficiency and expressiveness
- Data mining using two-dimensional optimized association rules
- Finding frequent substructures in chemical compounds
- Schema discovery for semistructured data