The implication problem for functional and inclusion dependencies
Information and Control
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Machine Learning
Machine Learning
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Modeling KDD Processes within the Inductive Database Framework
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Open source data mining: workshop report
ACM SIGKDD Explorations Newsletter
ConQueSt: a Constraint-based Querying System for Exploratory Pattern Discovery
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
YALE: rapid prototyping for complex data mining tasks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
GORDIAN: efficient and scalable discovery of composite keys
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Database dependency discovery: a machine learning approach
AI Communications
PSTL: a C++ persistent standard template library
COOTS'01 Proceedings of the 6th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 6
An inductive database prototype based on virtual mining views
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints
Journal on Data Semantics XII
Essential patterns: a perfect cover of frequent patterns
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Constrained colocation mining: application to soil erosion characterization
Proceedings of the 2010 ACM Symposium on Applied Computing
A clustering-based visualization of colocation patterns
Proceedings of the 15th Symposium on International Database Engineering & Applications
Para Miner: a generic pattern mining algorithm for multi-core architectures
Data Mining and Knowledge Discovery
Hi-index | 0.00 |
In the last decade, many data mining tools have been developed. They address most of the classical data mining problems such as classification, clustering or pattern mining. However, providing classical solutions for classical problems is not always sufficient. This is especially true for pattern mining problems known to be "representable as set", an important class of problems which have many applications such as in data mining, in databases, in artificial intelligence, or in software engineering. A common idea is to say that solutions devised so far for classical pattern mining problems, such as frequent itemset mining, should be useful to answer these tasks. Unfortunately, it seems rather optimistic to envision the application of most of publicly available tools even for closely related problems. In this context, the main contribution of this paper is to propose a modular and efficient tool in which users can easily adapt and control several pattern mining algorithms. From a theoretical point of view, this work takes advantage of the common theoretical background of pattern mining problems isomorphic to boolean lattices. This tool, a C++ library called iZi, has been devised and applied to several problems such as itemset mining, constraint mining in relational databases, and query rewriting in data integration systems. According to our first results, the programs obtained using the library have very interesting performance characteristics regarding simplicity of their development. The library is open source and freely available on the Web.