Sciweavers

352 search results - page 39 / 71
» Non-derivable itemset mining
Sort
View
IDA
2009
Springer
13 years 5 months ago
Efficient Vertical Mining of Frequent Closures and Generators
Abstract. The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few m...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
ACTA
2007
85views more  ACTA 2007»
13 years 7 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
KDD
1999
ACM
237views Data Mining» more  KDD 1999»
13 years 12 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...
PAKDD
2000
ACM
128views Data Mining» more  PAKDD 2000»
13 years 11 months ago
Efficient Detection of Local Interactions in the Cascade Model
Detection of interactions among data items constitutes an essential part of knowledge discovery. The cascade model is a rule induction methodology using levelwise expansion of a la...
Takashi Okada
AAAI
2006
13 years 9 months ago
Minimum Description Length Principle: Generators Are Preferable to Closed Patterns
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...
Jinyan Li, Haiquan Li, Limsoon Wong, Jian Pei, Guo...