Sciweavers

1998 search results - page 9 / 400
» Basic Association Rules
Sort
View
ALT
2002
Springer
14 years 5 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...
DATAMINE
2007
101views more  DATAMINE 2007»
13 years 8 months ago
Using metarules to organize and group discovered association rules
The high dimensionality of massive data results in the discovery of a large number of association rules. The huge number of rules makes it difficult to interpret and react to all ...
Abdelaziz Berrado, George C. Runger
ICDE
2004
IEEE
87views Database» more  ICDE 2004»
14 years 10 months ago
On Local Pruning of Association Rules Using Directed Hypergraphs
In this paper we propose an adaptive local pruning method for association rules. Our method exploits the exact mapping between a certain class of association rules, namely those w...
Sanjay Chawla, Joseph G. Davis, Gaurav Pandey
FQAS
2000
Springer
137views Database» more  FQAS 2000»
14 years 6 days ago
Towards the Tractable Discovery of Association Rules with Negations
Frequent association rules (e.g., AB C to say that when properties A and B are true in a record then, C tends to be also true) have become a popular way to summarize huge datasets...
Jean-François Boulicaut, Artur Bykowski, Ba...
KBS
2002
88views more  KBS 2002»
13 years 8 months ago
Mining the optimal class association rule set
We define an optimal class association rule set to be the minimum rule set with the same predictive power of the complete class association rule set. Using this rule set instead o...
Jiuyong Li, Hong Shen, Rodney W. Topor