Mining RDF Metadata for Generalized Association Rules

In this paper, we present a novel frequent generalized pattern mining algorithm, called GP-Close, for mining generalized associations from RDF metadata. To solve the overgeneralization problem encountered by existing methods, GP-Close employs the notion of generalization closure for systematic over-generalization reduction. Categories and Subject Descriptors: H.2.8 [Database Applications]: Data mining General Terms: Algorithms

• Type: Conference
• Year: 2006
• Where: DEXA
• Authors: Tao Jiang, Ah-Hwee Tan
• Keywords: Database, DEXA 2006, Frequent Generalized Pattern, Mining General Terms, Mining Generalized Associations