A communication efficient probabilistic algorithm for mining frequent itemsets from a peer-to-peer network.
Souptik DattaHillol KarguptaPublished in: Stat. Anal. Data Min. (2009)
Keyphrases
- single pass
- dynamic programming
- learning algorithm
- computationally efficient
- preprocessing
- probabilistic model
- optimal solution
- mining of frequent itemsets
- database
- pruning strategy
- uncertain data
- detection algorithm
- np hard
- frequent itemsets
- objective function
- mining frequent itemsets
- knowledge discovery
- k means
- computational complexity
- frequent itemset mining
- information retrieval
- real world