CrossMine: Efficient Classification Across Multiple Database Relations

Most of today's structured data is stored in relational databases. Such a database consists of multiple relations which are linked together conceptually via entity-relationship links in the design of relational database schemas. Multi-relational classification can be widely used in many disciplines, such as financial decision making, medical research, and geographical applications. However, most classification approaches only work on single "flat" data relations. It is usually difficult to convert multiple relations into a single flat relation without either introducing huge, undesirable "universal relation" or losing essential information. Previous works using Inductive Logic Programming approaches (recently also known as Relational Mining) have proven effective with high accuracy in multi-relational classification. Unfortunately, they suffer from poor scalability w.r.t. the number of relations and the number of attributes in databases. In this paper we propo...

• Type: Conference
• Year: 2004
• Where: ICDE
• Authors: Xiaoxin Yin, Jiawei Han, Jiong Yang, Philip S. Yu
• Keywords: Database, ICDE 2004, Relational Database Schemas, Relational Databases, Single Flat Relation