Sciweavers

2 search results - page 1 / 1
» Cartesian contour: a concise representation for a collection...
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
13 years 11 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
KDD
2006
ACM
147views Data Mining» more  KDD 2006»
14 years 5 months ago
Summarizing itemset patterns using probabilistic models
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
Chao Wang, Srinivasan Parthasarathy