An efficient algorithm for mining complete share-frequent itemsets using BitTable and heuristics.
Chayanan NawapornananVeera BoonjingPublished in: ICMLC (2012)
Keyphrases
- dynamic programming
- computational complexity
- k means
- learning algorithm
- experimental evaluation
- preprocessing
- computationally efficient
- cost function
- np hard
- computational cost
- recognition algorithm
- clustering method
- high accuracy
- data mining
- association rule mining
- times faster
- frequent item sets
- running times
- significant improvement
- search space
- optimal solution
- decision trees
- data sets
- worst case
- probabilistic model
- simulated annealing
- itemsets
- detection algorithm
- tree structure
- similarity measure
- convergence rate
- image segmentation
- heuristic methods
- apriori algorithm