Sciweavers

179 search results - page 22 / 36
» An Approximate Approach for Mining Recently Frequent Itemset...
Sort
View
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
PAKDD
2010
ACM
152views Data Mining» more  PAKDD 2010»
14 years 1 months ago
Mining Association Rules in Long Sequences
Abstract. Discovering interesting patterns in long sequences, and finding confident association rules within them, is a popular area in data mining. Most existing methods define...
Boris Cule, Bart Goethals
ISMVL
2009
IEEE
161views Hardware» more  ISMVL 2009»
14 years 3 months ago
Mining Approximative Descriptions of Sets Using Rough Sets
Using concepts from rough set theory we investigate the existence of approximative descriptions of collections of objects that can be extracted from data sets, a problem of intere...
Dan A. Simovici, Selim Mimaroglu
KAIS
2010
139views more  KAIS 2010»
13 years 7 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
CIB
2004
57views more  CIB 2004»
13 years 8 months ago
Identifying Global Exceptional Patterns in Multi-database Mining
In multi-database mining, there can be many local patterns (frequent itemsets or association rules) in each database. At the end of multi-database mining, it is necessary to analyz...
Chengqi Zhang, Meiling Liu, Wenlong Nie, Shichao Z...