A hybrid interestingness heuristic approach for attribute-oriented mining

Muyeba, Maybin; Crockett, Keeley; Keane, John

Abstract

A hybrid interestingness heuristic algorithm, clusterAOI, is presented that generates a more interesting generalized final table than traditional attribute-oriented induction (AOI). AOI uses a global static threshold to generalize attributes irrespective of attribute features, consequently leading to overgeneralisation. In contrast, clusterAOI uses attribute features such as concept hierarchies and distinct domain attribute values to dynamically recalculate new attribute thresholds for each of the less significant attributes. ClusterAOI then applies new heuristic functions and the Kullback-leibler (K-L) measure to evaluate interestingness for each attribute and then for all attributes by a harmonic aggregation in each generalisation iteration. The dynamic threshold adjustment, aggregation and evaluation of interestingness within each generalization iteration ultimately generates a higher quality final table than traditional AOI. Results from real-world cancer and population datasets show both significantly increased interestingness and better performance compared with AOI.

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 5th KES International Conference, KES-AMSTA 2011
• Start Date: Jun 29, 2011
• Publication Date: 2011
• Deposit Date: Apr 7, 2025
• Publisher: Springer
• Peer Reviewed: Peer Reviewed
• Volume: 6682
• Series Title: KES-AMSTA: KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
• Book Title: Agent and Multi-Agent Systems: Technologies and Applications
• ISBN: 978-3-642-21999-3
• DOI: https://doi.org/10.1007/978-3-642-22000-5_43