Sciweavers

237 search results - page 29 / 48
» Mining Frequent Itemsets Using Re-Usable Data Structure
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
KDD
2004
ACM
110views Data Mining» more  KDD 2004»
14 years 8 months ago
Generalizing the notion of support
The goal of this paper is to show that generalizing the notion of support can be useful in extending association analysis to non-traditional types of patterns and non-binary data....
Michael Steinbach, Pang-Ning Tan, Hui Xiong, Vipin...
ICDM
2005
IEEE
133views Data Mining» more  ICDM 2005»
14 years 1 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
EMS
2008
IEEE
14 years 2 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
BIS
2010
159views Business» more  BIS 2010»
13 years 2 months ago
Comparing Intended and Real Usage in Web Portal: Temporal Logic and Data Mining
Nowadays the software systems, including web portals, are developed from a priori assumptions about how the system will be used. However, frequently these assumptions hold only par...
Jérémy Besson, Ieva Mitasiunaite, Au...