Discovering associations with numeric variables
Contribuinte(s) |
Provost, Foster Srikant, Ramakrishnan |
---|---|
Data(s) |
01/01/2001
|
Resumo |
This paper further develops Aumann and Lindell's [3] proposal for a variant of association rules for which the consequent is a numeric variable. It is argued that these rules can discover useful interactions with numeric data that cannot be discovered directly using traditional association rules with discretization. Alternative measures for identifying interesting rules are proposed. Efficient algorithms are presented that enable these rules to be discovered for dense data sets for which application of Auman and Lindell's algorithm is infeasible.<br /> |
Identificador | |
Idioma(s) |
eng |
Publicador |
Association for Computer Machinery |
Relação |
http://dro.deakin.edu.au/eserv/DU:30004447/webb-discoveringassociations-2001.pdf http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.68.3084&rep=rep1&type=pdf |
Tipo |
Conference Paper |