Sciweavers

262 search results - page 11 / 53
» Generalized Closed Itemsets for Association Rule Mining
Sort
View
130
Voted
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 5 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
121
Voted
ICCS
2004
Springer
15 years 7 months ago
Iceberg Query Lattices for Datalog
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension...
Gerd Stumme
APWEB
2005
Springer
15 years 7 months ago
A Fast Algorithm for Mining Share-Frequent Itemsets
Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
ICMLA
2009
14 years 11 months ago
All-Monotony: A Generalization of the All-Confidence Antimonotony
Abstract--Many studies have shown the limits of support/confidence framework used in Apriori-like algorithms to mine association rules. One solution to cope with this limitation is...
Yannick Le Bras, Philippe Lenca, Sorin Moga, St&ea...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
16 years 2 months ago
An inductive database prototype based on virtual mining views
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
Élisa Fromont, Adriana Prado, Bart Goethals...