Sciweavers

169 search results - page 16 / 34
» Mining Frequent Itemsets using Patricia Tries
Sort
View
CORR
2011
Springer
222views Education» more  CORR 2011»
12 years 11 months ago
A New Data Layout For Set Intersection on GPUs
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
Rasmus Resen Amossen, Rasmus Pagh
KDD
1999
ACM
237views Data Mining» more  KDD 1999»
13 years 11 months ago
Using Association Rules for Product Assortment Decisions: A Case Study
It has been claimed that the discovery of association rules is well-suited for applications of market basket analysis to reveal regularities in the purchase behaviour of customers...
Tom Brijs, Gilbert Swinnen, Koen Vanhoof, Geert We...
ADBIS
1998
Springer
118views Database» more  ADBIS 1998»
13 years 11 months ago
Itemset Materializing for Fast Mining of Association Rules
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...
Marek Wojciechowski, Maciej Zakrzewicz
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 7 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
DATAMINE
2008
89views more  DATAMINE 2008»
13 years 7 months ago
Mining conjunctive sequential patterns
Abstract. In this paper we aim at extending the non-derivable condensed representation in frequent itemset mining to sequential pattern mining. We start by showing a negative examp...
Chedy Raïssi, Toon Calders, Pascal Poncelet