| 面向距离查询的属性加权图聚集算法 |
| |
| 引用本文： | 马慧芳,邴睿,赵卫中,常亮. 面向距离查询的属性加权图聚集算法[J]. 电子学报, 2021, 49(1): 132-139. DOI: 10.12263/DZXB.20190129 |
| |
| 作者姓名： | 马慧芳 邴睿 赵卫中 常亮 |
| |
| 作者单位： | 西北师范大学计算机科学与工程学院,甘肃兰州730070;桂林电子科技大学广西可信软件重点实验室,广西桂林541004;广西师范大学广西多源信息挖掘与安全重点实验室,广西桂林541004;西北师范大学计算机科学与工程学院,甘肃兰州730070;华中师范大学计算机学院,湖北武汉430079;桂林电子科技大学广西可信软件重点实验室,广西桂林541004 |
| |
| 基金项目： | 国家自然科学基金;国家自然科学基金;国家自然科学基金;广西多源信息挖掘与安全重点实验室开放基金;广西可信软件重点实验室研究项目 |
| |
| 摘 要： | 图聚集技术是在保留原始图的结构和属性信息的同时,将一个大规模图聚集成简洁的小规模图的技术.随着图的规模不断增加使得图数据变得难以查询和存储,而基于距离的查询,例如最短路径查询,非常依赖图的规模大小.本文提出了面向距离查询的属性加权图聚集算法,在保证节点之间结构和属性相似的同时,保护了节点之间的距离,并有效地减小了图规模...
|
| 关 键 词： | 图聚集 图查询 距离保护 结构相似度 属性熵 |
| 收稿时间： | 2019-01-22 |
Distance-Query-Oriented Attribute Weighted Graph Aggregation Algorithm |
| |
| MA Hui-fang,BING Rui,ZHAO Wei-zhong,CHANG Liang. Distance-Query-Oriented Attribute Weighted Graph Aggregation Algorithm[J]. Acta Electronica Sinica, 2021, 49(1): 132-139. DOI: 10.12263/DZXB.20190129 |
| |
| Authors: | MA Hui-fang BING Rui ZHAO Wei-zhong CHANG Liang |
| |
| Affiliation: | 1. College of Computer Science and Engineering, Northwest Normal University, Lanzhou, Gansu 730070, China;2. Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin, Guangxi 541004, China;3. Guangxi Key Laboratory of Multi-source Information Mining&Security, Guangxi Normal University, Guilin, Guangxi 541004, China;4. School of Computer, Central China Normal University, Wuhan, Hubei 430079, China |
| |
| Abstract: | Graph aggregation is a technology that aggregates a large-scale graph into a compact and small-scale graph while retaining the structure and attribute information of the original graph.With the increasing size of graph,graph data becomes difficult to query and store.Distance-based queries,such as shortest path queries,depend heavily on the size of graph.In this paper,a distance query-oriented attribute weighted graph aggregation algorithm is proposed,which not only guarantees the similarity of structure and attributes between nodes,but also preserves the distance between nodes,and effectively reduces the size of the graph.The experiments prove that this method is effective and efficient in the query tasks. |
| |
| Keywords: | graph aggregation graph query distance preserving structure similarity attribute entropy |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载免费的PDF全文 |
|
