ARMGA: Identifying interesting association rules with genetic algorithms

Publication Type:
Journal Article
Citation:
Applied Artificial Intelligence, 2005, 19 (7), pp. 677 - 689
Issue Date:
2005-08-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2005000816.pdf830.21 kB
Adobe PDF
Priori-like algorithms for association rules mining have relied on two user-specified thresholds: minimum support and minimum confidence. There are two significant challenges to applying these algorithms to real-world applications: database-dependent minimum-support and exponential search space. Database-dependent minimum-support means that users must specify suitable thresholds for their mining tasks though they may have no knowledge concerning their databases. To circumvent these problems, in this paper, we design an evolutionary mining strategy, namely the ARMGA model, based on a genetic algorithm. Like general genetic algorithms, our ARMGA model is effective for global searching, especially when the search space is so large that it is hardly possible to use deterministic searching method. Copyright © 2005 Taylor & Francis Inc.
Please use this identifier to cite or link to this item: