{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T07:25:51Z","timestamp":1767770751862,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":71,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,24]],"date-time":"2008-08-24T00:00:00Z","timestamp":1219536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,8,24]]},"DOI":"10.1145\/1401890.1401984","type":"proceedings-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T11:56:41Z","timestamp":1219838201000},"page":"785-793","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances"],"prefix":"10.1145","author":[{"given":"Luh","family":"Yen","sequence":"first","affiliation":[{"name":"Universite catholique de Louvain, Louvain-La-Neuve, Belgium"}]},{"given":"Marco","family":"Saerens","sequence":"additional","affiliation":[{"name":"Universite catholique de Louvain, Louvain-La-Neuve, Belgium"}]},{"given":"Amin","family":"Mantrach","sequence":"additional","affiliation":[{"name":"Universite Libre de Bruxelles, Bruxelles, Belgium"}]},{"given":"Masashi","family":"Shimbo","sequence":"additional","affiliation":[{"name":"Nara Institute of Science and Technology, Nara, Japan"}]}],"member":"320","published-online":{"date-parts":[[2008,8,24]]},"reference":[{"issue":"9","key":"e_1_3_2_1_1_1","first-page":"1424","article-title":"The Matrix of Maximum Out Forests of a Digraph and Its Applications","volume":"61","author":"Agaev R.","year":"2000","unstructured":"R. Agaev and P. Chebotarev . The Matrix of Maximum Out Forests of a Digraph and Its Applications . Automation and Remote Control , 61 ( 9 ): 1424 -- 1450 , 2000 . R. Agaev and P. Chebotarev. The Matrix of Maximum Out Forests of a Digraph and Its Applications. Automation and Remote Control, 61(9):1424--1450, 2000.","journal-title":"Automation and Remote Control"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1002862312617"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(96)00003-3"},{"key":"e_1_3_2_1_4_1","first-page":"87","article-title":"Resistance distance in graphs","volume":"68","author":"Bapat R. B.","year":"1999","unstructured":"R. B. Bapat . Resistance distance in graphs . The Mathematics Student , 68 : 87 -- 98 , 1999 . R. B. Bapat. Resistance distance in graphs. The Mathematics Student, 68:87--98, 1999.","journal-title":"The Mathematics Student"},{"key":"e_1_3_2_1_5_1","volume-title":"Dynamic Programming and Optimal Control","author":"Bertsekas D. P.","year":"2000","unstructured":"D. P. Bertsekas . Dynamic Programming and Optimal Control . Athena Scientific , 2000 . D. P. Bertsekas. Dynamic Programming and Optimal Control. Athena Scientific, 2000."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502415960"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2711-1","volume-title":"Modern multidimensional scaling: Theory and applications","author":"Borg I.","year":"1997","unstructured":"I. Borg and P. Groenen . Modern multidimensional scaling: Theory and applications . Springer , 1997 . I. Borg and P. Groenen. Modern multidimensional scaling: Theory and applications. Springer, 1997."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73062"},{"issue":"9","key":"e_1_3_2_1_11_1","first-page":"1505","article-title":"The matrix-forest theorem and measuring relations in small social groups","volume":"58","author":"Chebotarev P.","year":"1997","unstructured":"P. Chebotarev and E. Shamis . The matrix-forest theorem and measuring relations in small social groups . Automation and Remote Control , 58 ( 9 ): 1505 -- 1514 , 1997 . P. Chebotarev and E. Shamis. The matrix-forest theorem and measuring relations in small social groups. Automation and Remote Control, 58(9):1505--1514, 1997.","journal-title":"Automation and Remote Control"},{"issue":"10","key":"e_1_3_2_1_12_1","first-page":"1443","article-title":"On proximity measures for graph vertices","volume":"59","author":"Chebotarev P.","year":"1998","unstructured":"P. Chebotarev and E. Shamis . On proximity measures for graph vertices . Automation and Remote Control , 59 ( 10 ): 1443 -- 1459 , 1998 . P. Chebotarev and E. Shamis. On proximity measures for graph vertices. Automation and Remote Control, 59(10):1443--1459, 1998.","journal-title":"Automation and Remote Control"},{"key":"e_1_3_2_1_13_1","first-page":"2707","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)","author":"Chen T.","year":"2007","unstructured":"T. Chen and Q. Yang and X. Tang . Directed graph embedding . Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) , pages 2707 -- 2712 , 2007 . T. Chen and Q. Yang and X. Tang. Directed graph embedding. Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 2707--2712, 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-005-0237-z"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1050985"},{"key":"e_1_3_2_1_16_1","volume-title":"Elements of Information Theory","author":"Cover T.","year":"2006","unstructured":"T. Cover and J. Thomas . Elements of Information Theory , 2 nd ed. Wiley and Sons , 2006 . T. Cover and J. Thomas. Elements of Information Theory, 2nd ed. Wiley and Sons, 2006.","edition":"2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/993663"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.18"},{"key":"e_1_3_2_1_20_1","volume-title":"Random walks on graphs. Stochastic Processes and their Applications, 2:311--336","author":"Gobel F.","year":"1974","unstructured":"F. Gobel and A. A. Jagers . Random walks on graphs. Stochastic Processes and their Applications, 2:311--336 , 1974 . F. Gobel and A. A. Jagers. Random walks on graphs. Stochastic Processes and their Applications, 2:311--336, 1974."},{"key":"e_1_3_2_1_21_1","volume-title":"Matrix Computations","author":"Golub G. H.","year":"1996","unstructured":"G. H. Golub and C. F. V. Loan . Matrix Computations , 3 th Ed. The Johns Hopkins University Press , 1996 . G. H. Golub and C. F. V. Loan. Matrix Computations, 3th Ed. The Johns Hopkins University Press, 1996.","edition":"3"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Gori M.","year":"2006","unstructured":"M. Gori and A. Pucci . A random-walk based scoring algorithm with application to recommender systems for large-scale e-commerce . Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2006 . M. Gori and A. Pucci. A random-walk based scoring algorithm with application to recommender systems for large-scale e-commerce. Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015417"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/646839.708660"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081941"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.106.620"},{"key":"e_1_3_2_1_27_1","first-page":"657","volume-title":"Advances in Neural Information Processing Systems (NIPS) 15","author":"Kandola J.","year":"2002","unstructured":"J. Kandola , N. Cristianini , and J. Shawe-Taylor . Learning semantic similarity . Advances in Neural Information Processing Systems (NIPS) 15 , pages 657 -- 664 , 2002 . J. Kandola, N. Cristianini, and J. Shawe-Taylor. Learning semantic similarity. Advances in Neural Information Processing Systems (NIPS) 15, pages 657--664, 2002."},{"key":"e_1_3_2_1_28_1","volume-title":"Snell Finite Markov Chains","author":"Kemeny J.","year":"1976","unstructured":"J. Kemeny and L. Snell Finite Markov Chains . Springer-Verlag , 1976 . J. Kemeny and L. Snell Finite Markov Chains. Springer-Verlag, 1976."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.5090140103"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01164627"},{"key":"e_1_3_2_1_31_1","first-page":"315","volume-title":"Proceedings of the 19th International Conference on Machine Learning","author":"Kondor R. I.","year":"2002","unstructured":"R. I. Kondor and J. Lafferty . Diffusion kernels on graphs and other discrete structures . Proceedings of the 19th International Conference on Machine Learning , pages 315 -- 322 , 2002 . R. I. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete structures. Proceedings of the 19th International Conference on Machine Learning, pages 315--322, 2002."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150432"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297332.1297336"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.184"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830329","volume-title":"Google's PageRank and Beyond: The Science of Search Engine Rankings","author":"Langville A. N.","year":"2006","unstructured":"A. N. Langville and C. D. Meyer . Google's PageRank and Beyond: The Science of Search Engine Rankings . Princeton University Press , 2006 . A. N. Langville and C. D. Meyer. Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, 2006."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"e_1_3_2_1_37_1","volume-title":"Random walks on graphs: A survey. Combinatorics: Paul Erdos is eighty, 2:353--397","author":"Lovasz L.","year":"1996","unstructured":"L. Lovasz . Random walks on graphs: A survey. Combinatorics: Paul Erdos is eighty, 2:353--397 , 1996 . L. Lovasz. Random walks on graphs: A survey. Combinatorics: Paul Erdos is eighty, 2:353--397, 1996."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-006-0023-9"},{"key":"e_1_3_2_1_39_1","first-page":"955","volume-title":"Advances in Neural Information Processing Systems (NIPS) 18","author":"Nadler B.","year":"2005","unstructured":"B. Nadler , S. Lafon , R. Coifman , and I. Kevrekidis . Diffusion maps, spectral clustering and eigenfunctions of Fokker-Planck operators . Advances in Neural Information Processing Systems (NIPS) 18 , pages 955 -- 962 , 2005 . B. Nadler, S. Lafon, R. Coifman, and I. Kevrekidis. Diffusion maps, spectral clustering and eigenfunctions of Fokker-Planck operators. Advances in Neural Information Processing Systems (NIPS) 18, pages 955--962, 2005."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2005.07.004"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.009"},{"key":"e_1_3_2_1_42_1","volume-title":"Princeton University Press","author":"Newman M.","year":"2006","unstructured":"M. Newman . The structure and dynamics of networks . Princeton University Press , 2006 . M. Newman. The structure and dynamics of networks. Princeton University Press, 2006."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760894.1760959"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014135"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00124"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5244\/C.19.94"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1103"},{"key":"e_1_3_2_1_49_1","volume-title":"Fundamentals of speech recognition","author":"Rabiner L.","year":"1993","unstructured":"L. Rabiner and B.-H. Juang . Fundamentals of speech recognition . Prentice Hall , 1993 . L. Rabiner and B.-H. Juang. Fundamentals of speech recognition. Prentice Hall, 1993."},{"key":"e_1_3_2_1_50_1","volume-title":"L. Reichl. A modern course in statistical physics","year":"1998","unstructured":"L. Reichl. A modern course in statistical physics , 2 nd ed. Wiley , 1998 . L. Reichl. A modern course in statistical physics, 2nd ed. Wiley, 1998.","edition":"2"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511610912"},{"key":"e_1_3_2_1_52_1","volume-title":"Randomized shortest-path problems: Two seemingly unrelated problems. Manuscript submitted for publication","author":"Saerens M.","year":"2007","unstructured":"M. Saerens , Y. Achbany , F. Fouss , and L. Yen . Randomized shortest-path problems: Two seemingly unrelated problems. Manuscript submitted for publication , 2007 . M. Saerens, Y. Achbany, F. Fouss, and L. Yen. Randomized shortest-path problems: Two seemingly unrelated problems. Manuscript submitted for publication, 2007."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30115-8_35"},{"key":"e_1_3_2_1_54_1","volume-title":"Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence (UAI)","author":"Sarkar P.","year":"2007","unstructured":"P. Sarkar and A. Moore . A tractable approach to finding closest truncated-commute-time neighbors in large graphs . Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence (UAI) , 2007 . P. Sarkar and A. Moore. A tractable approach to finding closest truncated-commute-time neighbors in large graphs. Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence (UAI), 2007."},{"key":"e_1_3_2_1_55_1","volume-title":"Statistical thermodynamics","author":"Schrodinger E.","year":"1952","unstructured":"E. Schrodinger . Statistical thermodynamics , 2 nd ed. Cambridge University Press , 1952 . E. Schrodinger. Statistical thermodynamics, 2nd ed. Cambridge University Press, 1952.","edition":"2"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/975545"},{"key":"e_1_3_2_1_57_1","first-page":"283","volume-title":"John Wiley & Sons","author":"Shimbo M.","year":"2006","unstructured":"M. Shimbo and T. Ito . Kernels as link analysis measures. In Mining Graph Data, D. Cook and L. Holder (editors) . John Wiley & Sons , pages 283 -- 310 , 2006 . M. Shimbo and T. Ito. Kernels as link analysis measures. In Mining Graph Data, D. Cook and L. Holder (editors). John Wiley & Sons, pages 283--310, 2006."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630240406"},{"key":"e_1_3_2_1_59_1","first-page":"144","volume-title":"Proceedings of the Conference on Learning Theory (COLT)","author":"Smola A. J.","year":"2003","unstructured":"A. J. Smola and R. Kondor . Kernels and regularization on graphs. In M. Warmuth and B. Sch\u00f6lkopf, editors , Proceedings of the Conference on Learning Theory (COLT) , pages 144 -- 158 , 2003 . A. J. Smola and R. Kondor. Kernels and regularization on graphs. In M. Warmuth and B. Sch\u00f6lkopf, editors, Proceedings of the Conference on Learning Theory (COLT), pages 144--158, 2003."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377308"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0094-2"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281272"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956782"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764441.1764561"},{"key":"e_1_3_2_1_66_1","volume-title":"Link-based community detection based on the sigmoid commute-time kernel. Manuscript submitted for publication","author":"Yen L.","year":"2008","unstructured":"L. Yen , F. Fouss , C. Decaestecker , P. Francq , and M. Saerens . Link-based community detection based on the sigmoid commute-time kernel. Manuscript submitted for publication , 2008 . L. Yen, F. Fouss, C. Decaestecker, P. Francq, and M. Saerens. Link-based community detection based on the sigmoid commute-time kernel. Manuscript submitted for publication, 2008."},{"key":"e_1_3_2_1_67_1","first-page":"317","volume-title":"Proceedings of the 13th European Symposium on Artificial Neural Networks (ESANN2005)","author":"Yen L.","year":"2005","unstructured":"L. Yen , D. Vanvyve , F. Wouters , F. Fouss , M. Verleysen , and M. Saerens . Clustering using a random walk-based distance measure . In Proceedings of the 13th European Symposium on Artificial Neural Networks (ESANN2005) , pages 317 -- 324 , 2005 . L. Yen, D. Vanvyve, F. Wouters, F. Fouss, M. Verleysen, and M. Saerens. Clustering using a random walk-based distance measure. In Proceedings of the 13th European Symposium on Artificial Neural Networks (ESANN2005), pages 317--324, 2005."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408854"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102482"},{"issue":"061901","key":"e_1_3_2_1_70_1","article-title":"and network community structure","volume":"67","author":"Zhou H.","year":"2003","unstructured":"H. Zhou . Distance, dissimilarity index , and network community structure . Physical Review E , 67 ( 061901 ), 2003 . H. Zhou. Distance, dissimilarity index, and network community structure. Physical Review E, 67(061901), 2003.","journal-title":"Physical Review E"},{"issue":"041908","key":"e_1_3_2_1_71_1","article-title":"Network landscape from a Brownian particle perspective","volume":"67","author":"Zhou H.","year":"2003","unstructured":"H. Zhou . Network landscape from a Brownian particle perspective . Physical Review E , 67 ( 041908 ), 2003 . H. Zhou. Network landscape from a Brownian particle perspective. Physical Review E, 67(041908), 2003.","journal-title":"Physical Review E"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.7551\/mitpress\/6173.003.0021","volume-title":"Semi-supervised learning","author":"Zhu X.","year":"2006","unstructured":"X. Zhu , J. Kandola , J. Lafferty , and Z. Ghahramani . Graph kernels by spectral transforms . In Semi-supervised learning , O. Chapelle, B. Sch\u00f6lkopf and A. Zien (editors), pages 277 -- 291 . MIT Press , 2006 . X. Zhu, J. Kandola, J. Lafferty, and Z. Ghahramani. Graph kernels by spectral transforms. In Semi-supervised learning, O. Chapelle, B. Sch\u00f6lkopf and A. Zien (editors), pages 277--291. MIT Press, 2006."}],"event":{"name":"KDD08: The 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"],"location":"Las Vegas Nevada USA","acronym":"KDD08"},"container-title":["Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401984","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1401890.1401984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:58:05Z","timestamp":1750255085000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401984"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,24]]},"references-count":71,"alternative-id":["10.1145\/1401890.1401984","10.1145\/1401890"],"URL":"https:\/\/doi.org\/10.1145\/1401890.1401984","relation":{},"subject":[],"published":{"date-parts":[[2008,8,24]]},"assertion":[{"value":"2008-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}