JSW 2008 Vol.3(8): 11-18 ISSN: 1796-217X
doi: 10.4304/jsw.3.8.11-18
doi: 10.4304/jsw.3.8.11-18
Automatic Discovery of Semantic Relations Based on Association Rule
Xiangfeng Luo, Kai Yan and Xue Chen
Joint Lab of Next-Generation Internet Interactive Computing, Shanghai University, Shanghai, China
Abstract—Automatic discovery of semantic relations between resources is a key issue in Web-based intelligent applications such as document understanding and Web services. This paper explores how to automatically discover the latent semantic relations and their properties based on the existing association rules. Through building semantic matrix by the association rules, four semantic relations can be extracted using union and intersection in set theory. By building a cyclic graph model, the transitive path of association relation is discovered. Document-level keywords and domain-level keywords as well as their parameters are analyzed to improve the discovery accuracy. Rules can be gained from the experiments to optimize the discovery processes for relations and properties. Further experiments validate the effectiveness and efficiency of the relation discovery algorithms, which can be applied in Web search, intelligent browsing and Web service composition.
Index Terms—Algorithm, Association Rule, Semantic Relation, Transitivity
Abstract—Automatic discovery of semantic relations between resources is a key issue in Web-based intelligent applications such as document understanding and Web services. This paper explores how to automatically discover the latent semantic relations and their properties based on the existing association rules. Through building semantic matrix by the association rules, four semantic relations can be extracted using union and intersection in set theory. By building a cyclic graph model, the transitive path of association relation is discovered. Document-level keywords and domain-level keywords as well as their parameters are analyzed to improve the discovery accuracy. Rules can be gained from the experiments to optimize the discovery processes for relations and properties. Further experiments validate the effectiveness and efficiency of the relation discovery algorithms, which can be applied in Web search, intelligent browsing and Web service composition.
Index Terms—Algorithm, Association Rule, Semantic Relation, Transitivity
Cite: Xiangfeng Luo, Kai Yan and Xue Chen, " Automatic Discovery of Semantic Relations Based on Association Rule," Journal of Software vol. 3, no. 8, pp. 11-18, 2008.
General Information
ISSN: 1796-217X (Online)
Frequency: Quarterly
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, CNKI, Google Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsw@iap.org
-
Apr 26, 2021 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Nov 18, 2021 News!
Papers published in JSW Vol 16, No 1- Vol 16, No 6 have been indexed by DBLP [Click]
-
Dec 24, 2021 News!
Vol 15, No 1- Vol 15, No 6 has been indexed by IET-(Inspec) [Click]
-
Nov 18, 2021 News!
[CFP] 2022 the annual meeting of JSW Editorial Board, ICCSM 2022, will be held in Rome, Italy, July 21-23, 2022 [Click]
-
Feb 09, 2023 News!
Vol 18, No 1 has been published with online version [Click]