A calculus for complex objects
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
CLASSIC: a structural data model for objects
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Data Structures and Algorithms
Data Structures and Algorithms
Efficient generation of plane trees
Information Processing Letters
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
TreeFinder: a First Step towards XML Data Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
CloseGraph: mining closed frequent graph patterns
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Matching in Frequent Tree Discovery
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
DRYADE: A New Approach for Discovering Closed Frequent Trees in Heterogeneous Tree Databases
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Efficient tree pattern matching
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Learning with feature description logics
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
Computing least common subsumers in description logics
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Efficient Mining of High Branching Factor Attribute Trees
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Mining adaptively frequent closed unlabeled rooted trees in data streams
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Frequent Closed Unordered Trees Through Natural Representations
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Adaptive XML Tree Classification on Evolving Data Streams
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
On mining closed sets in multi-relational data
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
Time and space efficient discovery of maximal geometric graphs
DS'07 Proceedings of the 10th international conference on Discovery science
Efficient algorithms for mining frequent and closed patterns from semi-structured data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Mining frequent closed trees in evolving data streams
Intelligent Data Analysis - Ubiquitous Knowledge Discovery
Mining frequent closed graphs on evolving data streams
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Mining closed patterns in relational, graph and network data
Annals of Mathematics and Artificial Intelligence
Mining of closed frequent subtrees from frequently updated databases
Intelligent Data Analysis
| Hi-index | 0.00 |
Frequent closed pattern discovery is one of the most important topics in the studies of the compact representation for data mining. In this paper, we consider the frequent closed pattern discovery problem for a class of structured data, called attribute trees (AT), which is a subclass of labeled ordered trees and can be also regarded as a fragment of description logic with functional roles only. We present an efficient algorithm for discovering all frequent closed patterns appearing in a given collection of attribute trees. By using a new enumeration method, called the prefix-preserving closure extension, which enable efficient depth-first search over all closed patterns without duplicates, we show that this algorithm works in polynomial time both in the total size of the input database and the number of output trees generated by the algorithm. To our knowledge, this is one of the first result for output-sensitive algorithms for frequent closed substructure disocvery from trees and graphs.