Web社会网络的粗糙属性图模型及应用

J4 ›› 2014, Vol. 36 ›› Issue (03): 517-523.

Web社会网络的粗糙属性图模型及应用

张春英1,2,郭景峰1

（1.燕山大学信息学院，河北秦皇岛 066004;2.河北联合大学理学院，河北唐山 063009）

收稿日期:2012-08-13 修回日期:2012-12-27 出版日期:2014-03-25 发布日期:2014-03-25
基金资助:
国家自然科学基金资助项目（61370168）；河北省自然基金资助项目(F2012209019)

The rough attribute graph model of Web
social network and its application

ZHANG Chunying1,2,GUO Jingfeng1

(1.College of Information Science and Engineering,Yanshan University,Qinhuangdao 066004;
2.College of Science,Hebei United University,Tangshan 063009,China)

Received:2012-08-13 Revised:2012-12-27 Online:2014-03-25 Published:2014-03-25

摘要/Abstract

摘要：

针对Web环境下的社会网络具有信息粗糙性的特征，即Web数据中有大量垃圾内容和垃圾链接，同时很多信息是不完整的、缺失的,且信息有重复现象存在等，在已提出的属性图模型基础上，结合粗糙集理论解决不完备信息的优势，首先提出粗糙顶点属性图和粗糙边属性图，进而给出粗糙属性图的概念，以对Web社会网络结构进行分析，使其能够描述复杂Web社会网络中的不完整信息以及动态变化的链接。其次对粗糙属性图的粗糙特性进行分析，给出粗糙顶点精度、粗糙边精度和粗糙图精度等概念，得出粗糙属性图的精度与顶点和边集属性划分程度有关的结论，即人们对图的认知程度与图的精度密切相关。最后，在中国知网上通过对论文作者进行查询得到粗糙图，并通过不断添加顶点属性，将图顶点划分得越来越精细，挖掘出要查询的作者合作关系图，从而说明粗糙属性图在社会网络分析中符合人们的认知过程。

关键词: Web社会网络, 属性图, 粗糙顶点属性图, 粗糙属性图, 图精度

Abstract:

The paper targets the rough information feature of the social network in Web environment, which is that the Web data has a tremendous amount of junk content and garbage link and lots of information is incomplete, missed and repeatable. Firstly, based on the proposed the attribute graph model and combing the advantages of rough set theory solving incomplete information, the rough vertex attribute graph and the rough edges graph are proposed. Furthermore, the rough attribute graph that can describe the complex Web of incomplete social network information and the dynamic changes of links is given so that the Web social network structure is analyzed in an even better fashion. Secondly, the rough characteristics of the rough attributes graph is analyzed in order to give the concepts of rough vertex accuracy, rough edge accuracy, and rough graph accuracy and obtain the conclusion that the accuracy of rough attributes graph is related to the division level of vertex and edge set property. In other word, people's cognition of graph is closely related to the accuracy of graph. Finally, the paper authors are queried to get the rough graph in Chinese HowNet. By constantly adding the vertex attributes and dividing the graph vertex, the author's cooperation relations figure is excavated, thus demonstrating that the rough attribute graph in social network analysis is in line with the cognitive processes of people.

Key words: web social network;attributes graph;rough attribute graph;graph precision

张春英1,2,郭景峰1 . Web社会网络的粗糙属性图模型及应用[J]. J4, 2014, 36(03): 517-523.

ZHANG Chunying1,2,GUO Jingfeng1. The rough attribute graph model of Web
social network and its application [J]. J4, 2014, 36(03): 517-523.

参考文献

［1］Scott J．Social network analysis：A handbook［M］．London：Sage Publications，2000．
［2］Newman M. Finding community structure in networks using the eigenvectors of matrices［J］. Physical Review E, 2006, 74(3):036104.
［3］Chen Lin. Mining web social network［D］. Shanghai:Fudan University,2009.(in Chinese)
［4］Duan Xiaodong, Wang Cunrui, Liu Xiangdong, et al. Web community detection model using particle swarm optimization［J］. Computer Science, 2008,35(3):1821.(in Chinese)
［5］Wen Fei, LI Jianzhong,Ma Shuai, et al. Graph homomorphism revisited for graph matching［J］. Proc of the VLDB Endowment,2010,3(12):11611172.
［6］Ma Shuai, Cao Yang, Fan Wenfei, et al. Capturing topology in graph pattern matching［J］. Proc of VLDB Endowment,2012,5(4):310321.
［7］Guo Jingfeng,Zhang Chunying,Chen Xiao. Attribute graph and its structure［J］. ICIC Express Letters,2011,5(8):26112616.
［8］http : //www.digitalbuzzblog.com/facebookstatisticsstatsfacts2011/.
［9］http://en.wikipedia.org/wiki/facebook.
［10］Ma Shuai, Li Jia, Liu Xudong, et al. Graph search:A new searching approach to the social computing era［J］. Communications of the CCF, 2012,8(11):2633.(in Chinese)
［11］Zhu Yuanyuan, Qin Lu, Yu Xu. Research on problem of image matching［J］. Communications of the CCF, 2012,8(11):2127.(in Chinese)
［12］Guo Jingfeng, Hao dandan, Zheng Chao. An algorithm based on attributed relational graph for name disambiguation［J］. ICIC Express Letters, 2010,5(1):113118.
［13］Cui Yuquan, Zhang Li, Shi Kaiquan. Study of the dynamic characteristics of Rough sets［J］.Shandong University,2010,45(6):813.(in Chinese)
［14］He Tong, Lu Changjing, Shi Kaiquan. Rough graph and its structure［J］. Shandong University,2006,41(6):4650.(in Chinese)
［15］Pawlak Z. Rough sets［J］. International Journal of Computer and Information Sciences,1982(11):341356.
［16］Zhou Aiwu,Zhou Shanshan,Zou Wu,et al.An algorithm of attribution reduction of variable precision rough sets theory［J］. Computer Technology and Development, 2009,19(7):3537.(in Chinese)
附中文参考文献：
［3］林琛.Web环境下社会网络挖掘研究［D］. 上海：复旦大学,2009.
［4］段晓东,王存睿,刘向东,等. 基于粒子群算法的Web社区发现［J］.计算机科学,2008,35(3):1821.
［10］马帅,李佳,刘旭东,等.图查询:社会计算时代的新型搜索［J］.中国计算机学会通讯,2012,8(11):2633.
［11］祝园园,秦璐,于旭.图匹配问题的应用和研究［J］.中国计算机学会通讯,2012,8(11):2127.
［13］崔玉泉,张丽,史开泉.粗糙集的动态特性研究［J］.山东大学学报：理学版,2010,45(6):813.
［14］何童,卢昌荆,史开泉.粗糙图与它的结构［J］.山东大学学报：理学版,2006,41(6):4650.
［16］周爱武，周闪闪，邹武，等.一种基于变精度粗糙集理论的属性约简算法［J］.计算机技术与发展，2009,19(7):3537.

[1]	林庆, 滕飞, 田波, 赵越, 祝锦烨, 冯力. 基于可搜索加密的密态知识图谱存储和检索方案[J]. 计算机工程与科学, 2023, 45(01): 66-76.
[2]	马慧芳, 胡东林, 刘宇航, 李志欣. 融合作者合作强度与研究兴趣的合作者推荐[J]. 计算机工程与科学, 2021, 43(10): 1864-1872.
[3]	李举, 马慧芳, 李青青, 宿云. 融合结构-属性交互二部图随机游走的社区搜索方法[J]. 计算机工程与科学, 2021, 43(06): 1067-1075.
[4]	朱江[1] 孙家广[2] 邹北骥[3] 傅红普[1]. 电气原理图的自动识别[J]. J4, 2007, 29(1): 56-58.