{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T21:18:23Z","timestamp":1768252703066,"version":"3.49.0"},"reference-count":34,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2022,8,19]],"date-time":"2022-08-19T00:00:00Z","timestamp":1660867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61966039"],"award-info":[{"award-number":["61966039"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Many similarity measure algorithms of nodes in weighted graph data have been proposed by employing the degree of nodes in recent years. Despite these algorithms obtaining great results, there may be still some limitations. For instance, the strength of nodes is ignored. Aiming at this issue, the relative entropy of the distance distribution based similarity measure of nodes is proposed in this paper. At first, the structural weights of nodes are given by integrating their degree and strength. Next, the distance between any two nodes is calculated with the help of their structural weights and the Euclidean distance formula to further obtain the distance distribution of each node. After that, the probability distribution of nodes is constructed by normalizing their distance distributions. Thus, the relative entropy can be applied to measure the difference between the probability distributions of the top d important nodes and all nodes in graph data. Finally, the similarity of two nodes can be measured in terms of this above-mentioned difference calculated by relative entropy. Experimental results demonstrate that the algorithm proposed by considering the strength of node in the relative entropy has great advantages in the most similar node mining and link prediction.<\/jats:p>","DOI":"10.3390\/e24081154","type":"journal-article","created":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T22:23:13Z","timestamp":1661120593000},"page":"1154","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Relative Entropy of Distance Distribution Based Similarity Measure of Nodes in Weighted Graph Data"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4442-5057","authenticated-orcid":false,"given":"Shihu","family":"Liu","sequence":"first","affiliation":[{"name":"School of Mathematics and Computer Science, Yunnan Minzu University, Kunming 650504, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0436-1116","authenticated-orcid":false,"given":"Yingjie","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computer Science, Yunnan Minzu University, Kunming 650504, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunsheng","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computer Science, Yunnan Minzu University, Kunming 650504, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Deng","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computer Science, Yunnan Minzu University, Kunming 650504, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,8,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.comcom.2015.07.002","article-title":"Uncovering the fingerprint of online social networks using a network motif based approach","volume":"73","author":"Topirceanu","year":"2016","journal-title":"Comput. Commun."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.coche.2019.08.004","article-title":"From database to knowledge graph-using data in chemistry","volume":"26","author":"Menon","year":"2019","journal-title":"Curr. Opin. Chem. Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1016\/j.trc.2017.09.020","article-title":"Adaptive traffic signal control with actor-critic methods in a real-world traffic network with different traffic disruption events","volume":"85","author":"Aslani","year":"2017","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Gatziolis, K.G., Tselikas, N.D., and Moscholios, I.D. (2022). Adaptive user profiling in E-commerce and administration of public services. Future Internet, 14.","DOI":"10.3390\/fi14050144"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Deng, L., Liu, S.H., and Duan, G.D. (2020, January 1\u20133). Random walk and shared neighbors-based similarity for patterns in graph data. Proceedings of the International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, Xi\u2019an, China.","DOI":"10.1007\/978-3-030-70665-4_141"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"116390","DOI":"10.1016\/j.eswa.2021.116390","article-title":"A fast algorithm for mining temporal association rules in a multi-attributed graph sequence","volume":"192","author":"Du","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Liu, B., Xu, S., Li, T., Xiao, J., and Xu, X.K. (2018). Quantifying the effects of topology and weight for link prediction in weighted complex networks. Entropy, 20.","DOI":"10.3390\/e20050363"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41109-017-0042-3","article-title":"Identifying network structure similarity using spectral graph theory","volume":"3","author":"Gera","year":"2018","journal-title":"Appl. Netw. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"104867","DOI":"10.1016\/j.cnsns.2019.104867","article-title":"Node similarity measuring in complex networks with relative entropy","volume":"78","author":"Wen","year":"2019","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"ref_10","first-page":"90","article-title":"Link predcition method based on topological stability of effective path","volume":"39","author":"Liu","year":"2022","journal-title":"Appl. Res. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2758","DOI":"10.1002\/int.22610","article-title":"Similarity-trust network for clustering-based consensus group decision-making model","volume":"37","author":"Ahlim","year":"2022","journal-title":"Int. J. Intell. Syst."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.patrec.2018.03.016","article-title":"Trends in graph-based representations for pattern recognition","volume":"134","author":"Brun","year":"2020","journal-title":"Pattern Recognit. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1504\/IJSSE.2020.105421","article-title":"On extending transitions logic in hybrid dynamic systems based on bond graph and Petri nets combination","volume":"10","author":"Bouhalouane","year":"2020","journal-title":"Int. J. Syst. Syst. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1109\/TPAMI.2019.2891742","article-title":"Visibility graphs for image processing","volume":"42","author":"Iacovacci","year":"2019","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2137","DOI":"10.3233\/JIFS-181452","article-title":"RSM index: A new way of link prediction in social networks","volume":"37","author":"Mahapatra","year":"2019","journal-title":"J. Intell. Fuzzy Syst."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","article-title":"Friends and neighbors on the web","volume":"25","author":"Adamic","year":"2003","journal-title":"Soc. Netw."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"58007","DOI":"10.1209\/0295-5075\/89\/58007","article-title":"Link prediction based on local random walk","volume":"89","author":"Liu","year":"2010","journal-title":"Europhys. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"046122","DOI":"10.1103\/PhysRevE.80.046122","article-title":"Similarity index based on local paths for link prediction of complex networks","volume":"80","author":"Jin","year":"2009","journal-title":"Phys. Rev. E"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TKDE.2007.46","article-title":"Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation","volume":"19","author":"Fouss","year":"2007","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ins.2019.09.017","article-title":"Return random walks for link prediction","volume":"510","author":"Curado","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Tan, F., Xia, Y.X., and Zhu, B.Y. (2014). Link prediction in complex networks: A mutual information perspective. PLoS ONE, 9.","DOI":"10.1371\/journal.pone.0107056"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Zhu, B.Y., and Xia, Y.X. (2016). Link prediction in weighted networks: A weighted mutual information model. PLoS ONE, 11.","DOI":"10.1371\/journal.pone.0148265"},{"key":"ref_23","first-page":"749","article-title":"Node similarity measure for complex networks","volume":"14","author":"Mu","year":"2020","journal-title":"J. Front. Comput. Sci. Technol."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1016\/j.physa.2017.09.042","article-title":"Measure the structure similarity of nodes in complex networks based on relative entropy","volume":"491","author":"Zhang","year":"2018","journal-title":"Phys. Stat. Mech. Its Appl."},{"key":"ref_25","first-page":"984","article-title":"A random walk similarity measure model based on relative entropy","volume":"55","author":"Zheng","year":"2019","journal-title":"J. Nanjing Univ. (Nat. Sci.)"},{"key":"ref_26","first-page":"012078","article-title":"Link prediction algorithm based on node structure similarity measured by relative entropy","volume":"1955","author":"Meng","year":"2021","journal-title":"J. Physics: Conf. Ser."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"32432","DOI":"10.1109\/ACCESS.2020.2971968","article-title":"Node similarity measure in directed weighted complex network based on node nearest neighbor local network relative weighted entropy","volume":"8","author":"Jiang","year":"2020","journal-title":"IEEE Access"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Li, X., Liu, S.X., Chen, H.C., and Wang, K. (2019). A potential information capacity index for link prediction of complex networks based on the cannikin law. Entropy, 21.","DOI":"10.3390\/e21090863"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1016\/j.ins.2022.07.030","article-title":"Link prediction algorithm based on the initial information contribution of nodes","volume":"608","author":"Liu","year":"2022","journal-title":"Inf. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Zhu, Y.H., Liu, S.X., Li, Y.L., and Li, H.T. (2022). TLP-CCC: Temporal link prediction based on collective community and centrality feature fusion. Entropy, 24.","DOI":"10.3390\/e24020296"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","article-title":"On information and sufficiency","volume":"22","author":"Kullback","year":"1951","journal-title":"Ann. Math. Stat."},{"key":"ref_32","unstructured":"Cover, T.M., and Thomas, J.A. (2020, June 16). Elements of Information Theory. Wiley-Interscience. Available online: http:\/\/library.lol\/main\/F84D706DD712F25317DF40949026F072."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"2050324","DOI":"10.1142\/S0217984920503248","article-title":"Predicting missing links in directed complex networks: A linear programming method","volume":"34","author":"Li","year":"2020","journal-title":"Mod. Phys. Lett. B"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1160","DOI":"10.1016\/j.isci.2019.07.043","article-title":"An algorithmic information calculus for causal discovery and reprogramming systems","volume":"19","author":"Zenil","year":"2019","journal-title":"Iscience"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/8\/1154\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:12:21Z","timestamp":1760141541000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/8\/1154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,19]]},"references-count":34,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2022,8]]}},"alternative-id":["e24081154"],"URL":"https:\/\/doi.org\/10.3390\/e24081154","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,19]]}}}