Ma, Yi-Fan; Li, Ming The flowing nature matters: feature learning from the control flow graph of source code for bug localization. (English) Zbl 07538898 Mach. Learn. 111, No. 3, 853-870 (2022). MSC: 68N99 68R10 68T05 PDF BibTeX XML Cite \textit{Y.-F. Ma} and \textit{M. Li}, Mach. Learn. 111, No. 3, 853--870 (2022; Zbl 07538898) Full Text: DOI OpenURL
Balasundaram, Balabhaskar; Borrero, Juan S.; Pan, Hao Graph signatures: identification and optimization. (English) Zbl 07422959 Eur. J. Oper. Res. 296, No. 3, 764-775 (2022). MSC: 90C35 68R10 90C11 90C39 91D30 PDF BibTeX XML Cite \textit{B. Balasundaram} et al., Eur. J. Oper. Res. 296, No. 3, 764--775 (2022; Zbl 07422959) Full Text: DOI OpenURL
Asgari-Chenaghlu, Meysam; Feizi-Derakhshi, Mohammad-Reza; farzinvash, Leili; Balafar, Mohammad-Ali; Motamed, Cina TopicBERT: a cognitive approach for topic detection from multimodal post stream using BERT and memory-graph. (English) Zbl 07568959 Chaos Solitons Fractals 151, Article ID 111274, 13 p. (2021). MSC: 68-XX 91-XX PDF BibTeX XML Cite \textit{M. Asgari-Chenaghlu} et al., Chaos Solitons Fractals 151, Article ID 111274, 13 p. (2021; Zbl 07568959) Full Text: DOI OpenURL
Courtain, Sylvain; Leleux, Pierre; Kivimäki, Ilkka; Guex, Guillaume; Saerens, Marco Randomized shortest paths with net flows and capacity constraints. (English) Zbl 1484.68157 Inf. Sci. 556, 341-360 (2021). MSC: 68R10 05C21 05C82 68T09 90B15 90C35 PDF BibTeX XML Cite \textit{S. Courtain} et al., Inf. Sci. 556, 341--360 (2021; Zbl 1484.68157) Full Text: DOI OpenURL
Yoshida, Tomoki; Takeuchi, Ichiro; Karasuyama, Masayuki Distance metric learning for graph structured data. (English) Zbl 07465655 Mach. Learn. 110, No. 7, 1765-1811 (2021). MSC: 68T05 PDF BibTeX XML Cite \textit{T. Yoshida} et al., Mach. Learn. 110, No. 7, 1765--1811 (2021; Zbl 07465655) Full Text: DOI arXiv OpenURL
Leleux, Pierre; Courtain, Sylvain; Guex, Guillaume; Saerens, Marco Sparse randomized shortest paths routing with Tsallis divergence regularization. (English) Zbl 1473.90050 Data Min. Knowl. Discov. 35, No. 3, 986-1031 (2021). MSC: 90B15 05C81 05C82 68T09 90C35 PDF BibTeX XML Cite \textit{P. Leleux} et al., Data Min. Knowl. Discov. 35, No. 3, 986--1031 (2021; Zbl 1473.90050) Full Text: DOI arXiv OpenURL
Atzmueller, Martin; Günnemann, Stephan; Zimmermann, Albrecht Mining communities and their descriptions on attributed graphs: a survey. (English) Zbl 1473.68135 Data Min. Knowl. Discov. 35, No. 3, 661-687 (2021). MSC: 68T05 05C82 62H30 68T10 PDF BibTeX XML Cite \textit{M. Atzmueller} et al., Data Min. Knowl. Discov. 35, No. 3, 661--687 (2021; Zbl 1473.68135) Full Text: DOI OpenURL
Dondi, Riccardo; Hosseinzadeh, Mohammad Mehdi; Mauri, Giancarlo; Zoppis, Italo Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity. (English) Zbl 1468.90106 J. Comb. Optim. 41, No. 1, 80-104 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{R. Dondi} et al., J. Comb. Optim. 41, No. 1, 80--104 (2021; Zbl 1468.90106) Full Text: DOI arXiv OpenURL
Deng, Junning; Kang, Bo; Lijffijt, Jefrey; De Bie, Tijl Mining explainable local and global subgraph patterns with surprising densities. (English) Zbl 1472.68133 Data Min. Knowl. Discov. 35, No. 1, 321-371 (2021). MSC: 68T05 05C82 62H30 68T10 PDF BibTeX XML Cite \textit{J. Deng} et al., Data Min. Knowl. Discov. 35, No. 1, 321--371 (2021; Zbl 1472.68133) Full Text: DOI OpenURL
Nikolentzos, Giannis; Dasoulas, George; Vazirgiannis, Michalis \(k\)-hop graph neural networks. (English) Zbl 1475.68289 Neural Netw. 130, 195-205 (2020). MSC: 68T05 68R10 PDF BibTeX XML Cite \textit{G. Nikolentzos} et al., Neural Netw. 130, 195--205 (2020; Zbl 1475.68289) Full Text: DOI arXiv OpenURL
Wang, Jiabing; Wang, Rongjie; Wei, Jia; Ma, Qianli; Wen, Guihua Finding dense subgraphs with maximum weighted triangle density. (English) Zbl 1474.68230 Inf. Sci. 539, 36-48 (2020). MSC: 68R10 05C42 05C85 PDF BibTeX XML Cite \textit{J. Wang} et al., Inf. Sci. 539, 36--48 (2020; Zbl 1474.68230) Full Text: DOI OpenURL
Guex, Guillaume; Courtain, Sylvain; Saerens, Marco Covariance and correlation measures on a graph in a generalized bag-of-paths formalism. (English) Zbl 1473.90029 J. Complex Netw. 8, No. 6, Article ID cnaa026, 46 p. (2020). MSC: 90B10 PDF BibTeX XML Cite \textit{G. Guex} et al., J. Complex Netw. 8, No. 6, Article ID cnaa026, 46 p. (2020; Zbl 1473.90029) Full Text: DOI arXiv OpenURL
Le, Ngoc-Thao; Vo, Bay; Nguyen, Lam B. Q.; Fujita, Hamido; Le, Bac Mining weighted subgraphs in a single large graph. (English) Zbl 1457.68234 Inf. Sci. 514, 149-165 (2020). MSC: 68T05 68R10 PDF BibTeX XML Cite \textit{N.-T. Le} et al., Inf. Sci. 514, 149--165 (2020; Zbl 1457.68234) Full Text: DOI OpenURL
Vandaele, Robin; Saeys, Yvan; De Bie, Tijl Mining topological structure in graphs through forest representations. (English) Zbl 07306903 J. Mach. Learn. Res. 21, Paper No. 215, 68 p. (2020). MSC: 68T05 PDF BibTeX XML Cite \textit{R. Vandaele} et al., J. Mach. Learn. Res. 21, Paper No. 215, 68 p. (2020; Zbl 07306903) Full Text: Link OpenURL
Bendimerad, Anes; Mel, Ahmad; Lijffijt, Jefrey; Plantevit, Marc; Robardet, Céline; De Bie, Tijl SIAS-miner: mining subjectively interesting attributed subgraphs. (English) Zbl 1458.68157 Data Min. Knowl. Discov. 34, No. 2, 355-393 (2020). MSC: 68T05 62H30 68R10 PDF BibTeX XML Cite \textit{A. Bendimerad} et al., Data Min. Knowl. Discov. 34, No. 2, 355--393 (2020; Zbl 1458.68157) Full Text: DOI arXiv OpenURL
Shi, Min; Tang, Yufei; Zhu, Xingquan; Liu, Jianxun; He, Haibo Topical network embedding. (English) Zbl 1458.68183 Data Min. Knowl. Discov. 34, No. 1, 75-100 (2020). MSC: 68T05 68R10 68T30 PDF BibTeX XML Cite \textit{M. Shi} et al., Data Min. Knowl. Discov. 34, No. 1, 75--100 (2020; Zbl 1458.68183) Full Text: DOI OpenURL
Miao, Zhuqi; Balasundaram, Balabhaskar An ellipsoidal bounding scheme for the quasi-clique number of a graph. (English) Zbl 1462.05282 INFORMS J. Comput. 32, No. 3, 763-778 (2020). MSC: 05C69 90C27 90C35 PDF BibTeX XML Cite \textit{Z. Miao} and \textit{B. Balasundaram}, INFORMS J. Comput. 32, No. 3, 763--778 (2020; Zbl 1462.05282) Full Text: DOI OpenURL
Patsolic, Heather G.; Park, Youngser; Lyzinski, Vince; Priebe, Carey E. Vertex nomination via seeded graph matching. (English) Zbl 07260677 Stat. Anal. Data Min. 13, No. 3, 229-244 (2020). MSC: 62-XX 68-XX PDF BibTeX XML Cite \textit{H. G. Patsolic} et al., Stat. Anal. Data Min. 13, No. 3, 229--244 (2020; Zbl 07260677) Full Text: DOI arXiv OpenURL
Meng, Jinghan; Pitaksirianan, Napath; Tu, Yi-Cheng Counting frequent patterns in large labeled graphs: a hypergraph-based approach. (English) Zbl 1477.68092 Data Min. Knowl. Discov. 34, No. 4, 980-1021 (2020). MSC: 68P15 05C65 68R10 68W25 90C90 PDF BibTeX XML Cite \textit{J. Meng} et al., Data Min. Knowl. Discov. 34, No. 4, 980--1021 (2020; Zbl 1477.68092) Full Text: DOI OpenURL
Chiapino, Maël; Clémençon, Stephan; Feuillard, Vincent; Sabourin, Anne A multivariate extreme value theory approach to anomaly clustering and visualization. (English) Zbl 1482.62007 Comput. Stat. 35, No. 2, 607-628 (2020). MSC: 62-08 62G32 62H30 PDF BibTeX XML Cite \textit{M. Chiapino} et al., Comput. Stat. 35, No. 2, 607--628 (2020; Zbl 1482.62007) Full Text: DOI arXiv OpenURL
Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs. (English) Zbl 1433.68287 Algorithmica 82, No. 6, 1547-1573 (2020). MSC: 68R10 05C30 05C69 05C85 68W40 PDF BibTeX XML Cite \textit{A. Conte} et al., Algorithmica 82, No. 6, 1547--1573 (2020; Zbl 1433.68287) Full Text: DOI OpenURL
Paramonov, Sergey; Stepanova, Daria; Miettinen, Pauli Hybrid ASP-based approach to pattern mining. (English) Zbl 1472.68152 Theory Pract. Log. Program. 19, No. 4, 505-535 (2019). MSC: 68T05 68N17 68T10 PDF BibTeX XML Cite \textit{S. Paramonov} et al., Theory Pract. Log. Program. 19, No. 4, 505--535 (2019; Zbl 1472.68152) Full Text: DOI arXiv OpenURL
Jaeger, Manfred; Lippi, Marco; Pellegrini, Giovanni; Passerini, Andrea Counts-of-counts similarity for prediction and search in relational data. (English) Zbl 1458.68168 Data Min. Knowl. Discov. 33, No. 5, 1254-1297 (2019). MSC: 68T05 62H30 68R10 PDF BibTeX XML Cite \textit{M. Jaeger} et al., Data Min. Knowl. Discov. 33, No. 5, 1254--1297 (2019; Zbl 1458.68168) Full Text: DOI Link OpenURL
Adriaens, Florian; Lijffijt, Jefrey; De Bie, Tijl Subjectively interesting connecting trees and forests. (English) Zbl 1458.68155 Data Min. Knowl. Discov. 33, No. 4, 1088-1124 (2019). MSC: 68T05 05C05 05C82 68T10 PDF BibTeX XML Cite \textit{F. Adriaens} et al., Data Min. Knowl. Discov. 33, No. 4, 1088--1124 (2019; Zbl 1458.68155) Full Text: DOI OpenURL
Yang, Ruiyu; Jiang, Yuxiang; Mathews, Scott; Housworth, Elizabeth A.; Hahn, Matthew W.; Radivojac, Predrag A new class of metrics for learning on real-valued and structured data. (English) Zbl 1458.68188 Data Min. Knowl. Discov. 33, No. 4, 995-1016 (2019). MSC: 68T05 05C12 62H11 68P30 68R10 92-08 PDF BibTeX XML Cite \textit{R. Yang} et al., Data Min. Knowl. Discov. 33, No. 4, 995--1016 (2019; Zbl 1458.68188) Full Text: DOI arXiv OpenURL
Dou, Jiankai; Lin, Xin; Hu, Wenxin Algorithm for mining approximate frequent subgraphs in a single graph. (Chinese. English summary) Zbl 1449.68023 J. East China Norm. Univ., Nat. Sci. Ed. 2019, No. 6, 73-87 (2019). MSC: 68P15 68R10 PDF BibTeX XML Cite \textit{J. Dou} et al., J. East China Norm. Univ., Nat. Sci. Ed. 2019, No. 6, 73--87 (2019; Zbl 1449.68023) Full Text: DOI OpenURL
Agostini, Matteo; Bressan, Marco; Haddadan, Shahrzad Mixing time bounds for graphlet random walks. (English) Zbl 1481.05145 Inf. Process. Lett. 152, Article ID 105851, 4 p. (2019). MSC: 05C81 05C80 05C85 PDF BibTeX XML Cite \textit{M. Agostini} et al., Inf. Process. Lett. 152, Article ID 105851, 4 p. (2019; Zbl 1481.05145) Full Text: DOI OpenURL
van der Hallen, Matthias; Paramonov, Sergey; Janssens, Gerda; Denecker, Marc Knowledge representation analysis of graph mining. (English) Zbl 1485.68248 Ann. Math. Artif. Intell. 86, No. 1-3, 21-60 (2019). MSC: 68T30 68N17 68R10 68T05 PDF BibTeX XML Cite \textit{M. van der Hallen} et al., Ann. Math. Artif. Intell. 86, No. 1--3, 21--60 (2019; Zbl 1485.68248) Full Text: DOI arXiv OpenURL
Kralj, Jan; Robnik-Sikonja, Marko; Lavrac, Nada NetSDM: semantic data mining with network analysis. (English) Zbl 1483.68350 J. Mach. Learn. Res. 20, Paper No. 32, 50 p. (2019). MSC: 68T09 68R10 68T05 68T30 PDF BibTeX XML Cite \textit{J. Kralj} et al., J. Mach. Learn. Res. 20, Paper No. 32, 50 p. (2019; Zbl 1483.68350) Full Text: Link OpenURL
Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca Listing maximal subgraphs satisfying strongly accessible properties. (English) Zbl 1409.05108 SIAM J. Discrete Math. 33, No. 2, 587-613 (2019). MSC: 05C30 05C85 68R10 05C69 PDF BibTeX XML Cite \textit{A. Conte} et al., SIAM J. Discrete Math. 33, No. 2, 587--613 (2019; Zbl 1409.05108) Full Text: DOI arXiv OpenURL
D’Angelo, Gianlorenzo; D’Emidio, Mattia; Frigioni, Daniele Fully dynamic 2-hop cover labeling. (English) Zbl 07043415 ACM J. Exp. Algorithm. 24, No. 1, Article No. 1.6, 36 p. (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{G. D'Angelo} et al., ACM J. Exp. Algorithm. 24, No. 1, Article No. 1.6, 36 p. (2019; Zbl 07043415) Full Text: DOI OpenURL
Borassi, Michele; Natale, Emanuele KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. (English) Zbl 07043411 ACM J. Exp. Algorithm. 24, No. 1, Article No. 1.2, 35 p. (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{M. Borassi} and \textit{E. Natale}, ACM J. Exp. Algorithm. 24, No. 1, Article No. 1.2, 35 p. (2019; Zbl 07043411) Full Text: DOI arXiv Link OpenURL
Komusiewicz, Christian; Nichterlein, André; Niedermeier, Rolf; Picker, Marten Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments. (English) Zbl 1430.05119 Eur. J. Oper. Res. 275, No. 3, 846-864 (2019). MSC: 05C82 05C09 05C90 68Q17 PDF BibTeX XML Cite \textit{C. Komusiewicz} et al., Eur. J. Oper. Res. 275, No. 3, 846--864 (2019; Zbl 1430.05119) Full Text: DOI arXiv OpenURL
Chen, Zigang; Li, Lixiang; Peng, Haipeng; Liu, Yuhong; Yang, Yixian Attributed community mining using joint general non-negative matrix factorization with graph Laplacian. (English) Zbl 07548434 Physica A 495, 324-335 (2018). MSC: 82-XX PDF BibTeX XML Cite \textit{Z. Chen} et al., Physica A 495, 324--335 (2018; Zbl 07548434) Full Text: DOI OpenURL
Ingalalli, Vijay; Ienco, Dino; Poncelet, Pascal Mining frequent subgraphs in multigraphs. (English) Zbl 1440.68216 Inf. Sci. 451-452, 50-66 (2018). MSC: 68T05 68R10 68T10 PDF BibTeX XML Cite \textit{V. Ingalalli} et al., Inf. Sci. 451--452, 50--66 (2018; Zbl 1440.68216) Full Text: DOI Link OpenURL
Zhao, Xuehua; Liu, Xueyan; Chen, Huiling Network modelling and variational Bayesian inference for structure analysis of signed networks. (English) Zbl 1462.62190 Appl. Math. Modelling 61, 237-254 (2018). MSC: 62F15 62H12 05C82 90B10 PDF BibTeX XML Cite \textit{X. Zhao} et al., Appl. Math. Modelling 61, 237--254 (2018; Zbl 1462.62190) Full Text: DOI OpenURL
Anada, Hiroaki; Matsushima, Tomohiro; Su, Chunhua; Meng, Weizhi; Kawamoto, Junpei; Bag, Samiran; Sakurai, Kouichi Analysis of variance of graph-clique mining for scalable proof of work. (English) Zbl 1477.94066 Guo, Fuchun (ed.) et al., Information security and cryptology. 14th international conference, Inscrypt 2018, Fuzhou, China, December 14–17, 2018, Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11449, 101-114 (2018). MSC: 94A62 05C90 68R10 PDF BibTeX XML Cite \textit{H. Anada} et al., Lect. Notes Comput. Sci. 11449, 101--114 (2018; Zbl 1477.94066) Full Text: DOI OpenURL
Sun, Gengxin; Bin, Sheng Network public opinion propagation model based on interest matching in multiple relationship social network. (Chinese. English summary) Zbl 1449.91086 J. Univ. Sci. Technol. China 48, No. 9, 730-738 (2018). MSC: 91D30 05C82 PDF BibTeX XML Cite \textit{G. Sun} and \textit{S. Bin}, J. Univ. Sci. Technol. China 48, No. 9, 730--738 (2018; Zbl 1449.91086) Full Text: DOI OpenURL
Yanagisawa, Hiroki; Hara, Satoshi Discounted average degree density metric and new algorithms for the densest subgraph problem. (English) Zbl 1418.90065 Networks 71, No. 1, 3-15 (2018). MSC: 90B10 90C35 90C59 90C11 PDF BibTeX XML Cite \textit{H. Yanagisawa} and \textit{S. Hara}, Networks 71, No. 1, 3--15 (2018; Zbl 1418.90065) Full Text: DOI OpenURL
Zhou, Shibo; Xu, Weixiang A novel clustering algorithm based on relative density and decision graph. (Chinese. English summary) Zbl 1424.62113 Control Decis. 33, No. 11, 1921-1930 (2018). MSC: 62H30 68T10 05C90 PDF BibTeX XML Cite \textit{S. Zhou} and \textit{W. Xu}, Control Decis. 33, No. 11, 1921--1930 (2018; Zbl 1424.62113) Full Text: DOI OpenURL
Micale, Giovanni; Giugno, Rosalba; Ferro, Alfredo; Mongiovì, Misael; Shasha, Dennis; Pulvirenti, Alfredo Fast analytical methods for finding significant labeled graph motifs. (English) Zbl 1411.68115 Data Min. Knowl. Discov. 32, No. 2, 504-531 (2018). MSC: 68T05 05C80 05C85 68R10 92C42 PDF BibTeX XML Cite \textit{G. Micale} et al., Data Min. Knowl. Discov. 32, No. 2, 504--531 (2018; Zbl 1411.68115) Full Text: DOI OpenURL
Chen, Hang; Soni, Utkarsh; Lu, Yafeng; Maciejewski, Ross; Kobourov, Stephen Same stats, different graphs (graph statistics and why we need graph drawings). (English) Zbl 07023844 Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11282, 463-477 (2018). MSC: 68R10 68U05 PDF BibTeX XML Cite \textit{H. Chen} et al., Lect. Notes Comput. Sci. 11282, 463--477 (2018; Zbl 07023844) Full Text: DOI arXiv OpenURL
Guigourès, Romain; Boullé, Marc; Rossi, Fabrice Discovering patterns in time-varying graphs: a triclustering approach. (English) Zbl 1416.62375 Adv. Data Anal. Classif., ADAC 12, No. 3, 509-536 (2018). MSC: 62H99 62H30 68T05 PDF BibTeX XML Cite \textit{R. Guigourès} et al., Adv. Data Anal. Classif., ADAC 12, No. 3, 509--536 (2018; Zbl 1416.62375) Full Text: DOI arXiv OpenURL
Cui, Zhanqi Defects detection based on function call sequence patterns and function call graph. (Chinese. English summary) Zbl 1413.68020 Nat. Sci. J. Xiangtan Univ. 40, No. 2, 71-75, 84 (2018). MSC: 68N30 PDF BibTeX XML Cite \textit{Z. Cui}, Nat. Sci. J. Xiangtan Univ. 40, No. 2, 71--75, 84 (2018; Zbl 1413.68020) OpenURL
Wen, Wen; Huang, Jiaming; Cai, Ruichu; Hao, Zhifeng; Wang, Lijuan Graph embedding by incorporating prior knowledge on vertex information. (Chinese. English summary) Zbl 1413.68105 J. Softw. 29, No. 3, 786-798 (2018). MSC: 68T05 68R10 PDF BibTeX XML Cite \textit{W. Wen} et al., J. Softw. 29, No. 3, 786--798 (2018; Zbl 1413.68105) Full Text: DOI OpenURL
Fairbanks, James P.; Bader, David A.; Sanders, Geoffrey D. Spectral partitioning with blends of eigenvectors. (English) Zbl 1462.05220 J. Complex Netw. 5, No. 4, 551-580 (2017). MSC: 05C50 05C70 05C85 68W25 68P05 PDF BibTeX XML Cite \textit{J. P. Fairbanks} et al., J. Complex Netw. 5, No. 4, 551--580 (2017; Zbl 1462.05220) Full Text: DOI arXiv OpenURL
Antkowiak, Aneta; Kaczmarz, Monika; Szajowski, Krzysztof Design of engineering systems in Polish mines in the third quarter of the 20th century. (English) Zbl 1437.01013 Antiq. Math. 11, 251-300 (2017). Reviewer: Christopher Hollings (Oxford) MSC: 01A60 01A73 01A70 PDF BibTeX XML Cite \textit{A. Antkowiak} et al., Antiq. Math. 11, 251--300 (2017; Zbl 1437.01013) Full Text: DOI arXiv OpenURL
Gursoy, Mehmet Emre; Inan, Ali; Nergiz, Mehmet Ercan; Saygin, Yucel Differentially private nearest neighbor classification. (English) Zbl 1411.68104 Data Min. Knowl. Discov. 31, No. 5, 1544-1575 (2017). MSC: 68T05 62H30 68R10 PDF BibTeX XML Cite \textit{M. E. Gursoy} et al., Data Min. Knowl. Discov. 31, No. 5, 1544--1575 (2017; Zbl 1411.68104) Full Text: DOI OpenURL
Chen, Lei; Zhang, Jing; Cai, Lijun; Deng, Ziyun Fast community detection based on distance dynamics. (English) Zbl 1413.05359 Tsinghua Sci. Technol. 22, No. 6, 564-585 (2017). MSC: 05C82 91D30 05C12 PDF BibTeX XML Cite \textit{L. Chen} et al., Tsinghua Sci. Technol. 22, No. 6, 564--585 (2017; Zbl 1413.05359) OpenURL
Kaytoue, Mehdi; Plantevit, Marc; Zimmermann, Albrecht; Bendimerad, Anes; Robardet, Céline Exceptional contextual subgraph mining. (English) Zbl 1458.05246 Mach. Learn. 106, No. 8, 1171-1211 (2017). MSC: 05C90 68T05 PDF BibTeX XML Cite \textit{M. Kaytoue} et al., Mach. Learn. 106, No. 8, 1171--1211 (2017; Zbl 1458.05246) Full Text: DOI OpenURL
Mahdavi Pajouh, Foad; Moradi, Esmaeel; Balasundaram, Balabhaskar Detecting large risk-averse 2-clubs in graphs with random edge failures. (English) Zbl 1357.90169 Ann. Oper. Res. 249, No. 1-2, 55-73 (2017). MSC: 90C35 90B15 PDF BibTeX XML Cite \textit{F. Mahdavi Pajouh} et al., Ann. Oper. Res. 249, No. 1--2, 55--73 (2017; Zbl 1357.90169) Full Text: DOI OpenURL
Talukder, N.; Zaki, M. J. A distributed approach for graph mining in massive networks. (English) Zbl 1411.68123 Data Min. Knowl. Discov. 30, No. 5, 1024-1052 (2016). MSC: 68T05 05C82 62-07 62H30 68P15 68W15 PDF BibTeX XML Cite \textit{N. Talukder} and \textit{M. J. Zaki}, Data Min. Knowl. Discov. 30, No. 5, 1024--1052 (2016; Zbl 1411.68123) Full Text: DOI OpenURL
Lang, Rongling; Li, Tao; Mo, Desen; Shi, Yongtang A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration. (English) Zbl 1410.05051 Appl. Math. Comput. 291, 115-121 (2016). MSC: 05C12 PDF BibTeX XML Cite \textit{R. Lang} et al., Appl. Math. Comput. 291, 115--121 (2016; Zbl 1410.05051) Full Text: DOI OpenURL
Dong, Lijun; Wang, Yi; Liu, Ran; Pi, Benjie; Wu, Liuyi Toward edge minability for role mining in bipartite networks. (English) Zbl 1400.05222 Physica A 462, 274-286 (2016). MSC: 05C82 90B10 PDF BibTeX XML Cite \textit{L. Dong} et al., Physica A 462, 274--286 (2016; Zbl 1400.05222) Full Text: DOI OpenURL
Rasel, Mostofa Kamal; Han, Yongkoo; Kim, Jinseung; Park, Kisung; Tu, Nguyen Anh; Lee, Young-Koo iTri: index-based triangle listing in massive graphs. (English) Zbl 1394.68128 Inf. Sci. 336, 1-20 (2016). MSC: 68P20 05C85 68R10 68W10 PDF BibTeX XML Cite \textit{M. K. Rasel} et al., Inf. Sci. 336, 1--20 (2016; Zbl 1394.68128) Full Text: DOI OpenURL
Ferreira, Leonardo N.; Zhao, Liang Time series clustering via community detection in networks. (English) Zbl 1390.68526 Inf. Sci. 326, 227-242 (2016). MSC: 68T05 05C82 62H30 62M10 PDF BibTeX XML Cite \textit{L. N. Ferreira} and \textit{L. Zhao}, Inf. Sci. 326, 227--242 (2016; Zbl 1390.68526) Full Text: DOI arXiv OpenURL
Borassi, Michele; Natale, Emanuele KADABRA is an adaptive algorithm for betweenness via random approximation. (English) Zbl 1397.68137 Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 20, 18 p. (2016). MSC: 68R10 05C82 05C85 68W25 PDF BibTeX XML Cite \textit{M. Borassi} and \textit{E. Natale}, LIPIcs -- Leibniz Int. Proc. Inform. 57, Article 20, 18 p. (2016; Zbl 1397.68137) Full Text: DOI OpenURL
Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques. (English) Zbl 1388.68218 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 148, 15 p. (2016). MSC: 68R10 05C30 05C69 05C85 PDF BibTeX XML Cite \textit{A. Conte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 148, 15 p. (2016; Zbl 1388.68218) Full Text: DOI OpenURL
Yun, Unil; Lee, Gangin; Kim, Chul-Hong The smallest valid extension-based efficient, rare graph pattern mining, considering length-decreasing support constraints and symmetry characteristics of graphs. (English) Zbl 1373.05192 Symmetry 8, No. 5, Article ID 32, 26 p. (2016). MSC: 05C90 05C85 68T10 PDF BibTeX XML Cite \textit{U. Yun} et al., Symmetry 8, No. 5, Article ID 32, 26 p. (2016; Zbl 1373.05192) Full Text: DOI OpenURL
Liu, Fengchun; Wang, Liya; Liu, Baoxiang Efficient mining algorithm of \(K\)-densely probability attribute sub-graph in a complicated network. (Chinese. English summary) Zbl 1374.05207 J. Nat. Sci. Hunan Norm. Univ. 39, No. 4, 59-65 (2016). MSC: 05C82 05C85 05C42 PDF BibTeX XML Cite \textit{F. Liu} et al., J. Nat. Sci. Hunan Norm. Univ. 39, No. 4, 59--65 (2016; Zbl 1374.05207) Full Text: DOI OpenURL
Uno, Takeaki; Uno, Yushi Mining preserving structures in a graph sequence. (English) Zbl 1353.68218 Theor. Comput. Sci. 654, 155-163 (2016). MSC: 68R10 05C85 PDF BibTeX XML Cite \textit{T. Uno} and \textit{Y. Uno}, Theor. Comput. Sci. 654, 155--163 (2016; Zbl 1353.68218) Full Text: DOI OpenURL
Savas, Berkant; Dhillon, Inderjit S. Clustered matrix approximation. (English) Zbl 1349.15042 SIAM J. Matrix Anal. Appl. 37, No. 4, 1531-1555 (2016). MSC: 15A23 65F50 05C50 91D30 91C20 65F30 15A99 PDF BibTeX XML Cite \textit{B. Savas} and \textit{I. S. Dhillon}, SIAM J. Matrix Anal. Appl. 37, No. 4, 1531--1555 (2016; Zbl 1349.15042) Full Text: DOI OpenURL
Lyzinski, Vince; Levin, Keith; Fishkind, Donniell E.; Priebe, Carey E. On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching. (English) Zbl 1392.62189 J. Mach. Learn. Res. 17, Paper No. 179, 34 p. (2016). MSC: 62H30 05C82 62H12 PDF BibTeX XML Cite \textit{V. Lyzinski} et al., J. Mach. Learn. Res. 17, Paper No. 179, 34 p. (2016; Zbl 1392.62189) Full Text: arXiv Link OpenURL
Zhang, Junming; Li, Jinglin; Wang, Shangguang; Liu, Zhihan; Yuan, Quan; Yang, Fangchun Mining moving object gathering pattern method via spatio-temporal graph. (Chinese. English summary) Zbl 1363.68136 J. Softw. 27, No. 2, 348-362 (2016). MSC: 68T05 68T10 PDF BibTeX XML Cite \textit{J. Zhang} et al., J. Softw. 27, No. 2, 348--362 (2016; Zbl 1363.68136) Full Text: DOI OpenURL
Nourine, Lhouari; Petit, Jean-Marc Extended dualization: application to maximal pattern mining. (English) Zbl 1335.68081 Theor. Comput. Sci. 618, 107-121 (2016). MSC: 68P15 05C30 05C65 05C85 06A06 PDF BibTeX XML Cite \textit{L. Nourine} and \textit{J.-M. Petit}, Theor. Comput. Sci. 618, 107--121 (2016; Zbl 1335.68081) Full Text: DOI OpenURL
Saha, Tanay Kumar; Hasan, Mohammad Al \(Fs^3\): a sampling based method for top-\(K\) frequent subgraph mining. (English) Zbl 07260440 Stat. Anal. Data Min. 8, No. 4, 245-261 (2015). MSC: 62-XX 68-XX PDF BibTeX XML Cite \textit{T. K. Saha} and \textit{M. A. Hasan}, Stat. Anal. Data Min. 8, No. 4, 245--261 (2015; Zbl 07260440) Full Text: DOI arXiv OpenURL
Eustace, Justine; Wang, Xingyuan; Cui, Yaozu Community detection using local neighborhood in complex networks. (English) Zbl 1400.68154 Physica A 436, 665-677 (2015). MSC: 68R10 05C82 05C85 PDF BibTeX XML Cite \textit{J. Eustace} et al., Physica A 436, 665--677 (2015; Zbl 1400.68154) Full Text: DOI OpenURL
Yamaguchi, Fabian Pattern-based vulnerability discovery. (English) Zbl 1347.68002 Göttingen: Univ. Göttingen (Diss.). xiv, 137 p. (2015). MSC: 68-02 68N99 68T05 PDF BibTeX XML Cite \textit{F. Yamaguchi}, Pattern-based vulnerability discovery. Göttingen: Univ. Göttingen (Diss.) (2015; Zbl 1347.68002) Full Text: Link OpenURL
Zhao, Yuhai; Yin, Ying; Wang, Xue A graph compression based overlapping communities detection algorithm. (Chinese. English summary) Zbl 1349.91237 J. Northeast. Univ., Nat. Sci. 36, No. 11, 1543-1547 (2015). MSC: 91D30 05C82 PDF BibTeX XML Cite \textit{Y. Zhao} et al., J. Northeast. Univ., Nat. Sci. 36, No. 11, 1543--1547 (2015; Zbl 1349.91237) Full Text: DOI OpenURL
Gosnell, Denise K.; Berry, Michael W. Using semidiscrete decomposition and vector space models to identify users of social networks. (English) Zbl 1349.91225 Numer. Linear Algebra Appl. 22, No. 5, 833-844 (2015). MSC: 91D30 05C82 PDF BibTeX XML Cite \textit{D. K. Gosnell} and \textit{M. W. Berry}, Numer. Linear Algebra Appl. 22, No. 5, 833--844 (2015; Zbl 1349.91225) Full Text: DOI OpenURL
Kimelfeld, Benny; Kolaitis, Phokion G. The complexity of mining maximal frequent subgraphs. (English) Zbl 1474.68106 ACM Trans. Database Syst. 39, No. 4, Article No. 32, 33 p. (2014). MSC: 68P15 68Q25 68R10 PDF BibTeX XML Cite \textit{B. Kimelfeld} and \textit{P. G. Kolaitis}, ACM Trans. Database Syst. 39, No. 4, Article No. 32, 33 p. (2014; Zbl 1474.68106) Full Text: DOI OpenURL
Shi, Xiaoxiao; Paiement, Jean-francois; Grangier, David; Yu, Philip S. GbBC: gradient boosting consensus model for heterogeneous data. (English) Zbl 07260390 Stat. Anal. Data Min. 7, No. 3, 161-174 (2014). MSC: 62-XX 68-XX PDF BibTeX XML Cite \textit{X. Shi} et al., Stat. Anal. Data Min. 7, No. 3, 161--174 (2014; Zbl 07260390) Full Text: DOI OpenURL
Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng Release ‘bag-of-words’ assumption of latent Dirichlet allocation. (English) Zbl 1356.68251 Wen, Zhenkun (ed.) et al., Foundations of intelligent systems. Proceedings of the eighth international conference on intelligent systems and knowledge engineering, ISKE 2013, Shenzhen, China, November 20–23, 2013. 2 volume set. Berlin: Springer (ISBN 978-3-642-54923-6/pbk). Advances in Intelligent Systems and Computing 277, 83-92 (2014). MSC: 68T50 PDF BibTeX XML Cite \textit{J. Xuan} et al., Adv. Intell. Syst. Comput. 277, 83--92 (2014; Zbl 1356.68251) Full Text: DOI OpenURL
Shokry, M.; Mareay, R. Covering graph by upper and lower approximations operations. (English) Zbl 1323.94192 Information 17, No. 11(B), 5661-5675 (2014). MSC: 94C15 94A15 PDF BibTeX XML Cite \textit{M. Shokry} and \textit{R. Mareay}, Information 17, No. 11(B), 5661--5675 (2014; Zbl 1323.94192) OpenURL
Li, Tao; Xiao, Nanfeng A graph anomalies detection method based on graph similarity. (Chinese. English summary) Zbl 1313.68104 J. Xi’an Jiaotong Univ. 48, No. 8, 67-72, 79 (2014). MSC: 68T05 68R10 68T10 PDF BibTeX XML Cite \textit{T. Li} and \textit{N. Xiao}, J. Xi'an Jiaotong Univ. 48, No. 8, 67--72, 79 (2014; Zbl 1313.68104) OpenURL
Yuan, Chao; Chai, Yi A method for local community mining in the complex networks. (Chinese. English summary) Zbl 1313.68134 Acta Autom. Sin. 40, No. 5, 921-934 (2014). MSC: 68T05 05C82 68M11 91D30 PDF BibTeX XML Cite \textit{C. Yuan} and \textit{Y. Chai}, Acta Autom. Sin. 40, No. 5, 921--934 (2014; Zbl 1313.68134) OpenURL
Mandala, Supreet; Kumara, Soundar; Chatterjee, Kalyan A game-theoretic approach to graph clustering. (English) Zbl 1304.91051 INFORMS J. Comput. 26, No. 3, 629-643 (2014). MSC: 91A80 62H30 91A43 91A10 91D30 90C35 05C85 PDF BibTeX XML Cite \textit{S. Mandala} et al., INFORMS J. Comput. 26, No. 3, 629--643 (2014; Zbl 1304.91051) Full Text: DOI OpenURL
Han, Meng; Yan, Mingyuan; Li, Jinbao; Ji, Shouling; Li, Yingshu Neighborhood-based uncertainty generation in social networks. (English) Zbl 1314.90083 J. Comb. Optim. 28, No. 3, 561-576 (2014). MSC: 90C35 90B15 91D30 PDF BibTeX XML Cite \textit{M. Han} et al., J. Comb. Optim. 28, No. 3, 561--576 (2014; Zbl 1314.90083) Full Text: DOI OpenURL
Galbrun, Esther; Kimmig, Angelika Finding relational redescriptions. (English) Zbl 1317.68157 Mach. Learn. 96, No. 3, 225-248 (2014). MSC: 68T05 PDF BibTeX XML Cite \textit{E. Galbrun} and \textit{A. Kimmig}, Mach. Learn. 96, No. 3, 225--248 (2014; Zbl 1317.68157) Full Text: DOI Link OpenURL
Pajouh, Foad Mahdavi; Miao, Zhuqi; Balasundaram, Balabhaskar A branch-and-bound approach for maximum quasi-cliques. (English) Zbl 1296.90130 Ann. Oper. Res. 216, 145-161 (2014). MSC: 90C35 90C57 90C11 PDF BibTeX XML Cite \textit{F. M. Pajouh} et al., Ann. Oper. Res. 216, 145--161 (2014; Zbl 1296.90130) Full Text: DOI OpenURL
Boginski, Vladimir; Butenko, Sergiy; Shirokikh, Oleg; Trukhanov, Svyatoslav; Lafuente, Jaime Gil A network-based data mining approach to portfolio selection via weighted clique relaxations. (English) Zbl 1296.90015 Ann. Oper. Res. 216, 23-34 (2014). MSC: 90B10 90C27 91G10 PDF BibTeX XML Cite \textit{V. Boginski} et al., Ann. Oper. Res. 216, 23--34 (2014; Zbl 1296.90015) Full Text: DOI OpenURL
Simovici, Dan A.; Djeraba, Chabane Mathematical tools for data mining. Set theory, partial orders, combinatorics. 2nd ed. (English) Zbl 1303.68006 Advanced Information and Knowledge Processing. London: Springer (ISBN 978-1-4471-6406-7/hbk; 978-1-4471-6407-4/ebook). xi, 831 p. (2014). Reviewer: Udo Hahn (Jena) MSC: 68-01 00A06 03E20 05-01 06-01 15-01 28-01 54-01 68P01 68P05 68P15 68P20 68T05 PDF BibTeX XML Cite \textit{D. A. Simovici} and \textit{C. Djeraba}, Mathematical tools for data mining. Set theory, partial orders, combinatorics. 2nd ed. London: Springer (2014; Zbl 1303.68006) Full Text: DOI OpenURL
Johnson, Jesse Topological graph clustering with thin position. (English) Zbl 1302.68218 Geom. Dedicata 169, 165-173 (2014). MSC: 68R10 05C70 68T05 57M20 PDF BibTeX XML Cite \textit{J. Johnson}, Geom. Dedicata 169, 165--173 (2014; Zbl 1302.68218) Full Text: DOI arXiv OpenURL
Poelmans, Jonas; Ignatov, Dmitry I.; Kuznetsov, Sergei O.; Dedene, Guido Fuzzy and rough formal concept analysis: a survey. (English) Zbl 1286.93110 Int. J. Gen. Syst. 43, No. 2, 105-134 (2014). MSC: 93C42 94C15 93A10 PDF BibTeX XML Cite \textit{J. Poelmans} et al., Int. J. Gen. Syst. 43, No. 2, 105--134 (2014; Zbl 1286.93110) Full Text: DOI OpenURL
Shelokar, Prakash; Quirin, Arnaud; Cordón, Óscar Three-objective subgraph mining using multiobjective evolutionary programming. (English) Zbl 1311.68142 J. Comput. Syst. Sci. 80, No. 1, 16-26 (2014). MSC: 68T05 68T20 90C29 PDF BibTeX XML Cite \textit{P. Shelokar} et al., J. Comput. Syst. Sci. 80, No. 1, 16--26 (2014; Zbl 1311.68142) Full Text: DOI OpenURL
Malliaros, Fragkiskos D.; Vazirgiannis, Michalis Clustering and community detection in directed networks: a survey. (English) Zbl 1356.05151 Phys. Rep. 533, No. 4, 95-142 (2013). MSC: 05C90 05C20 05C82 PDF BibTeX XML Cite \textit{F. D. Malliaros} and \textit{M. Vazirgiannis}, Phys. Rep. 533, No. 4, 95--142 (2013; Zbl 1356.05151) Full Text: DOI arXiv OpenURL
Nettleton, David F. Data mining of social networks represented as graphs. (English) Zbl 1298.68046 Comput. Sci. Rev. 7, 1-34 (2013). MSC: 68M11 91D30 68M14 68T05 68T10 68-02 PDF BibTeX XML Cite \textit{D. F. Nettleton}, Comput. Sci. Rev. 7, 1--34 (2013; Zbl 1298.68046) Full Text: DOI OpenURL
Pears, Russel; Koh, Yun Sing; Dobbie, Gillian; Yeap, Wai Weighted association rule mining via a graph based connectivity model. (English) Zbl 1293.68237 Inf. Sci. 218, 61-84 (2013). MSC: 68T05 68R10 PDF BibTeX XML Cite \textit{R. Pears} et al., Inf. Sci. 218, 61--84 (2013; Zbl 1293.68237) Full Text: DOI OpenURL
Gao, Lin; Yang, Jianye; Qin, Guimin Methods for pattern mining in dynamic networks and applications. (Chinese. English summary) Zbl 1299.05292 J. Softw. 24, No. 9, 2042-2061 (2013). MSC: 05C82 91D30 92C42 68T10 68P05 05C90 PDF BibTeX XML Cite \textit{L. Gao} et al., J. Softw. 24, No. 9, 2042--2061 (2013; Zbl 1299.05292) Full Text: DOI OpenURL
Schietgat, Leander; Ramon, Jan; Bruynooghe, Maurice A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics. (English) Zbl 1357.68184 Ann. Math. Artif. Intell. 69, No. 4, 343-376 (2013). MSC: 68T05 05C85 68W40 92E10 PDF BibTeX XML Cite \textit{L. Schietgat} et al., Ann. Math. Artif. Intell. 69, No. 4, 343--376 (2013; Zbl 1357.68184) Full Text: DOI OpenURL
Livi, Lorenzo; Rizzi, Antonello Graph ambiguity. (English) Zbl 1284.68538 Fuzzy Sets Syst. 221, 24-47 (2013). MSC: 68T30 68R10 68T05 PDF BibTeX XML Cite \textit{L. Livi} and \textit{A. Rizzi}, Fuzzy Sets Syst. 221, 24--47 (2013; Zbl 1284.68538) Full Text: DOI Link OpenURL
Kibriya, Ashraf M.; Ramon, Jan Nearly exact mining of frequent trees in large networks. (English) Zbl 1281.68166 Data Min. Knowl. Discov. 27, No. 3, 478-504 (2013). MSC: 68R10 68T05 68M10 PDF BibTeX XML Cite \textit{A. M. Kibriya} and \textit{J. Ramon}, Data Min. Knowl. Discov. 27, No. 3, 478--504 (2013; Zbl 1281.68166) Full Text: DOI Link OpenURL
Wang, Yuyi; Ramon, Jan; Fannes, Thomas An efficiently computable subgraph pattern support measure: counting independent observations. (English) Zbl 1281.68197 Data Min. Knowl. Discov. 27, No. 3, 444-477 (2013). MSC: 68T05 68R10 90C05 PDF BibTeX XML Cite \textit{Y. Wang} et al., Data Min. Knowl. Discov. 27, No. 3, 444--477 (2013; Zbl 1281.68197) Full Text: DOI Link OpenURL
Han, Meng; Yan, Mingyuan; Li, Jinbao; Ji, Shouling; Li, Yingshu Generating uncertain networks based on historical network snapshots. (English) Zbl 1382.90020 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 19th international conference, COCOON 2013, Hangzhou, China, June 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38767-8/pbk). Lecture Notes in Computer Science 7936, 747-758 (2013). MSC: 90B10 05C72 68Q25 68T05 91D30 PDF BibTeX XML Cite \textit{M. Han} et al., Lect. Notes Comput. Sci. 7936, 747--758 (2013; Zbl 1382.90020) Full Text: DOI OpenURL
Garriga, Gemma C. Formal methods for mining structured objects. (English) Zbl 1280.68003 Studies in Computational Intelligence 475. Berlin: Springer (ISBN 978-3-642-36680-2/hbk; 978-3-642-36681-9/ebook). vi, 109 p. (2013). Reviewer: Daniele Mundici (Firenze) MSC: 68-02 68Txx 06-01 PDF BibTeX XML Cite \textit{G. C. Garriga}, Formal methods for mining structured objects. Berlin: Springer (2013; Zbl 1280.68003) Full Text: DOI OpenURL
David, J.; Nourine, L. A parameterizable enumeration algorithm for sequence mining. (English) Zbl 1259.68250 Theor. Comput. Sci. 468, 59-68 (2013). MSC: 68W32 68R15 PDF BibTeX XML Cite \textit{J. David} and \textit{L. Nourine}, Theor. Comput. Sci. 468, 59--68 (2013; Zbl 1259.68250) Full Text: DOI OpenURL
Li, Geng; Semerci, Murat; Yener, Bülent; Zaki, Mohammed J. Effective graph classification based on topological and label attributes. (English) Zbl 07260330 Stat. Anal. Data Min. 5, No. 4, 265-283 (2012). MSC: 62-XX 68-XX PDF BibTeX XML Cite \textit{G. Li} et al., Stat. Anal. Data Min. 5, No. 4, 265--283 (2012; Zbl 07260330) Full Text: DOI Link OpenURL
Tong, Hanghang; Lin, Ching-yung Non-negative residual matrix factorization: problem definition, fast solutions, and applications. (English) Zbl 07260309 Stat. Anal. Data Min. 5, No. 1, 3-15 (2012). MSC: 62-XX 68-XX PDF BibTeX XML Cite \textit{H. Tong} and \textit{C.-y. Lin}, Stat. Anal. Data Min. 5, No. 1, 3--15 (2012; Zbl 07260309) Full Text: DOI OpenURL
Batura, T. V. Methods of social network analysis. (English) Zbl 1374.91088 Jt. Bull. NCC IIS, Ser. Comput. Sci. 34, 55-72 (2012). MSC: 91D30 90C35 PDF BibTeX XML Cite \textit{T. V. Batura}, Jt. Bull. NCC IIS, Ser. Comput. Sci. 34, 55--72 (2012; Zbl 1374.91088) Full Text: Link OpenURL
Bartalos, István; Pluhár, András Communities and their role in small world graphs. (Hungarian) Zbl 1363.05242 Alkalmazott Mat. Lapok 29, 53-66 (2012). MSC: 05C85 05C90 PDF BibTeX XML Cite \textit{I. Bartalos} and \textit{A. Pluhár}, Alkalmazott Mat. Lapok 29, 53--66 (2012; Zbl 1363.05242) OpenURL