Study of Social Relations Search Based on Flooding Algorithm and Intimacy

WANG Yue; TENG Gui-fa; WANG Chun-shan; ZHANG Fan

Chinese

您当前的位置：

首页 >

文章列表页 >

Study of Social Relations Search Based on Flooding Algorithm and Intimacy

更新时间：2026-09-04

- Study of Social Relations Search Based on Flooding Algorithm and Intimacy
- Vol. 33, Issue 10, Pages: 102-105(2016)
- 作者机构：
  
  1. 河北农业大学机构信息科学与技术学院,河北,保定,071001
  2. 河北农业大学研究生学院,河北,保定,071001
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2016
- 稿件说明：
移动端阅览
王月, 滕桂法, 王春山, 张璠. 基于泛洪算法与亲疏度的社会关系检索分析研究[J]. 微电子学与计算机, 2016, 33(10): 102-105, 110.

WANG Yue, TENG Gui-fa, WANG Chun-shan, et al. Study of Social Relations Search Based on Flooding Algorithm and Intimacy[J]. 2016, 33(10): 102-105.
王月, 滕桂法, 王春山, 张璠. 基于泛洪算法与亲疏度的社会关系检索分析研究[J]. 微电子学与计算机, 2016, 33(10): 102-105, 110. DOI：

WANG Yue, TENG Gui-fa, WANG Chun-shan, et al. Study of Social Relations Search Based on Flooding Algorithm and Intimacy[J]. 2016, 33(10): 102-105. DOI：

摘要

现有的社会关系检索算法大多忽视人与人之间的亲疏度

检索最短路径或最优路径

导致检索结果不能很好地满足人们的要求.针对此类问题

创新性地提出一种基于泛洪算法与亲疏度的检索算法(flooding algorithm and intimacy search

FIS)

可以检索到源节点到目标节点的所有路径

并能根据亲疏度大小将路径排序.算法将亲疏度映射为边权值

采用邻接表存储社会关系图

利用泛洪算法进行路径检索.仿真实验结果表明

基于泛洪算法与亲疏度的社会关系检索算法综合性能较好

适用性强.同时也发现

关系路径长度小的路径

亲疏度未必大; 相反

关系路径长度大的路径

亲疏度未必小.

Abstract

An innovative algorithm based on flooding algorithm and intimacy in social relations search is put forward on the problem that intimacy is ignored and only can search the shortest or the optimal path. All paths from source node to destination node can be searched in the algorithm. Whats more

paths are ordered by intimacy. The intimacy is mapped to edge weight. Social relational graph is storaged in adjacency list. Flooding algorithm is used to search paths. The simulation results show that this algorithm is performed with high comprehensive and strong adaptability. At the same time it is showed that the path with short path length

is not necessarily has larger intimacy. On the contrary

the path with long path length

is not necessarily has smaller intimacy.

关键词

Keywords

references

毛红梅, 甘晟科. 求关系图中源点到各结点所有路径的一种实用算法[J]. 微电子学与计算机, 2009, 26(3): 128-130. DOI: 128

Noh J D, Rieger H. Random walks on complex networks[J]. Phy Rev Lett, 2004, 92(11): 87-93. DOI: 87

Berlin Adamic L A, Lukose R M, Huberman B A. Local search in unstructured networks[M]. Berlin: Wiley-VCH, 2003.

沈敬欣. 结合最大度与随机游走策略的复杂网络搜索技术研究[D]. 辽宁: 大连海事大学, 2012.

郝春梅. 一种改进的Dijkstra算法的分析及程序实现[J]. 计算机与现代化, 2011, 26(1): 36-38. DOI: 36

Granovetter. The strength of weak ties[J]. The American Journal of Sociology, 1973, 78(6): 1360-1380. DOI: 1360

Sundaresan N, Yi J. Mining the Web for relations[J]. Computer Networks, 2000, 233(1-6): 699-711. DOI: 699

李方敏, 刘新华, 旷海兰. 无线传感器网络中一种高能效低延时的泛洪算法研究[J]. 通信学报, 2007, 28(8): 46-53. DOI: 46

杜一鸣, 滕桂法, 马建斌. 社会网络搜索关键技术研究概述[J]. 现代图书情报技术, 2010, 26(2): 68-73. DOI: 68

傅安国, 郑剑虹. 人际关系网络对事业生涯发展影响的质性研究[J]. 青年研究, 2012, 30(3): 63-74. DOI: 63

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Research on assembly action recognition based on MSS-YOLO-MPHands fusion architecture

Aerial vehicle detection algorithm based on multi-scale fusion and small-object enhancement

Research on the design of blockchain-based AI-generated content traceability framework

Microservices anomaly detection based on the correlation of monitoring metrics

Implementation and verification of a dual-chain power gating strategy for low power design

Related Author

No data

Related Institution

No data

AI问答

Postal code：100079
Tel：（010）53879206 Email：tmw@bjxintong.com.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09082226号-64 京公网安备11010602201714号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰