Association rule discovery with unbalanced class distributions
Files
(Published version)
Date
2003
Authors
Gu, L.
Li, J.
He, H.
Williams, G.
Hawkins, S.
Kelman, C.
Editors
Gedeon, T.D.
Fung, L.C.C.
Fung, L.C.C.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2003 / Gedeon, T.D., Fung, L.C.C. (ed./s), vol.2903, pp.221-232
Statement of Responsibility
Conference Name
16th Australian Joint Conference on Artificial Intelligence (AI03) (3 Dec 2003 - 5 Dec 2003 : Perth, Western Australia)
Abstract
There are many methods for finding association rules in very large data. However it is well known that most general association rule discovery methods find too many rules, which include a lot of uninteresting rules. Furthermore, the performances of many such algorithms deteriorate when the minimum support is low. They fail to find many interesting rules even when support is low, particularly in the case of significantly unbalanced classes. In this paper we present an algorithm which finds association rules based on a set of new interestingness criteria. The algorithm is applied to a real-world health data set and successfully identifies groups of patients with high risk of adverse reaction to certain drugs. A statistically guided method of selecting appropriate features has also been developed. Initial results have shown that the proposed algorithm can find interesting patterns from data sets with unbalanced class distributions without performance loss.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2003 Springer-Verlag