Mining RDF metadata for generalized association rules: knowledge discovery in the semantic web era

Tao Jiang, Ah-Hwee Tan

Abstract

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 over-generalization problem encountered by existing methods, GP-Close employs the notion of emphgeneralization closure for systematic over-generalization reduction.
BibTeX
@inproceedings{jiang2006mining,
  author = {Tao Jiang and Ah-Hwee Tan},
  title = {{Mining RDF metadata for generalized association rules: knowledge discovery in the semantic web era}},
  booktitle = {The Web Conference},
  year = {2006},
  doi = {10.1145/1135777.1135960},
}

Loading related content...

Figure