Mining the smallest association rule set for predictions - IEEE Xplore
ieeexplore.ieee.org › document
In this paper we define a rule set for a given transaction database that is much smaller than the association rule set but makes the same predictions as the ...
In this paper we define a rule set for a given transaction database that is much smaller than the association rule set but makes the same predictions as the ...
In this paper we define a rule set for a given transaction database that is much smaller than the association rule set but makes the same predictions as the ...
This thesis presents an efficient algorithm for mining optimal class association rule sets using upward closure properties to prune weak rules before they ...
In this paper we define a rule set for a given transaction database that is much smaller than the association rule set but makes the same predictions as the ...
In this paper we define a rule set for a given transaction database that is much smaller than the association rule set but makes the same predictions as the ...
... An Informative Rule Set (IRS) is the smallest subset of an association rule set such that it has the same prediction sequence by confidence priority [9] .
In this paper we define a rule set for a given transaction database that is much smaller than the association rule set but makes the same predictions as the ...
https://dblp.org/rec/conf/icdm/LiST01 · Jiuyong Li , Hong Shen, Rodney W. Topor: Mining the Smallest Association Rule Set for Predictions. ICDM 2001: 361-368.
People also ask
What is the problem with association rule mining?
What is the association rule mining?
How to determine minimum support in association rule?
What is the fuzzy association rule in mining?
Mining the smallest association rule set for predictions. Authors. Jiuyong Li; Hong Shen; Topor, R. Publication. Proceedings 2001 IEEE International Conference ...