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 over-generalization problem encountered by existing methods, GP-Close employs the notion of generalization closure for systematic over...
Saved in:
Main Authors: | JIANG, Tao, TAN, Ah-hwee |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2006
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/6574 https://ink.library.smu.edu.sg/context/sis_research/article/7577/viewcontent/Jiang_Tan2006_Chapter_MiningRDFMetadataForGeneralize.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Mining RDF metadata for generalized association rules: Knowledge discovery in the semantic web era
by: JIANG, Tao, et al.
Published: (2006) -
Guiding promotion candidates through institutionalization of modified job description at the Commercial Department of Kris, Inc.
by: dela Merced, Marlon R.
Published: (2022) -
What is unequal among the equals? Ranking equivalent rules from gene expression data
by: Cai, R., et al.
Published: (2013) -
Extending the evaluation of Genia Event task toward knowledge base construction and comparison to Gene Regulation Ontology task
by: Kim, Jin-Dong, et al.
Published: (2016) -
Generalizing math word problem solvers via solution diversification
by: LIANG, Zhenwen, et al.
Published: (2023)