Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Efficient parallel data mining for association rules
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Beyond market baskets: generalizing association rules to correlations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Association rules over interval data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Fast discovery of association rules
Advances in knowledge discovery and data mining
Query flocks: a generalization of association-rule mining
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 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
New sampling-based summary statistics for improving approximate query answers
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Integrating association rule mining with relational database systems: alternatives and implications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Online association rule mining
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Optimization of constrained frequent set queries with 2-variable constraints
SIGMOD '99 Proceedings of the 1999 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
Depth first generation of long patterns
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
A tree projection algorithm for generation of frequent item sets
Journal of Parallel and Distributed Computing - Special issue on high-performance data mining
Online query processing: a tutorial
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
The segment support map: scalable mining of frequent itemsets
ACM SIGKDD Explorations Newsletter - Special issue on “Scalable data mining algorithms”
Partial results for online query processing
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Exploiting succinct constraints using FP-trees
ACM SIGKDD Explorations Newsletter
Parallel Mining of Association Rules
IEEE Transactions on Knowledge and Data Engineering
Using a Hash-Based Method with Transaction Trimming for Mining Association Rules
IEEE Transactions on Knowledge and Data Engineering
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Mining Frequent Item Sets with Convertible Constraints
Proceedings of the 17th International Conference on Data Engineering
Ratio Rules: A New Paradigm for Fast, Quantifiable Data Mining
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Scalable Techniques for Mining Causal Structures
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
SPIRIT: Sequential Pattern Mining with Regular Expression Constraints
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Discovery of Multiple-Level Association Rules from Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Mining frequent item sets by opportunistic projection
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient Mining of Constrained Correlated Sets
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
OSSM: A Segmentation Approach to Optimize Frequency Counting
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
CanTree: A Tree Structure for Efficient Incremental Mining of Frequent Patterns
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Frequent pattern discovery in online environment
AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
Distributed Mining of Constrained Patterns from Wireless Sensor Data
WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
CanTree: a canonical-order tree for incremental frequent-pattern mining
Knowledge and Information Systems
Design and development of a prototype system for detecting abnormal weather observations
Proceedings of the 2008 C3S2E conference
A computer-aided change detection system for paediatric acute intracranial haemorrhage
Proceedings of the 2008 C3S2E conference
A data mining proxy approach for efficient frequent itemset mining
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient Mining of Frequent Itemsets from Data Streams
BNCOD '08 Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
FpViz: a visualizer for frequent pattern mining
Proceedings of the ACM SIGKDD Workshop on Visual Analytics and Knowledge Discovery: Integrating Automated Analysis with Interactive Exploration
Dynamic Mining of Quantitative and Categorical Attributes with Skewed Support Distribution
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Efficient algorithms for mining constrained frequent patterns from uncertain data
Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data
Mining uncertain data for constrained frequent sets
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Mining uncertain data for frequent itemsets that satisfy aggregate constraints
Proceedings of the 2010 ACM Symposium on Applied Computing
FIsViz: a frequent itemset visualizer
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
A tree-based approach for frequent pattern mining from uncertain data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
FpVAT: a visual analytic tool for supporting frequent pattern mining
ACM SIGKDD Explorations Newsletter
Efficient algorithms for the mining of constrained frequent patterns from uncertain data
ACM SIGKDD Explorations Newsletter
Classification integration and reclassification using constraint databases
Artificial Intelligence in Medicine
CloseViz: visualizing useful patterns
Proceedings of the ACM SIGKDD Workshop on Useful Patterns
uCFS2: an enhanced system that mines uncertain data for constrained frequent sets
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Visual analytics of social networks: mining and visualizing co-authorship networks
FAC'11 Proceedings of the 6th international conference on Foundations of augmented cognition: directing the future of adaptive systems
Distributed mining of constrained frequent sets from uncertain data
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
An efficient system for detecting outliers from financial time series
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
A new class of constraints for constrained frequent pattern mining
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Fast tree-based mining of frequent itemsets from uncertain data
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
A constrained frequent pattern mining system for handling aggregate constraints
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
Mining popular patterns from transactional databases
DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
| Hi-index | 0.00 |
Data mining is supposed to be an iterative and exploratory process. In this context, we are working on a project with the overall objective of developing a practical computing environment for the human-centered exploratory mining of frequent sets. One critical component of such an environment is the support for the dynamic mining of constrained frequent sets of items. Constraints enable users to impose a certain focus on the mining process; dynamic means that, in the middle of the computation, users are able to (i) change (such as tighten or relax) the constraints and/or (ii) change the minimum support threshold, thus having a decisive influence on subsequent computations. In a real-life situation, the available buffer space may be limited, thus adding another complication to the problem.In this article, we develop an algorithm, called DCF, for Dynamic Constrained Frequent-set computation. This algorithm is enhanced with a few optimizations, exploiting a lightweight structure called a segment support map. It enables DCF to (i) obtain sharper bounds on the support of sets of items, and to (ii) better exploit properties of constraints. Furthermore, when handling dynamic changes to constraints, DCF relies on the concept of a delta member generating function, which generates precisely the sets of items that satisfy the new but not the old constraints. Our experimental results show the effectiveness of these enhancements.