Sciweavers

148 search results - page 24 / 30
» Mining top-K frequent itemsets from data streams
Sort
View
KDD
2002
ACM
189views Data Mining» more  KDD 2002»
14 years 9 months ago
Sequential PAttern mining using a bitmap representation
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
Jay Ayres, Jason Flannick, Johannes Gehrke, Tomi Y...
ICDM
2005
IEEE
133views Data Mining» more  ICDM 2005»
14 years 2 months ago
Summarization - Compressing Data into an Informative Representation
In this paper, we formulate the problem of summarization of a dataset of transactions with categorical attributes as an optimization problem involving two objective functions - co...
Varun Chandola, Vipin Kumar
KES
2008
Springer
13 years 8 months ago
Data Mining for Navigation Generating System with Unorganized Web Resources
Users prefer to navigate subjects from organized topics in an abundance resources than to list pages retrieved from search engines. We propose a framework to cluster frequent items...
Diana Purwitasari, Yasuhisa Okazaki, Kenzi Watanab...
ICCS
2003
Springer
14 years 1 months ago
A Compress-Based Association Mining Algorithm for Large Dataset
The association mining is one of the primary sub-areas in the field of data mining. This technique had been used in numerous practical applications, including consumer market baske...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
EMS
2008
IEEE
14 years 3 months ago
A Weighted Utility Framework for Mining Association Rules
Association rule mining (ARM) identifies frequent itemsets from databases and generates association rules by assuming that all items have the same significance and frequency of oc...
M. Sulaiman Khan, Maybin K. Muyeba, Frans Coenen