Please wait a minute...
Advanced Search
现代图书情报技术  2015, Vol. 31 Issue (10): 72-80     https://doi.org/10.11925/infotech.1003-3513.2015.10.10
  研究论文 本期目录 | 过刊浏览 | 高级检索 |
社会网络三元结构中关注影响力研究——以学生关系网络为例
吴江, 张劲帆
武汉大学信息管理学院 武汉 430072
Research on Follow Influence of Triadic Structure in Social Network——Take Student Relation Network as an Example
Wu Jiang, Zhang Jinfan
School of Information Management, Wuhan University, Wuhan 430072, China
全文: PDF (837 KB)   HTML  
输出: BibTeX | EndNote (RIS)      
摘要 

[目的] 研究线下关系网络中不同三元结构对关系形成中关注影响力的作用。[方法] 通过对221名学生在不同时间的问卷调查, 得到一个学生关系网络的动态演化过程, 进而统计分析不同三元结构对关系形成的关注影响力的作用程度。[结果] 使用线下数据得到的分析结果与之前线上数据研究结果一致, 即三元结构中存在互惠性、传递性以及反关系, 更容易形成新的关系, 即关注影响力越大。[局限] 不能完全对关系网络之外产生的影响进行控制。[结论] 线上线下关系形成规律一致, 本文研究成果具有一定的商业价值。

服务
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章
Abstract

[Objective] Study on the effects of different triadic structures on follow influence in relation formation. [Methods] This paper uses questionnaires on 221 students at different time to get the dynamic evolution process of this network, and then analyzes the effects of different triadic structures on relation formation. [Results] The results show that triadic structures with reciprocity, transitivity and revesed relationship are more likely to form a new relation. [Limitations] This paper is unable to completely control the influences besides relation network. [Conclusions] The pattern of online and offline relation formation is the same, which is valuable for bussiness.

收稿日期: 2015-04-14      出版日期: 2016-04-06
:  TP393  
基金资助:

本文系国家自然科学基金面上项目“创新2.0超网络中知识流动和群集交互的协同研究”(项目编号: 71373194)的研究成果之一。

通讯作者: 吴江, ORCID: 0000-0002-3342-9757, E-mail: jiangw@whu.edu.cn。     E-mail: jiangw@whu.edu.cn
作者简介: 作者贡献声明:吴江: 提出研究思路, 设计研究方案, 论文修订; 张劲帆: 进行实验, 撰写论文。
引用本文:   
吴江, 张劲帆. 社会网络三元结构中关注影响力研究——以学生关系网络为例[J]. 现代图书情报技术, 2015, 31(10): 72-80.
Wu Jiang, Zhang Jinfan. Research on Follow Influence of Triadic Structure in Social Network——Take Student Relation Network as an Example. New Technology of Library and Information Service, 2015, 31(10): 72-80.
链接本文:  
https://manu44.magtech.com.cn/Jwk_infotech_wk3/CN/10.11925/infotech.1003-3513.2015.10.10      或      https://manu44.magtech.com.cn/Jwk_infotech_wk3/CN/Y2015/V31/I10/72

[1] Wasserman S, Faust K. Social Network Analysis: Methods and Applications [M]. Cambridge University Press, 1994: 25.
[2] Milo R, Shen-Orr S, Itzkovitz S, et al. Network Motifs: Simple Building Blocks of Complex Networks [J]. Science, 2002, 298(5594): 824-827.
[3] Donald H, Wohl R R. Mass Communication and Parasocial Interaction [J]. Psychiatry, 1956, 19(3): 215-229.
[4] Romero D M, Kleinberg J. The Directed Closure Process in Hybrid Social-Information Networks, with an Analysis of Link Formation on Twitter [C]. In: Proceedings of the 4th International AAAI Conference on Weblogs and Social Media. 2010: 138-145.
[5] Tang J, Sun J, Wang C, et al. Social Influence Analysis in Large-scale Networks [C]. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2009: 807-816.
[6] Tang J, Wu S, Sun J, et al. Cross-domain Collaboration Recommendation [C]. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2012: 1285-1293.
[7] Tan C, Lee L, Tang J, et al. User-level Sentiment Analysis Incorporating Social Networks [C]. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2011: 1397-1405.
[8] Sun J, Tang J. Models and Algorithms for Social Influence Analysis [C]. In: Proceedings of the 6th ACM International Conference on Web Search and Data Mining. ACM, 2013: 775-776.
[9] Heider F. The Psychology of Interpersonal Relations [M]. Psychology Press, 1982.
[10] Klimek P, Thurner S. Triadic Closure Dynamics Drives Scaling Laws in Social Multiplex Networks [J]. New Journal of Physics, 2013, 15(6): Article No.063008.
[11] Li M, Zou H, Guan S, et al. A Coevolving Model Based on Preferential Triadic Closure for Social Media Networks [J]. Scientific Reports, 2013, 3: Article No. 2512.
[12] Lou T, Tang J, Hopcroft J, et al. Learning to Predict Reciprocity and Triadic Closure in Social Networks [J]. ACM Transactions on Knowledge Discovery from Data (TKDD), 2013, 7(2): Article No. 5.
[13] Mollenhorst G, Völker B, Flap H. Shared Contexts and Triadic Closure in Core Discussion Networks [J]. Social Networks, 2011, 33(4): 292-302.
[14] Kossinets G, Watts D J. Empirical Analysis of an Evolving Social Network [J]. Science, 2006, 311(5757): 88-90.
[15] Hopcroft J, Lou T, Tang J. Who will Follow You Back?: Reciprocal Relationship Prediction[C]. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management. ACM, 2011: 1137-1146.
[16] Seshadhri C, Pinar A, Durak N, et al. Directed Closure Measures for Networks with Reciprocity [OL]. arXiv Preprint, 2013. arXiv: 1302.6220.
[17] Snijders T A B, Pattison P E, Robins G L, et al. New Specifications for Exponential Random Graph Models [J]. Sociological Methodology, 2006, 36(1): 99-153.
[18] Robins G, Snijders T, Wang P, et al. Recent Developments in Exponential Random Graph (p*) Models for Social Networks [J]. Social Networks, 2007, 29(2): 192-215.
[19] Kwak H, Lee C, Park H, et al. What is Twitter, a Social Network or a News Media? [C]. In: Proceedings of the 19th International Conference on World Wide Web. ACM, 2010: 591-600.
[20] Gouldner A W. The Norm of Reciprocity: A Preliminary Statement [J]. Journal of Social and Personal Relationships, 1960, 25(2): 161-178.
[21] Watts D J, Strogatz S H. Collective Dynamics of ‘Small-World' Networks [J]. Nature, 1998, 393(6684): 440-442.
[22] McPherson M, Smith-Lovin L, Cook J M. Birds of a Feather: Homophily in Social Networks [J]. Annual Review of Sociology, 2001, 27: 415-444.
[23] Huang H, Tang J, Wu S, et al. Mining Triadic Closure Patterns in Social Networks[C]. In: Proceedings of the 23rd International Conference on World Wide. International World Wide Web Conferences Steering Committee, 2014: 499-504.
[24] Easley D, Kleinberg J. Networks, Crowds, and Markets: Reasoning About a Highly Connected World [M]. Cambridge University Press, 2010.Burt R S. Structural Holes: The Social Structure of Competition [M]. Harvard University Press, 2009.

[1] 陈杰,马静,李晓峰. 融合预训练模型文本特征的短文本分类方法*[J]. 数据分析与知识发现, 2021, 5(9): 21-30.
[2] 李文娜,张智雄. 基于置信学习的知识库错误检测方法研究*[J]. 数据分析与知识发现, 2021, 5(9): 1-9.
[3] 孙羽, 裘江南. 基于网络分析和文本挖掘的意见领袖影响力研究 [J]. 数据分析与知识发现, 0, (): 1-.
[4] 王勤洁, 秦春秀, 马续补, 刘怀亮, 徐存真. 基于作者偏好和异构信息网络的科技文献推荐方法研究*[J]. 数据分析与知识发现, 2021, 5(8): 54-64.
[5] 李文娜, 张智雄. 基于联合语义表示的不同知识库中的实体对齐方法研究*[J]. 数据分析与知识发现, 2021, 5(7): 1-9.
[6] 王昊, 林克柔, 孟镇, 李心蕾. 文本表示及其特征生成对法律判决书中多类型实体识别的影响分析[J]. 数据分析与知识发现, 2021, 5(7): 10-25.
[7] 杨晗迅, 周德群, 马静, 罗永聪. 基于不确定性损失函数和任务层级注意力机制的多任务谣言检测研究*[J]. 数据分析与知识发现, 2021, 5(7): 101-110.
[8] 徐月梅, 王子厚, 吴子歆. 一种基于CNN-BiLSTM多特征融合的股票走势预测模型*[J]. 数据分析与知识发现, 2021, 5(7): 126-138.
[9] 黄名选,蒋曹清,卢守东. 基于词嵌入与扩展词交集的查询扩展*[J]. 数据分析与知识发现, 2021, 5(6): 115-125.
[10] 王晰巍,贾若男,韦雅楠,张柳. 多维度社交网络舆情用户群体聚类分析方法研究*[J]. 数据分析与知识发现, 2021, 5(6): 25-35.
[11] 阮小芸,廖健斌,李祥,杨阳,李岱峰. 基于人才知识图谱推理的强化学习可解释推荐研究*[J]. 数据分析与知识发现, 2021, 5(6): 36-50.
[12] 刘彤,刘琛,倪维健. 多层次数据增强的半监督中文情感分析方法*[J]. 数据分析与知识发现, 2021, 5(5): 51-58.
[13] 陈文杰,文奕,杨宁. 基于节点向量表示的模糊重叠社区划分算法*[J]. 数据分析与知识发现, 2021, 5(5): 41-50.
[14] 张国标,李洁. 融合多模态内容语义一致性的社交媒体虚假新闻检测*[J]. 数据分析与知识发现, 2021, 5(5): 21-29.
[15] 闫强,张笑妍,周思敏. 基于义原相似度的关键词抽取方法 *[J]. 数据分析与知识发现, 2021, 5(4): 80-89.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
版权所有 © 2015 《数据分析与知识发现》编辑部
地址:北京市海淀区中关村北四环西路33号 邮编:100190
电话/传真:(010)82626611-6626,82624938
E-mail:jishu@mail.las.ac.cn