Sciweavers

352 search results - page 30 / 71
» Non-derivable itemset mining
Sort
View
CIDM
2007
IEEE
14 years 2 months ago
Measuring the Validity of Document Relations Discovered from Frequent Itemset Mining
— The extension approach of frequent itemset mining can be applied to discover the relations among documents. Several schemes, i.e., n-gram, stemming, stopword removal and term w...
Kritsada Sriphaew, Thanaruk Theeramunkong
IDEAS
2003
IEEE
106views Database» more  IDEAS 2003»
14 years 27 days ago
Frequent Itemsets Mining for Database Auto-Administration
With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The a...
Kamel Aouiche, Jérôme Darmont, Le Gru...
DAWAK
2006
Springer
13 years 11 months ago
An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
Jia-Ling Koh, Shu-Ning Shin
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 8 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
PKDD
2005
Springer
129views Data Mining» more  PKDD 2005»
14 years 1 months ago
Interestingness is Not a Dichotomy: Introducing Softness in Constrained Pattern Mining
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
Stefano Bistarelli, Francesco Bonchi