Cartesian contour: a concise representation for a collection of frequent sets.
Ruoming JinYang XiangLin LiuPublished in: KDD (2009)
Keyphrases
- concise representation
- frequent sets
- condensed representations
- association rules
- frequently occurring
- itemsets
- previously unknown
- frequent set mining
- frequent itemsets
- uncertain data
- data sets
- data mining algorithms
- mining frequent
- machine learning
- information retrieval
- tree structures
- minimum support
- frequent itemset mining
- graph databases
- pattern discovery
- mining algorithm
- ranking algorithm