此部分均是由从原点s的类型开始，终点t的类型结束的长度介于最短长度l

此部分均是由从原点s的类型开始，终点t的类型结束的长度介于最短长度l 和限制最长长度l+k 的最短k步元路径组成，即为有效解空间，这个解空间远远小于异质信息网络的规模，所以我们可以用这个解空间所包含的局部网络模式代替原网络模式，从而解决前文中所提出的问题。基于此，k步层次模式图的数据结构被在本论文中设计了以代替模式丰富的异质信息网络中的网络模式。

0/5000

源语言: -

目标语言: -

结果 (英语) 1: [复制]

复制成功！

This part is composed of the shortest k-step element path starting from the type of the origin s and the type ending with the end point t. The length is between the shortest length l and the shortest k-step element path that limits the longest length l+k, which is the effective solution space. This solution space is far It is much smaller than the scale of the heterogeneous information network, so we can replace the original network model with the local network model contained in this solution space to solve the problems raised in the previous article. Based on this, the data structure of the k-step hierarchical pattern graph is designed in this paper to replace the network pattern in the pattern-rich heterogeneous information network.

正在翻译中..

结果 (英语) 2:[复制]

复制成功！

This part is composed of the type starting from the origin s, the end point t type end length is between the shortest length l and the shortest k-step path limiting the maximum length l-k, that is, the effective solution space, this solution space is much smaller than the size of the heterogeneic information network, so we can use this solution space contains local network mode instead of the original network mode, so as to solve the problem raised in the previous. Based on this, the data structure of k-step hierarchical pattern graph is designed in this paper to replace the network pattern in the heterogeneic information network of rich pattern.

正在翻译中..

结果 (英语) 3:[复制]

复制成功！

This part starts from the type of origin s, and the end length of type T is between the shortest length L and the restricted longest length L + K This solution space is much smaller than the scale of heterogeneous information network. Therefore, we can use the local network model contained in this solution space to replace the original network mode, so we can solve the problem mentioned above. Based on this, the data structure of k-step hierarchical schema graph is designed in this paper to replace the network pattern in the heterogeneous information network with rich patterns.

正在翻译中..

其它语言

本翻译工具支持: 世界语, 丹麦语, 乌克兰语, 乌兹别克语, 乌尔都语, 亚美尼亚语, 伊博语, 俄语, 保加利亚语, 信德语, 修纳语, 僧伽罗语, 克林贡语, 克罗地亚语, 冰岛语, 加利西亚语, 加泰罗尼亚语, 匈牙利语, 南非祖鲁语, 南非科萨语, 卡纳达语, 卢旺达语, 卢森堡语, 印地语, 印尼巽他语, 印尼爪哇语, 印尼语, 古吉拉特语, 吉尔吉斯语, 哈萨克语, 土库曼语, 土耳其语, 塔吉克语, 塞尔维亚语, 塞索托语, 夏威夷语, 奥利亚语, 威尔士语, 孟加拉语, 宿务语, 尼泊尔语, 巴斯克语, 布尔语(南非荷兰语), 希伯来语, 希腊语, 库尔德语, 弗里西语, 德语, 意大利语, 意第绪语, 拉丁语, 拉脱维亚语, 挪威语, 捷克语, 斯洛伐克语, 斯洛文尼亚语, 斯瓦希里语, 旁遮普语, 日语, 普什图语, 格鲁吉亚语, 毛利语, 法语, 波兰语, 波斯尼亚语, 波斯语, 泰卢固语, 泰米尔语, 泰语, 海地克里奥尔语, 爱尔兰语, 爱沙尼亚语, 瑞典语, 白俄罗斯语, 科西嘉语, 立陶宛语, 简体中文, 索马里语, 繁体中文, 约鲁巴语, 维吾尔语, 缅甸语, 罗马尼亚语, 老挝语, 自动识别, 芬兰语, 苏格兰盖尔语, 苗语, 英语, 荷兰语, 菲律宾语, 萨摩亚语, 葡萄牙语, 蒙古语, 西班牙语, 豪萨语, 越南语, 阿塞拜疆语, 阿姆哈拉语, 阿尔巴尼亚语, 阿拉伯语, 鞑靼语, 韩语, 马其顿语, 马尔加什语, 马拉地语, 马拉雅拉姆语, 马来语, 马耳他语, 高棉语, 齐切瓦语, 等语言的翻译.