Design and analysis of dynamic Huffman codes
Journal of the ACM (JACM)
Minimisation of acyclic deterministic automata in linear time
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
A database perspective on knowledge discovery
Communications of the ACM
Fast discovery of association rules
Advances in knowledge discovery and data mining
Inductive databases and condensed representations for data mining (extended abstract)
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
A condensed representation to find frequent patterns
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
Data Mining and Knowledge Discovery
Scalable Algorithms for Association Mining
IEEE Transactions on Knowledge and Data Engineering
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Concise Representation of Frequent Patterns Based on Disjunction-Free Generators
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Mining All Non-derivable Frequent Itemsets
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
The Item-Set Tree: A Data Structure for Data Mining
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
A perspective on inductive databases
ACM SIGKDD Explorations Newsletter
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
On Computing Condensed Frequent Pattern Bases
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
A new algorithm for the construction of minimal acyclic DFAs
Science of Computer Programming
Implicit enumeration of patterns
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
A model for managing collections of patterns
Proceedings of the 2007 ACM symposium on Applied computing
Implicit enumeration of patterns
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Transaction databases, frequent itemsets, and their condensed representations
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
| Hi-index | 0.00 |
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and recently they have been studied actively. However, there has not been much research on how condensed representations should actually be represented. In this paper we study how condensed representations of frequent itemsets can be concretely represented: we propose the use of deterministic finite automata to represent pattern collections and study the properties of the automata representation. The automata representation supports visualization of the patterns in the collection and clustering of the patterns based on their structural properties and interestingness values. Furthermore, we show experimentally that finite automata provide a space-efficient way to represent itemset collections.