标题:A determination algorithm with inclusion relationship between two semantic link networks
作者:Jia, Ruixiang; Qiao, Xinxiao; Zhang, Xinyi
作者机构:[Jia, Ruixiang; Qiao, Xinxiao] Qilu Univ Technol, Sch Informat, Jinan 250353, Shandong, Peoples R China.; [Zhang, Xinyi] Shandong Univ, Sch Elect En 更多
会议名称:2nd International Conference on Information Technology and Management Innovation (ICITMI 2013)
会议日期:JUL 23-24, 2013
来源:INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY II, PTS 1-4
出版年:2013
卷:411-414
页码:2037-2040
DOI:10.4028/www.scientific.net/AMM.411-414.2037
关键词:semantic link; algorithm; inclusion relationship; semantic web
摘要:Semantic link is a hyperlink whick contains rich semantics. Semantic Link Network(SLN) consists of semantic links. Compared with hyperlinks, semantic link contains richer semantic information. There are many kinds of relationships between two SLNs, which contain equality relationship, inclusion relationship and empty set relationship. This paper mainly introduces an algorithm that can determine inclusion relationship between two SLNs. Semantic link newwork may consist of atom nodes or complex node. The determination algorithm proposed in this paper applies only to atomic node.
收录类别:CPCI-S;EI;SCOPUS
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84886287194&doi=10.4028%2fwww.scientific.net%2fAMM.411-414.2037&partnerID=40&md5=d0e47a5c7dcd7b1265abbee0d2a9e120
TOP