更改

删除1字节 、 2020年5月13日 (三) 13:12
第49行: 第49行:  
==历史==
 
==历史==
   −
霍兰 Holland和莱因哈特 Leinhardt率先提出了'''网络三合会普查 a triad census of networks'''的概念,开创了网络模体研究的先河。<ref>Holland, P. W., & Leinhardt, S. (1974). The statistical analysis of local structure in social networks. Working Paper No. 44, National Bureau of Economic Research.</ref><ref>Hollandi, P., & Leinhardt, S. (1975). The Statistical Analysis of Local. Structure in Social Networks. Sociological Methodology, David Heise, ed. San Francisco: Josey-Bass.</ref><ref> Holland, P. W., & Leinhardt, S. (1976). Local structure in social networks. Sociological methodology, 7, 1-45.</ref><ref>Holland, P. W., & Leinhardt, S. (1977). A method for detecting structure in sociometric data. In Social Networks (pp. 411-432). Academic Press.</ref> 他们介绍了枚举各种子图配置的方法,并测试子图计数是否与随机网络中的期望值存在统计学上的差异。
+
霍兰 Holland和莱因哈特 Leinhardt率先提出了'''网络三连体统计 a triad census of networks'''的概念,开创了网络模体研究的先河。<ref>Holland, P. W., & Leinhardt, S. (1974). The statistical analysis of local structure in social networks. Working Paper No. 44, National Bureau of Economic Research.</ref><ref>Hollandi, P., & Leinhardt, S. (1975). The Statistical Analysis of Local. Structure in Social Networks. Sociological Methodology, David Heise, ed. San Francisco: Josey-Bass.</ref><ref> Holland, P. W., & Leinhardt, S. (1976). Local structure in social networks. Sociological methodology, 7, 1-45.</ref><ref>Holland, P. W., & Leinhardt, S. (1977). A method for detecting structure in sociometric data. In Social Networks (pp. 411-432). Academic Press.</ref> 他们介绍了枚举各种子图配置的方法,并测试子图计数是否与随机网络中的期望值存在统计学上的差异。
      第62行: 第62行:     
最近,还发布了用于检测网络基序的acc基序工具。<ref>{{Cite web | url=http://www.ft.unicamp.br/docentes/meira/accmotifs/ |title = Acc-Motif: Accelerated Motif Detection}}</ref>
 
最近,还发布了用于检测网络基序的acc基序工具。<ref>{{Cite web | url=http://www.ft.unicamp.br/docentes/meira/accmotifs/ |title = Acc-Motif: Accelerated Motif Detection}}</ref>
      
==模体发现算法==
 
==模体发现算法==
54

个编辑