Deakin University
Browse

Discovering associations with numeric variables

conference contribution
posted on 2001-01-01, 00:00 authored by G Webb
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.

History

Title of proceedings

KDD-2001 : proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Event

International Conference on Knowledge Discovery and Data Mining (7th : 2001 : San Francisco, CA)

Pagination

383 - 388

Publisher

Association for Computer Machinery

Location

San Francisco, CA

Place of publication

New York, NY

Start date

2001-08-26

End date

2001-08-29

ISBN-13

9781581133912

ISBN-10

158113391X

Language

eng

Publication classification

E1 Full written paper - refereed

Editor/Contributor(s)

F Provost, R Srikant

Usage metrics

    Research Publications

    Categories

    No categories selected

    Keywords

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC