针对异构性的连接不一致问题,提出了一种新的关系发现方法

T. Nakanishi, Kiyotaka Uchimoto, Y. Kidawara
{"title":"针对异构性的连接不一致问题,提出了一种新的关系发现方法","authors":"T. Nakanishi, Kiyotaka Uchimoto, Y. Kidawara","doi":"10.1109/ICIS.2013.6607892","DOIUrl":null,"url":null,"abstract":"We represent the inconsistencies of the past research on the connections among such heterogeneous fields as Linked Data, Semantic Web, Bridge Ontology, and Schema Mapping as well as our own past researches. Graph structures are commonly represented as links in relationships. For the same domain, the relationships agree with each other in the domain, because the transitive and order relations are defined. However, in most heterogeneous domains, we have to define the new order relation to link heterogeneous sets. This limit exists when we consider the relation among heterogeneous fields in set theory. Three inconsistencies of linking heterogeneous resources exist: 1) the inconsistency that shows that the relation does not guarantee the future; 2) the inconsistency where no transitive relation is true, when anyone connects links for heterogeneous fields; and 3) the inconsistency where no relation in heterogeneous fields can be discovered in set theory. Closed assumption systems have already reached their limit. In the big data era, we must consider a new framework for the Three Opened Assumption's Evil. As one solution, we present a map transformation method from set theory to the Cartesian system of coordinates to interconnect these heterogeneous sets and the Three Opened Assumption's Evil by two easy mathematical proofs of transitive and order relations to interconnect the heterogeneous resources. In addition, we define a new functional predicate as an example of a map transformation from set theory to a Cartesian system of coordinates to interconnect the heterogeneous resources for our solution. We also define a “dependOn” function as an example of this framework.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Inconsistencies of connection for heterogeneity and a new relation discovery method that solved them\",\"authors\":\"T. Nakanishi, Kiyotaka Uchimoto, Y. Kidawara\",\"doi\":\"10.1109/ICIS.2013.6607892\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We represent the inconsistencies of the past research on the connections among such heterogeneous fields as Linked Data, Semantic Web, Bridge Ontology, and Schema Mapping as well as our own past researches. Graph structures are commonly represented as links in relationships. For the same domain, the relationships agree with each other in the domain, because the transitive and order relations are defined. However, in most heterogeneous domains, we have to define the new order relation to link heterogeneous sets. This limit exists when we consider the relation among heterogeneous fields in set theory. Three inconsistencies of linking heterogeneous resources exist: 1) the inconsistency that shows that the relation does not guarantee the future; 2) the inconsistency where no transitive relation is true, when anyone connects links for heterogeneous fields; and 3) the inconsistency where no relation in heterogeneous fields can be discovered in set theory. Closed assumption systems have already reached their limit. In the big data era, we must consider a new framework for the Three Opened Assumption's Evil. As one solution, we present a map transformation method from set theory to the Cartesian system of coordinates to interconnect these heterogeneous sets and the Three Opened Assumption's Evil by two easy mathematical proofs of transitive and order relations to interconnect the heterogeneous resources. In addition, we define a new functional predicate as an example of a map transformation from set theory to a Cartesian system of coordinates to interconnect the heterogeneous resources for our solution. We also define a “dependOn” function as an example of this framework.\",\"PeriodicalId\":345020,\"journal\":{\"name\":\"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIS.2013.6607892\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIS.2013.6607892","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

我们代表了过去对关联数据、语义网、桥接本体和模式映射等异构领域之间的联系的研究以及我们自己过去的研究的不一致性。图结构通常表示为关系中的链接。对于同一领域,由于定义了传递关系和顺序关系,因此关系在该领域内是一致的。然而,在大多数异构领域中,我们必须定义新的顺序关系来连接异构集。当我们考虑集合论中异质场之间的关系时,这个极限存在。异构资源链接存在三种不一致性:1)表明该关系不保证未来的不一致性;2)没有传递关系的不一致性,当任何人连接异构字段的链接时;(3)在集合论中不能发现异质场中没有关系的不一致性。封闭假设系统已经达到了极限。在大数据时代,我们必须为“三开假设之恶”考虑一个新的框架。作为一种解决方案,我们通过两个简单的传递关系和顺序关系的数学证明,提出了一种从集合论到笛卡尔坐标系的映射变换方法来互连这些异构集合和三开假设的罪恶。此外,我们定义了一个新的功能谓词,作为从集合论到笛卡尔坐标系的映射转换的例子,以连接我们的解决方案的异构资源。我们还定义了一个“dependdon”函数作为这个框架的一个例子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Inconsistencies of connection for heterogeneity and a new relation discovery method that solved them
We represent the inconsistencies of the past research on the connections among such heterogeneous fields as Linked Data, Semantic Web, Bridge Ontology, and Schema Mapping as well as our own past researches. Graph structures are commonly represented as links in relationships. For the same domain, the relationships agree with each other in the domain, because the transitive and order relations are defined. However, in most heterogeneous domains, we have to define the new order relation to link heterogeneous sets. This limit exists when we consider the relation among heterogeneous fields in set theory. Three inconsistencies of linking heterogeneous resources exist: 1) the inconsistency that shows that the relation does not guarantee the future; 2) the inconsistency where no transitive relation is true, when anyone connects links for heterogeneous fields; and 3) the inconsistency where no relation in heterogeneous fields can be discovered in set theory. Closed assumption systems have already reached their limit. In the big data era, we must consider a new framework for the Three Opened Assumption's Evil. As one solution, we present a map transformation method from set theory to the Cartesian system of coordinates to interconnect these heterogeneous sets and the Three Opened Assumption's Evil by two easy mathematical proofs of transitive and order relations to interconnect the heterogeneous resources. In addition, we define a new functional predicate as an example of a map transformation from set theory to a Cartesian system of coordinates to interconnect the heterogeneous resources for our solution. We also define a “dependOn” function as an example of this framework.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信