Sciweavers

6 search results - page 1 / 2
» Mining Non-redundant Information-Theoretic Dependencies betw...
Sort
View
DAWAK
2010
Springer
13 years 9 months ago
Mining Non-redundant Information-Theoretic Dependencies between Itemsets
Abstract. We present an information-theoretic framework for mining dependencies between itemsets in binary data. The problem of closure-based redundancy in this context is theoreti...
Michael Mampaey
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
14 years 5 months ago
Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
Nikolaj Tatti, Jilles Vreeken
TIME
2008
IEEE
14 years 5 months ago
Time Aware Mining of Itemsets
Frequent behavioural pattern mining is a very important topic of knowledge discovery, intended to extract correlations between items recorded in large databases or Web acces logs....
Bashar Saleh, Florent Masseglia
JIIS
2006
119views more  JIIS 2006»
13 years 11 months ago
Answering constraint-based mining queries on itemsets using previous materialized results
Abstract In recent years, researchers have begun to study inductive databases, a new generation of databases for leveraging decision support applications. In this context, the user...
Roberto Esposito, Rosa Meo, Marco Botta
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
14 years 8 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...