Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CIKM
2005
Springer

favoriteEmaildiscussreport

158views Information Technology» more CIKM 2005»

Frequent pattern discovery with memory constraint

13 years 10 months ago

Frequent pattern discovery with memory constraint

Download arbor.ee.ntu.edu.tw

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 improving the mining eﬃciency or on reducing the memory size by best eﬀort, we ﬁrst attempt to constrain the upper memory size that can be utilized by mining frequent itemsets in this paper. Categories and Subject Descriptors: H.2.8 [Database Applications]: Data mining General Terms: Algorithms, Management

Kun-Ta Chuang, Ming-Syan Chen

Real-time Traffic

CIKM 2005 | Frequent Itemsets | Interesting Mining Task | Memory Size |

claim paper

Related Content

» From Path Tree To Frequent Patterns A Framework for Mining Frequent Patterns

» Scrutinizing Frequent Pattern Discovery Performance

» SLPMiner An Algorithm for Finding Frequent Sequential Patterns Using LengthDecreasing Supp...

» Discovering PeriodicFrequent Patterns in Transactional Databases

» An Efficient Heuristic Search for RealTime Frequent Pattern Mining

» Inductive Databases and Multiple Uses of Frequent Itemsets The cInQ Approach

» Optimizing a Sequence of Frequent Pattern Queries

» Permupattern discovery of mutable permutation patterns with proximity constraint

» Finding All Frequent Patterns Starting from the Closure

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CIKM
Authors	Kun-Ta Chuang, Ming-Syan Chen

Comments (0)