An efficient method for mining frequent itemsets with double constraints
Constraint-based frequent itemset mining is necessary when the needs and interests of
users are the top priority. In this task, two opposite types of constraint are studied, namely …
users are the top priority. In this task, two opposite types of constraint are studied, namely …
Fast generation of sequential patterns with item constraints from concise representations
Constraint-based frequent sequence mining is an important and necessary task in data
mining since it shows results very close to the requirements and interests of users. Most …
mining since it shows results very close to the requirements and interests of users. Most …
CG-FHAUI: an efficient algorithm for simultaneously mining succinct pattern sets of frequent high average utility itemsets
The identification of both closed frequent high average utility itemsets (CFHAUIs) and
generators of frequent high average utility itemsets (GFHAUIs) has substantial significance …
generators of frequent high average utility itemsets (GFHAUIs) has substantial significance …
Simultaneous mining of frequent closed itemsets and their generators: Foundation and algorithm
Closed itemsets and their generators play an important role in frequent itemset and
association rule mining. They allow a lossless representation of all frequent itemsets and …
association rule mining. They allow a lossless representation of all frequent itemsets and …
An efficient algorithm for mining frequent itemsets with single constraint
Towards the user, it is necessary to find the frequent itemsets which include a set C 0,
especially when C 0 is changed regularly. Our recent studies showed that the frequent …
especially when C 0 is changed regularly. Our recent studies showed that the frequent …
[HTML][HTML] Efficiently mining association rules based on maximum single constraints
A serious problem encountered during the mining of association rules is the exponential
growth of their cardinality. Unfortunately, the known algorithms for mining association rules …
growth of their cardinality. Unfortunately, the known algorithms for mining association rules …
An approach for mining association rules intersected with constraint itemsets
When the number of association rules extracted from datasets is very large, using them
becomes too complicated to the users. Thus, it is important to obtain a small set of …
becomes too complicated to the users. Thus, it is important to obtain a small set of …
[HTML][HTML] Structure of frequent itemsets with extended double constraints
Frequent itemset discovering has been one essential task in data mining. In the worst case,
the cardinality of the class of all frequent itemsets is of exponent which leads to many …
the cardinality of the class of all frequent itemsets is of exponent which leads to many …
An efficient method for mining association rules based on minimum single constraints
Mining association rules with constraints allow us to concentrate on discovering a useful
subset instead of the complete set of association rules. With the aim of satisfying the needs …
subset instead of the complete set of association rules. With the aim of satisfying the needs …
An approach for mining concurrently closed itemsets and generators
Closed itemsets and their generators play an important role in frequent itemset and
association rule mining since they lead to a lossless representation of all frequent itemsets …
association rule mining since they lead to a lossless representation of all frequent itemsets …