Efficient Algorithms for Attribute-Oriented Induction

Data mining or knowledge discovery in databasesis the search for relationships and global patterns that exist but are hidden in large databases.Many different methodshave been proposed and one of them is the attribute-oriented induction method. In this method, domain knowledge in the form of concepthierarchies helps to generalizethe concepts of the attributes in the database relations. This approach has been generalized to the rule-based attribute-oriented induction. The time complexity of the original algorithms is given by O(N log N), where N is the number of relevant tuples in the database.In this paper, we make use of the static property of the database schema and the concept hierarchies to derive more efficient algorithms. Given that the concept hierarchies and the resulting knowledge are small in size compared to the database,the complexity of our algorithm is O(N). The amount of disk I/O is decreased by O(log N) times compared to the previous methods. We believe that this impro...

• Type: Conference
• Year: 1995
• Where: KDD
• Authors: Hoi-Yee Hwang, Ada Wai-Chee Fu
• Keywords: Attribute-oriented Induction, Attribute-oriented Induction Method, Concept Hierarchies, Data Mining, KDD 1995