{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T17:25:55Z","timestamp":1767374755234},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T00:00:00Z","timestamp":1658361600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T00:00:00Z","timestamp":1658361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s13278-022-00918-4","type":"journal-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:04:45Z","timestamp":1658419485000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Link segmentation entropy for measuring the network complexity"],"prefix":"10.1007","volume":"12","author":[{"given":"Hadi","family":"Shakibian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nasrollah Moghadam","family":"Charkari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"issue":"3","key":"918_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"Lada A Adamic","year":"2003","unstructured":"Adamic Lada A, Adar Eytan (2003) Friends and neighbors on the web. Soc netw 25(3):211\u2013230","journal-title":"Soc netw"},{"issue":"1","key":"918_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-56847-4","volume":"10","author":"Iftikhar Ahmad","year":"2020","unstructured":"Ahmad Iftikhar et al (2020) Missing link prediction using common neighbor and centrality based parameterized algorithm. Sci rep 10(1):1\u20139","journal-title":"Sci rep"},{"issue":"1","key":"918_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R\u00e9ka Albert","year":"2002","unstructured":"Albert R\u00e9ka, Barab\u00e1si Albert-L\u00e1szl\u00f3 (2002) Statistical mechanics of complex networks. Reviews of modern physics 74(1):47","journal-title":"Reviews of modern physics"},{"key":"918_CR4","doi-asserted-by":"crossref","unstructured":"Anwar, Raheel, Muhammad Irfan Yousuf, and Muhammad Abid. (2021) Uniform Preferential Selection Model for Generating Scale-free Networks. Methodology and Computing in Applied Probability : 1-22","DOI":"10.1007\/s11009-021-09854-w"},{"key":"918_CR5","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.ins.2012.07.003","volume":"219","author":"Andr\u00e9 Ricardo Backes","year":"2013","unstructured":"Backes Andr\u00e9 Ricardo, Casanova Dalcimar, Bruno Odemir Martinez (2013) Texture analysis and classification: A complex network-based approach. Inform Sci 219:168\u2013180","journal-title":"Inform Sci"},{"issue":"3\u20134","key":"918_CR6","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/S0378-4371(02)00736-7","volume":"311","author":"Albert-Laszlo Barab\u00e2si","year":"2002","unstructured":"Barab\u00e2si Albert-Laszlo et al (2002) Evolution of the social network of scientific collaborations. Phys A: Stat mech its appl 311(3\u20134):590\u2013614","journal-title":"Phys A: Stat mech its appl"},{"key":"918_CR7","doi-asserted-by":"crossref","unstructured":"Bonchev, Danail, and Gregory A. Buck. 2005 Quantitative measures of network complexity. Complexity in chemistry biology and ecology. Springer Boston MA: 191-235","DOI":"10.1007\/0-387-25871-X_5"},{"key":"918_CR8","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.physa.2018.10.045","volume":"516","author":"Shuyu Duan","year":"2019","unstructured":"Duan Shuyu, Wen Tao, Jiang Wen (2019) A new information dimension of complex network based on R\u00e9nyi entropy. Phys A: Stat Mech its Appl 516:529\u2013542","journal-title":"Phys A: Stat Mech its Appl"},{"key":"918_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2021.111230","volume":"151","author":"Nasiri Elahe","year":"2021","unstructured":"Elahe Nasiri, Kamal Berahmand, Yuefeng Li (2021) A new link prediction in multiplex networks using topologically biased random walks. Chaos Solitons Fractals 151:111230","journal-title":"Chaos Solitons Fractals"},{"key":"918_CR10","doi-asserted-by":"crossref","unstructured":"Fan, Changjun, et al. 2019 Learning to identify high betweenness centrality nodes from scratch: A novel graph neural network approach. Proceedings of the 28th ACM International Conference on Information and Knowledge Management","DOI":"10.1145\/3357384.3357979"},{"issue":"01","key":"918_CR11","doi-asserted-by":"publisher","first-page":"1750032","DOI":"10.1142\/S0129065717500320","volume":"28","author":"Javier Gomez-Pilar","year":"2018","unstructured":"Gomez-Pilar Javier et al (2018) Quantification of graph complexity based on the edge weight distribution balance: application to brain networks. Int j neural syst 28(01):1750032","journal-title":"Int j neural syst"},{"issue":"1","key":"918_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41109-018-0108-x","volume":"4","author":"Alexander Goryashko","year":"2019","unstructured":"Goryashko Alexander, Samokhine Leonid, Bocharov Pavel (2019) About complexity of complex networks. Appl Net Sci 4(1):1\u201321","journal-title":"Appl Net Sci"},{"issue":"1","key":"918_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-016-0933-9","volume":"17","author":"Klaus Hahn","year":"2016","unstructured":"Hahn Klaus, Massopust Peter R, Prigarin Sergei (2016) A new method to measure complexity in binary or weighted networks and applications to functional connectivity in the human brain. BMC bioinform 17(1):1\u201318","journal-title":"BMC bioinform"},{"key":"918_CR14","first-page":"417","volume":"347","author":"Zhiming Huang","year":"2019","unstructured":"Huang Zhiming, Yang Lin, Jiang Wen (2019) Uncertainty measurement with belief entropy on the interference effect in the quantum-like Bayesian networks. Appl Math Comput 347:417\u2013428","journal-title":"Appl Math Comput"},{"key":"918_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.124289","volume":"553","author":"Ajay Kumar","year":"2020","unstructured":"Kumar Ajay et al (2020) Link prediction techniques, applications, and performance: A survey. Phys A: Stat Mech its Appl 553:124289","journal-title":"Phys A: Stat Mech its Appl"},{"key":"918_CR16","doi-asserted-by":"publisher","first-page":"159190","DOI":"10.1109\/ACCESS.2019.2950691","volume":"7","author":"Mingli Lei","year":"2019","unstructured":"Lei Mingli, Liu Lirong, Wei Daijun (2019) An improved method for measuring the complexity in complex networks based on structure entropy. IEEE Access 7:159190\u2013159198","journal-title":"IEEE Access"},{"issue":"11","key":"918_CR17","first-page":"2737","volume":"67","author":"Dan Lin","year":"2020","unstructured":"Lin Dan et al (2020) Modeling and understanding ethereum transaction records via a complex network approach. IEEE Transact Circuit Syst II Express Briefs 67(11):2737\u20132741","journal-title":"IEEE Transact Circuit Syst II Express Briefs"},{"issue":"4","key":"918_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.046122","volume":"80","author":"L\u00fc Linyuan","year":"2009","unstructured":"Linyuan L\u00fc, Ci-Hang Jin, Tao Zhou (2009) Similarity index based on local paths for link prediction of complex networks. Phys Rev E 80(4):046122","journal-title":"Phys Rev E"},{"key":"918_CR19","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.future.2019.12.022","volume":"105","author":"Tinghuai Ma","year":"2020","unstructured":"Ma Tinghuai et al (2020) LGIEM: Global and local node influence based community detection. Future Genera Comput Syst 105:533\u2013546","journal-title":"Future Genera Comput Syst"},{"issue":"1","key":"918_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-016-0028-x","volume":"7","author":"Cai Meng","year":"2017","unstructured":"Meng Cai, Ying Cui, Stanley H (2017) Eugene stanley analysis and evaluation of the entropy indices of a static network structure. Sci rep 7(1):1\u201310","journal-title":"Sci rep"},{"key":"918_CR21","doi-asserted-by":"crossref","unstructured":"Morzy, Miko\u0142aj, Tomasz Kajdanowicz, and Przemys\u0142aw Kazienko. (2017) On measuring the complexity of networks: Kolmogorov complexity versus entropy. Complexity 2017","DOI":"10.1155\/2017\/3250301"},{"key":"918_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.physa.2016.02.007","volume":"453","author":"Rajeev Rajaram","year":"2016","unstructured":"Rajaram Rajeev, Castellani Brian (2016) An entropy based measure for comparing distributions of complexity. Phys A: Stat Mech its Appl 453:35\u201343","journal-title":"Phys A: Stat Mech its Appl"},{"issue":"3","key":"918_CR23","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1016\/j.neuroimage.2009.10.003","volume":"52","author":"Mikail Rubinov","year":"2010","unstructured":"Rubinov Mikail, Sporns Olaf (2010) Complex network measures of brain connectivity: uses and interpretations. Neuroimage 52(3):1059\u20131069","journal-title":"Neuroimage"},{"key":"918_CR24","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.physa.2018.02.189","volume":"501","author":"Hadi Shakibian","year":"2018","unstructured":"Shakibian Hadi, Charkari Nasrollah Moghadam (2018) Statistical similarity measures for link prediction in heterogeneous complex networks. Phys a: Stat mech its appl 501:248\u2013263","journal-title":"Phys a: Stat mech its appl"},{"issue":"10","key":"918_CR25","doi-asserted-by":"publisher","first-page":"3411","DOI":"10.1007\/s10489-018-1157-7","volume":"48","author":"Hadi Shakibian","year":"2018","unstructured":"Shakibian Hadi, Charkari Nasrollah Moghadam, Jalili Saeed (2018) Multi-kernel one class link prediction in heterogeneous complex networks. Appl Intel 48(10):3411\u20133428","journal-title":"Appl Intel"},{"issue":"1","key":"918_CR26","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.physa.2007.05.065","volume":"386","author":"Robert Sneddon","year":"2007","unstructured":"Sneddon Robert (2007) The tsallis entropy of natural information. Phys A: Stat Mech its Appl 386(1):101\u2013118","journal-title":"Phys A: Stat Mech its Appl"},{"key":"918_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.121054","volume":"526","author":"Wen Tao","year":"2019","unstructured":"Tao Wen, Wen Jiang (2019) Measuring the complexity of complex network by Tsallis entropy. Phys A: Stat Mech its Appl 526:121054","journal-title":"Phys A: Stat Mech its Appl"},{"issue":"2","key":"918_CR28","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.physa.2005.08.025","volume":"363","author":"Bing Wang","year":"2006","unstructured":"Wang Bing et al (2006) Entropy optimization of scale-free networks\u2019 robustness to random failures. Phys A: Stat Mech its Appl 363(2):591\u2013596","journal-title":"Phys A: Stat Mech its Appl"},{"issue":"4","key":"918_CR29","doi-asserted-by":"publisher","first-page":"3718","DOI":"10.3934\/mbe.2021187","volume":"18","author":"Bing Wang","year":"2021","unstructured":"Wang Bing et al (2021) A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes. Math Biosci Eng 18(4):3718\u20133732","journal-title":"Math Biosci Eng"},{"key":"918_CR30","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.physa.2018.02.067","volume":"501","author":"Tao Wen","year":"2018","unstructured":"Wen Tao, Jiang Wen (2018) An information dimension of weighted complex networks. Phys A: Stat Mech its Appl 501:388\u2013399","journal-title":"Phys A: Stat Mech its Appl"},{"key":"918_CR31","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.ins.2012.07.049","volume":"222","author":"Yue Wu","year":"2013","unstructured":"Wu Yue et al (2013) Local shannon entropy measure with statistical tests for image randomness. Inform Sci 222:323\u2013342","journal-title":"Inform Sci"},{"key":"918_CR32","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.physa.2018.05.067","volume":"508","author":"Likang Yin","year":"2018","unstructured":"Yin Likang, Deng Yong (2018) Toward uncertainty of weighted networks: An entropy-based model. Phys A: Stat Mech its Appl 508:176\u2013186","journal-title":"Phys A: Stat Mech its Appl"},{"issue":"8","key":"918_CR33","doi-asserted-by":"publisher","first-page":"551","DOI":"10.3390\/e20080551","volume":"20","author":"Hector Zenil","year":"2018","unstructured":"Zenil Hector, Kiani Narsis A, Tegn\u00e9r Jesper (2018) A review of graph and network complexity from an algorithmic information perspective. Entropy 20(8):551","journal-title":"Entropy"},{"issue":"10","key":"918_CR34","doi-asserted-by":"publisher","first-page":"1650118","DOI":"10.1142\/S0129183116501187","volume":"27","author":"Qi Zhang","year":"2016","unstructured":"Zhang Qi, Li Meizhu, Deng Yong (2016) A new structure entropy of complex networks based on nonextensive statistical mechanics. Int J Mod Phys C 27(10):1650118","journal-title":"Int J Mod Phys C"},{"key":"918_CR35","unstructured":"Zhang, Qi, Meizhu Li, and Yong Deng. (2014) A betweenness structure entropy of complex networks. arXiv preprint arXiv:1407.0097"},{"issue":"4","key":"918_CR36","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"Tao Zhou","year":"2009","unstructured":"Zhou Tao, L\u00fa Linyuan, Zhang Yi-Cheng (2009) Predicting missing links via local information. Europ Phys J B 71(4):623\u2013630","journal-title":"Europ Phys J B"},{"key":"918_CR37","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.physa.2018.02.138","volume":"501","author":"Qian Zhu","year":"2018","unstructured":"Zhu Qian et al (2018) Optimization of cascading failure on complex network based on NNIA. Phys A: Stat Mech its Appl 501:42\u201351","journal-title":"Phys A: Stat Mech its Appl"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-022-00918-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-022-00918-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-022-00918-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T14:14:15Z","timestamp":1672668855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-022-00918-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,21]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["918"],"URL":"https:\/\/doi.org\/10.1007\/s13278-022-00918-4","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,21]]},"assertion":[{"value":"9 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"85"}}