Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

153

DEXA
2006
Springer

102views Database» more DEXA 2006»

Mining RDF Metadata for Generalized Association Rules

15 years 10 months ago

Mining RDF Metadata for Generalized Association Rules

Download www2006.org

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

Tao Jiang, Ah-Hwee Tan

Real-time Traffic

Database | DEXA 2006 | Frequent Generalized Pattern | Mining General Terms | Mining Generalized Associations |

claim paper

Related Content

» Spatial and Temporal Target Association through Semantic Analysis and GPS Data Mining

» Online Web Mining Transactions Association Rules using Frame Metadata Model

» A new method for finding generalized frequent itemsets in generalized association rule min...

» Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy

» Design of a data mining framework to mine generalized association rules in a webbased GIS

» FPtax tree structure based generalized association rule mining

» Mining Generalized Association Rules and Sequential Patterns Using SQL Queries

» IMTAR Incremental Mining of General Temporal Association Rules

» NARFO Algorithm Mining Nonredundant and Generalized Association Rules Based on Fuzzy Ontol...

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	DEXA
Authors	Tao Jiang, Ah-Hwee Tan

Comments (0)