Диссертация (1090614), страница 19
Текст из файла (страница 19)
— 2015. — C. 154-163.10.Кормен Т., Лейзерсон Ч., Ривест Р., Штайн К. Алгоритмы:построение и анализ, 2-е издание. Пер. с англ. – М.:Издательский дом"Вильямс", 2010. – 1296 с.11.Лахно А.П., Чеповский А.М., Чернобай В.Б. Визуализация связейвыделенного множества объектов семантической сети. // Прикладнаяинформатика. – 2010. – № 6(30). – С. 55–61.12.Лесковец Ю., Раджараман А., Ульман Дж.
Анализ большихнаборов данных. – М.: ДМК Пресс, 2016. – 498 с.13.Рабинович Б.И. Кластерный анализ детализаций телефонныхпереговоров. // Системы и средства информатики, Ин-т пробл.информатики РАН. – 2007. – № 17. – С. 52-78.14.Adai A.T., Date S.V., Wieland S., Marcotte E.M. LGL: creating a mapof protein function with an algorithm for visualizing very large biologicalnetworks. // Journal of Molecular Biology. – 2004.
– V 340. – PP. 179-190.15.Aggarwal C.C. Social network data analytics. – Springer US, 2011. –502 p.16.aiSee - Graph Visualization. // URL: https://www.absint.com/aisee/(Дата обращения: 05.04.2016).17.Battista D.G., Tamassia R. Algorithms for Plane Representations ofAcyclic Digraphs. // Theoretical Computer Science.
– № 61(2). – 1988. – PP.175-198.14918.Battista D.G., Tamassia R., Tollis G.I. Graph Drawing: Algorithms forthe Visualization of Graphs. – Springer, 1999. – 397 p.19.Baur M., Brandes U. Crossing Reduction in Circular Layouts // WG'04Proceedings of the 30th international conference on Graph-TheoreticConcepts in Computer Science. – 2004. – PP. 332-343.20.Blondel V.D., Guillaume J.-L., Lambiotte R., Lefebvre E. Fastunfolding of communities in large networks.
// Journal of StatisticalMechanics: Theory and Experiment. – 2008. № 10, P10008. – 12 p.21.Borgatti S.P., Everett M.G., Johnson J.C. Analyzing social networks. –SAGE Publications Limited, 2013. – 304 p.22.Clauset A., Newman M.E.J., Moore C. Finding community structure invery large networks. // Physical Review. – 2004. – E 70, 066111. – 6 p.23.COSBILabGraph.http://www.cosbi.eu/research/prototypes/graph//(ДатаURL:обращения:05.04.2016).24.CrimeLink. // URL: http://www.pciusa.us/Crimelink.aspx.
(Датаобращения: 08.02.2015).25.Cytoscape. // URL: http://www.cytoscape.org/ (Дата обращения:05.04.2016).26.Domenico M., Lancichinetti A., Arenas A., Rosvall M. Identifyingmodular flows on multilayer networks reveals highly overlappingorganization in interconnected systems. // Physical Review. – 2015. – X. 5,011027. – 14 p.27.Donetti L., Munoz M.
A. Improved spectral algorithm for the detectionof network communities. // The Proceedings of the 8th Granada Seminar Computational and Statistical Physics. – 2005. – 0504059. – 4 p.15028.Duchet P., Hamidoune Y., Vergnas M., Meyniel H. Representing aplanar graph by vertical lines joining different levels. // Discrete Math.
– 1983.– Vol. 46 (3). – PP. 319–321.29.Dwyer T., Marriott K., Stuckey P.J. Fast node overlap removal. // InProc. 13th Intl. Symp. Graph Drawing GD '05. Lecture Notes in ComputerScience. – 2006. – Vol. 3843. – PP. 153-164.30.Esquivel A., Rosvall M. Compression of flow can reveal overlappingmodular organization in networks. // Physical Review. – 2011. – X 1, 021025.– 10 p.31.Fortunato S. Community Detection in Graphs.
// Physics Reports. –2010. – Vol.486. – № 3. – PP. 75-174.32.Gephi. // URL: https://gephi.org/(Дата обращения: 05.04.2016).33.Girvan M., Newman M.E.J.. Community structure in social andbiological networks. // Proc. Natl. Acad. Sci. USA. – 2002. – Vol.99. – № 12.– PP. 7821-7827.34.GraphViz.
// URL: http://www.graphviz.org/ (Дата обращения:05.04.2016).35.Guimera R., Sales-Pardo M., Amaral L.A.N. // Modularity fromfluctuations in random graphs and complex networks // Physical Review. –2004. – E 70, 025101. – 4 p.36.Igraph software. // URL: http://igraph.org/ (Дата обращения:05.04.2016).37.i2Analyst'sNotebook.//03.ibm.com/software/products/ru/analysts-notebook/URL:(Датаhttp://wwwобращения:05.04.2014).38.Kaufmann M., Wagner D. Drawing Graphs, Methods and Models. –Springer, 2001.
– 312 p.15139.Lambiotte R., Rosvall M. Ranking and clustering of nodes in networkswith smart teleportation. // Physical Review. – 2012. – E 85, 056107. – 10 p.40.Lancichinetti A., Fortunato S. Benchmarks for testing communitydetection algorithms on directed and weighted graphs with overlappingcommunities. // Physical Review. – 2009. – E 80, 016118. – 9 p.41.Lancichinetti A., Fortunato S.
Community detection algorithms: acomparative analysis. // Physical Review. – 2009. – E 80, 056117. – 12 p.42.Lancichinetti A., Fortunato S., Radicchi F.. Benchmark graphs fortesting community detection algorithms. // Physical Review. – 2008. – E 78,046110.
– 6 p.43.Liu H., Salerno J., Young M. Social Computing, Behavioral Modeling,and Prediction. – Springer Science, 2008. – 264 p.44.Lovasz L. Random Walks on Graphs: A Survey. // Combinatorics, Paulerdos is eighty, Keszthely, Hungary. – 1993. – Vol.2. – PP. 1-46.45.Luke D.A. A User's Guide to Network Analysis in R. – SpringerInternational Publishing Switzerland, 2015.
– 240 p.46.Marriott K., Stuckey P., Tam V., He W. Removing node overlapping ingraph layout using constrained optimization. // Constraints. – 2003. – Vol. 8(2). – PP. 143-171.47.Massen C.P., Doye J.P. Identifying communities within energylandscapes. // Physical Review. – 2005. E 71, 046101.
– 13p.48.Mena J. Investigative Data Mining for Security and Criminal Detection.– Elsevier Science, 2003. – 280 p.49.NetMiner 4. // URL: http://www.netminer.com/main/main-read.do(Дата обращения: 05.04.2016)50.Newman M.E.J. Fast algorithm for detecting community structure innetworks. // Physical Review. – 2004. – E 69, 066133.
– 5 p.15251.Newman M.E.J. Modularity and community structure in networks. //Proc. Natl. Acad. Sci. USA. – 2006. – Vol.103. – № 23. – PP. 8577-8582.52.Newman M.E.J. Networks: An Introduction. – Oxford University Press,2010. – 784 p.53.Newman M.E.J. The structure and function of complex networks. //SIAM Review. – 2003. – Vol.45.
– № 10. – PP.167-256.54.Newman M.E.J., Girvan M. Finding and evaluating communitystructure in networks. // Physical Review. – 2004. – E 69, 026113. – 16 p.55.Olson D. L., Dursun D. Advanced Data Mining Techniques. – Springer,2008. – 180 p.56.Otten R.H.J.M., Wijk J.G. Graph representations in interative layoutdesign.
// In Proc. IEEE Internat. Sympos. On Circuits and Systems. – 1978.– PP. 914–918.57.Palla G., Derenyi I., Farkas I., Vicsek T. Uncovering the overlappingcommunity structure of complex networks in nature and society. // Nature. –2005. – Vol. 435. – PP. 814-818.58.Radicchi F., Castellano C., Loreto V., Cecconi F., Parisi D. Definingand identifying communities in networks. // Proc. Natl. Acad. Sci. USA. –2004.
– Vol.101. – № 9. – PP. 2658-2663.59.Richards J.H. Psychology of Intelligence Analysis. – CentralIntelligence Agency, 1999. – 210 p.60.Rosenstiehl P., Tarjan R.E. Rectilinear planar layouts and bipolarorientations of planar graphs. // Discrete Comput. Geom. – 1986. – Vol. 1.
–No. 4. – PP. 343-353.61.Rosvall M., Bergstrom C. T. An information-theoretic framework forresolving community structure in complex networks. // Proc. Natl. Acad. Sci.USA. – 2007. – Vol.104. – № 18. PP. 7327-7331.15362.Rosvall M., Bergstrom C. T. Maps of information flow revealcommunity structure in complex networks. // Proc. Natl.
Acad. Sci. USA. –2008. – Vol.105. – № 4. – PP. 1118-1123.63.Rosvall M., Bergstrom C. T., Axelsson D. The map equation // TheEuropean Physical Journal Special Topics. – 2009. – Vol. 178. – № 1. – PP.13-23.64.Rosvall M., Esquivel A., Lancichinetti A., West J., Lambiotte R.Memory in network flows and its effects on spreading dynamics andcommunity. // Nature Communications. – 2014. – Vol. 5, 4630. – 8 p.65.SentinelVisualyzer.http://www.fmsasg.com/Products/SentinelVisualizer/.//URL:(Дата обращения:05.04.2016).66.Shannon C.E. A Mathematical Theory of Communication.// BellSystem Technical Journal. – 1948.
– Vol. 27. – PP. 379–423.67.Tom Sawyer. // URL: http://www.tomsawyer.com. (Дата обращения:05.04.2016).68.Tulip. // URL: http://tulip.labri.fr/TulipDrupal/ (Дата обращения:05.04.2016).69.VisualGraph. // URL: https://bitbucket.org/tzolotuhin/visual-graph(Дата обращения: 05.04.2016).70.VisuaLyzer 2.1. // URL: http://socioworks.com/productsall/visualyzer(Дата обращения: 05.04.2016).71.XAnalysLinkExplorer.http://www.xanalys.com/solutions/linkexplorer.html.//URL:(Датаобращения:05.04.2016).72.Xu J., Chen H.
Criminal network analysis and visualization: a datamining perspective. // Communications of the ACM. – 2005. – Vol. 48. – PP.100-107.154yEd. // URL: http://www.yworks.com/products/yed (Дата обращения:73.05.04.2016).Публикации в перечне ведущих рецензируемых научных журналов,рекомендованных ВАК, и приравненных к ним изданиям:Коломейченко, М.И.
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
