参考文献
[1]Hu Wei,Jian Ningsheng,Qu Yuzhong,et al.CMO:A Graph Matching for Ontologies[C]//Proceedings of Workshop on Integrating Ontologies.Banff,Canada:[s.n.],2005:43-50 .
[2]Gruber T R.A Translation Approach to Portable Ontology Specifications[J].Knowledge Acquisition,1993,5(2):199-220.
[3]唐杰,梁邦勇,李涓子,等.语义Web的本体自动映射[J].计算机学报,2006,29(11):1956-1976.
[4] Alexander M,Steffen S.Measuring Similarity Between Ontologies [C]//Proceeding of the European Conference on Knowledge Acquisition and Management.Berlin,Germany:Springer,2002:251-263.
[5]Do H H,Rahm E.COMA——A System for Flexible Combination of Schema Matching Approaches[C]//Proceedings of the Very Large Data Bases Conference.Roma,Italy:[s.n.],2001:610-621.
[6]Giunhiglia F,Shvaiko P,Yatskevich M.Semantic Schema Matching[D].Trento,Italy:University of Trento,2005.
[7]Ehrig M,Sure Y.Ontology Mapping——An Integrated Approach[C]//Proceedings of the European Semantics Web Symposium.Berlin,Germany:Springer,2004:76-91.
[8]Pantel P,Lin Dekang.Discovering Word Senses from Text[C]//Proceeding of ACM SIKGDD Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2002:613-619.
[9]Zhu Haiping,Zhong Jiwei,Li Jianming,et al.An Approach for Semantic Search by Matching RDF Graphs[C]//Proceedings of the 15th International Florida Artificial Intelligence Research Society Conference.[S.l.] :AAAI Press,2002:450-
454.
[10]Oldakowski R,Christian B.SemMF:A Framework for Calculating Semantic Similarity of Objects Represented as RDF Graphs[C]//Proceedings of the 4th International Florida Artificial Intelligence Research Society Conference.Galtuay,UK:
[s.n.],2005:1-3.
[11]Araujo S,Hidders J,Schwabe D,et al.SERIMI-resource Description Similarity,RDF Instance Matching and Interlinking[EB/OL].(2011-07-06).http://ceur-ws.org/Vol-814/om2011_poster6.pdf.
[12]Patel-Schneider P F,Hayes P,Horrock I.OWL Web Ontology Language Semantics and Abstract Syntax[EB/OL].(2004-02-10).https://www.w3.org/TR/owl-semantics/.
[13]Blondel V D,Cajardo A,Heymans M.A Measure of Similarity Between Graph Vertices:Application to Synonym Extraction and Web Searching[J].Siam Review,2004,46(4):647-666.
[14]Klyne G,Jeremy J.Resource Description Framework(RDF):Concepts and Abstract Syntax[EB/OL] .(2007-08-28).https://www.w3.org/standards/history/rdf-concepts.
(下转第209页)
(上接第203页)
[15]汪锦岭,金蓓弘,李京.一种高效的RDF图模式匹配算法[J].计算机研究与发展,2005,42(10):1763-1770.
[16]王颖,刘群,王慧强,等.一种基于RDF图的本体匹配方法[J].计算机应用,2008,28(2):460-462.
[17]吴江宁,刘巧凤.基于最大公共子图文本相似度算法研究[J].情报学报,2010,29(5);785-791.
[18]赖兴瑞.基于最大公共子图的中文Web文本分类研究[D].厦门:厦门大学,2011 .
[19]Bunke H,Shearer K.A Graph Distance Metric Based on the Maximal Common Subgraph[J].Pattern Recognition Letters,1998,19(3-4):255-259.
[20]Conte D,Sansone C.A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs[C]//Proceedings of the 4th International Conference on Graph Based Representations in Pattern
Recognition.Berlin,Germany:Springer,2003:130-141.
[21]Xiao Yanghua,Dong Hua,Wu Wentao,et al.Structure-based Graph Distance Measures of High Degree of Precision[J].Pattern Recognition,2008,41(12):3547-3561.
[22]Buke H.On a Relation Between Graph Edit Distance and Maximum Common Subgraph[J].Pattern Recognition Letters,1997,18(9):689-694.
[23]Yan Xifeng,Zhu Feida,Han Jiawei.Feature-based Similarity Search in Graph Structures[J].ACM Transactions on Database System,2006,31(4):1418-1453.
[24]Hochbaum D.Approximation Algorithms for NP-hard Problems[J].ACM Sigact News,1996,28(2):40-52.
编辑顾逸斐 |