[Objective] The paper analyzes the characters of linked data set to improve the traditional Ontology matching method. [Methods] Combine the Ontology matching methods as matching rules from three aspects, which are method of data transformation, similarity of name and similarity of the description information, then use the genetic algorithm to extract the best matching rules, finally use Jena to test. [Results] Construct an Ontology matching framework for linked data set, and realize the interconnection between Ontologies of linked data set. [Limitations] The Ontology matching process mainly solves the problem of heterogeneous Ontologies, failed to match the Ontologies in different fields and languages. [Conclusions] The method can realize the correlation of the linked data set and improve the links of linked data set.
高劲松, 程娅, 梁艳琪. 面向关联数据集的本体匹配方法研究[J]. 现代图书情报技术, 2015, 31(6): 33-40.
Gao Jinsong, Cheng Ya, Liang Yanqi. Ontology Matching for Linked Data Set. New Technology of Library and Information Service, DOI：10.11925/infotech.1003-3513.2015.06.06.
[1] Berners-Lee T. Linked Data [EB/OL]. [2012-10-15]. http:// www.w3.org/DesignIssues/Linked Data.html.
[2] Brickley D, Miller L. FOAF [EB/OL]. [2014-03-05]. http:// www.foaf-project.org/.
[3] Miles A, Bechhofer S.SKOS Simple Knowledge Organization System Namespace Document - HTML Variant. [EB/OL]. (2009-08-18). [2009-08-18]. http://www.w3.org/2009/08/skos- reference/skos.html.
[4] 赵晋巍, 真溱. 本体匹配技术研究概述[J]. 现代图书情报技术, 2009(11): 6-9. (Zhao Jinwei, Zhen Zhen. Research Summary on Ontology Matching Technologies [J]. New Technology of Library and Information Service, 2009(11): 6-9.)
[5] Protégé [EB/OL]. [2013-10-15]. http://protege.stanford.edu/.
[6] Hogan A, Zimmermann A, Umbrich J, et al. Scalable and Distributed Methods for Entity Matching, Consolidation and Disambiguation over Linked Data Corpora [J]. Web Semantics: Science, Services and Agents on the World Wide Web, 2012, 10: 76-110.
[7] Raimond Y, Sutton C, Sandler M. Automatic Interlinking of Music Datasets on the Semantic Web [C]. In: Proceedings of the 17th International World Wide Web Confernce on Linked Data on the Web. 2008.
[8] Sheth A, Aleman-Meza B, Arpinar I B, et al. Semantic Association Identification and Knowledge Discovery for National Security Applications [J]. Journal of Database Management, 2005, 16(1): 33-53.
[9] 潘有能, 刘朝霞. 本体映射技术在关联数据中的应用研究[J]. 情报科学, 2015, 33(1): 54-56. (Pan Youneng, Liu Zhaoxia. Application of Ontology Matching in Linked Data [J]. Information Science, 2015, 33(1): 54-56.)
[10] 王颖, 刘群, 王慧强, 等. 一种基于RDF图的本体匹配方法[J]. 计算机应用, 2008, 28(2): 460-462. (Wang Ying, Liu Qun, Wang Huiqiang, et al. Ontology Matching Approach Based on RDF Graph [J]. Journal of Computer Applications, 2008, 28(2): 460-462.)
[11] 马费成, 赵红斌, 万燕玲, 等. 基于关联数据的网络信息资源集成[J]. 情报杂志, 2011, 30(2): 167-170. (Ma Feicheng, Zhao Hongbin, Wan Yanling, et al. Integration of Network Information Resource Based on Linked Data [J]. Journal of Intelligence, 2011, 30(2): 167-170.)
[12] 贾丽梅, 郑志蕴, 李钝, 等. 基于动态权值的关联数据语义相似度算法研究[J]. 计算机科学, 2014, 41(8): 263-266, 273. (Jia Limei, Zheng Zhiyun, Li Dun, et al. Research on Semantic Similarity Algorithm of Linked Data Based on Dynamic Weigh [J]. Computer Science, 2014, 41(8): 263-266, 273.)
[13] W3C. The Linking Open Data Cloud Diagram [EB/OL]. [2014-08-31]. http://lod-cloud.net/.
[14] Studer R, Benjamins V R, Fensel D. Knowledge Engineering, Principles and Methods [J]. Data and Knowledge Engineering, 1998, 25(1-2): 161-197.
[15] Jaro-Winkler Distance [EB/OL]. [2014-12-19]. http://en. wikipedia.org/wiki/Jaro%E2%80%93Winkler_distance.
[16] Levenshetin V I. Binary Codes Capable of Correcting Deletions, Insertions, and Reversals [J]. Soviet Physics Doklady, 1966, 10(8): 707-710.
[17] Jaccard P. Etude Comparative de la Distribution-Orale dans une Portion des Alpes et des [J]. Bulletin del la Socit Vaudoise des Sciences Naturelles, 1901, 7: 547-579.
[18] Stoilos G, Stamou G, Kollias S. A String Metric for Ontology Alignment [C]. In: Proceedings of the 2005 International Semantic Web Conference, Galway, Ireland. 2005: 624-637.
[19] Sutinen E, Tarhio J. On Using q-gram Locations in Approximate String Matching [C]. In: Proceedings of the 3rd Annual European Symposium, Corfu, Greece. 1995: 327-340.
[20] Le B T, Dieng-Kuntz R, Gandon F. On Ontology Matching Problems for Building a Corporate Semantic Web in a Multi- communities Organization [C]. In: Proceedings of the 6th International Conference on Enterprise Information Systems, Porto, Portugal.2004: 236-243.
[21] Madhavan J, Bernstein P A, Rahm E. Generic Schema Matching with Cupid [C]. In: Proceedings of the 27th International Conference on Very Large Data Bases, Rome, Italy. 2001: 49-58.
[22] Schadd F C, Roos N. MassMatch Results for OAEI 2012[C]. In: Proceedings of the 7th International Workshop on Ontology Matching, Boston, USA．2012:160-167.
[23] Melnik S, Garcia-Molina H, Rahm E. Similarity Flooding: A Versatile Graph Matching Algorithm [C]. In: Proceedings of the 18th International Conference on Data Engineering, San Jose, California, USA. 2002:117-128.
[24] Baker T, Bechhofer S, Isaac A, et al. Key Choices in the Design of Simple Knowledge Organization System (SKOS) [J]. Journal of Web Semantics: Science, Services and Agents on the World Wide Web, 2013. DOI: 10.1016/j.websem. 2013.05.001.
[25] 司徒俊峰, 曹树金, 谢莉. 论基于关联数据的知识链接构建与应用[J]. 图书情报工作, 2013, 57(16): 123-129. (Situ Junfeng, Cao Shujin, Xie Li. Study on the Pattern and the Application of Knowledge Linking Based on Linked Data [J]. Library and Information Service, 2013, 57(16): 123-129.)
