Sciweavers

259 search results - page 9 / 52
» Mining frequent itemsets in time-varying data streams
Sort
View
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
14 years 7 months ago
Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa
ICTAI
2003
IEEE
15 years 2 months ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo
KAIS
2006
164views more  KAIS 2006»
14 years 9 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
15 years 2 months ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu
85
Voted
CIKM
2005
Springer
15 years 3 months ago
Frequent pattern discovery with memory constraint
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...
Kun-Ta Chuang, Ming-Syan Chen