A perspective on inductive databases
ACM SIGKDD Explorations Newsletter
An Algebra for Inductive Query Evaluation
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Fast Frequent String Mining Using Suffix Arrays
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Answering constraint-based mining queries on itemsets using previous materialized results
Journal of Intelligent Information Systems
A framework to support multiple query optimization for complex mining tasks
MDM '05 Proceedings of the 6th international workshop on Multimedia data mining: mining integrated media and complex data
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Looking for monotonicity properties of a similarity constraint on sequences
Proceedings of the 2006 ACM symposium on Applied computing
A model for managing collections of patterns
Proceedings of the 2007 ACM symposium on Applied computing
Discovering Knowledge from Local Patterns with Global Constraints
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Efficient String Mining under Constraints Via the Deferred Frequency Index
ICDM '08 Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects
Introducing Softness into Inductive Queries on String Databases
Proceedings of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Computational aspects of data mining
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Computational science and data mining
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Unveiling the complexity of human mobility by querying and mining massive trajectory data
The VLDB Journal — The International Journal on Very Large Data Bases
Database transposition for constrained (closed) pattern mining
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
An efficient algorithm for mining string databases under constraints
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Condensed representation of EPs and patterns quantified by frequency-based measures
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Optimal string mining under frequency constraints
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
An efficient framework for mining flexible constraints
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
A survey on condensed representations for frequent sets
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
A unified framework for heterogeneous patterns
Information Systems
Combining CSP and constraint-based mining for pattern discovery
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
Semantic knowledge integration to support inductive query optimization
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Constrained Cube Lattices for Multidimensional Database Mining
International Journal of Data Warehousing and Mining
| Hi-index | 0.00 |
We introduce the boolean inductive query evaluationproblem, which is concerned with answering inductivequeries that are arbitrary boolean expressions over monotonicand anti-monotonic predicates. Secondly, we developa decomposition theory for inductive query evaluation inwhich a boolean query Q is reformulated into k sub-queriesQ_i= Q_A\wedge Q_Mthat are the conjunction of a monotonicand an anti-monotonic predicate. The solution to each sub-querycan be represented using a version space. We investigatehow the number of version spaces k needed to answerthe query can be minimized. Thirdly, for the pattern domainof strings, we show how the version spaces can berepresented using a novel data structure, called the versionspace tree, and can be computed using a variant of the famousApriori algorithm. Finally, we present some experi-mentsthat validate the approach.