{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:28:43Z","timestamp":1725460123724},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341656"},{"type":"electronic","value":"9783642341663"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34166-3_21","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T09:27:14Z","timestamp":1350898034000},"page":"190-198","source":"Crossref","is-referenced-by-count":5,"title":["Heat Flow-Thermodynamic Depth Complexity in Directed Networks"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Escolano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boyan","family":"Bonev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-297-9","volume-title":"Information Theory in Computer Vision and Pattern Recognition","author":"F. Escolano","year":"2009","unstructured":"Escolano, F., Suau, P., Bonev, B.: Information Theory in Computer Vision and Pattern Recognition. Springer, London (2009)"},{"issue":"6","key":"21_CR2","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TPAMI.2006.125","volume":"28","author":"A. Torsello","year":"2006","unstructured":"Torsello, A., Hancock, E.R.: Learning Shape-Classes Using a Mixture of Tree-Unions. IEEE Tran. on Pattern Analysis and Mach. Intelligence\u00a028(6), 954\u2013967 (2006)","journal-title":"IEEE Tran. on Pattern Analysis and Mach. Intelligence"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Torsello, A., Lowe, D.L.: Supervised Learning of a Generative Model for Edge-Weighted Graphs. In: Proc. of ICPR (2008)","DOI":"10.1109\/ICPR.2008.4761285"},{"key":"21_CR4","unstructured":"K\u00f6rner, J.: Coding of an Information Source Having Ambiguous Alphabet and the Entropy of Graphs. In: Transactions of of the 6th Prague Conference on Information Theory, pp. 411\u2013425 (1973)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Passerini, F., Severini, S.: The von Neumann Entropy of Networks. arXiv:0812.2597v1 (December 2008)","DOI":"10.2139\/ssrn.1382662"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Han, L., Escolano, F., Hancock, E.R., Wilson, R.: Graph Characterizations From Von Neumann Entropy. Pattern Recognition Letters (in press, 2012)","DOI":"10.1016\/j.patrec.2012.03.016"},{"issue":"4-5","key":"21_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/S0375-9601(97)00855-4","volume":"238","author":"D.P. Feldman","year":"1998","unstructured":"Feldman, D.P., Crutchfield, J.P.: Measures of Statistical Complexity: Why? Physics Letters A\u00a0238(4-5), 244\u2013252 (1998)","journal-title":"Physics Letters A"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"66102","DOI":"10.1103\/PhysRevE.82.066102","volume":"82","author":"E. Estrada","year":"2010","unstructured":"Estrada, E.: Quantifying Network Heterogeneity. Phys. Rev. E\u00a082, 066102 (2010)","journal-title":"Phys. Rev. E"},{"issue":"23","key":"21_CR9","doi-asserted-by":"publisher","first-page":"6609","DOI":"10.1021\/ja00856a001","volume":"97","author":"M. Randi\u0107","year":"1975","unstructured":"Randi\u0107, M.: Characterization of Molecular Branching. Journal of the American Chemical Society\u00a097(23), 6609\u20136615 (1975)","journal-title":"Journal of the American Chemical Society"},{"key":"21_CR10","first-page":"186","volume":"188","author":"S. Lloyd","year":"1988","unstructured":"Lloyd, S., Pagels, H.: Complexity as Thermodynamic Depth Ann. Phys.\u00a0188, 186 (1988)","journal-title":"Phys."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"36206","DOI":"10.1103\/PhysRevE.85.036206","volume":"85","author":"F. Escolano","year":"2012","unstructured":"Escolano, F., Hancock, E.R., Lozano, M.A.: Heat Diffusion: Thermodynamic Depth Complexity of Networks. Phys. Rev. E\u00a085, 036206 (2012)","journal-title":"Phys. Rev. E"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-14980-1_27","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"F. Escolano","year":"2010","unstructured":"Escolano, F., Lozano, M.A., Hancock, E.R., Giorgi, D.: What Is the Complexity of a Network? The Heat Flow-Thermodynamic Depth Approach. In: Hancock, E.R., Wilson, R.C., Windeatt, T., Ulusoy, I., Escolano, F. (eds.) SSPR&SPR 2010. LNCS, vol.\u00a06218, pp. 286\u2013295. Springer, Heidelberg (2010)"},{"key":"21_CR13","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bring Order to the Web (Technical Report). Stanford University (1998)"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-005-0237-z","volume":"9","author":"F. Chung","year":"2005","unstructured":"Chung, F.: Laplacians and the Cheeger Inequailty for Directed Graphs. Annals of Combinatorics\u00a09, 1\u201319 (2005)","journal-title":"Annals of Combinatorics"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Johns, J., Mahadevan, S.: Constructing Basic Functions from Directed Graphs for Value Functions Approximation. In: Proc. of ICML (2007)","DOI":"10.1145\/1273496.1273545"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning from Labeled and Unlabeled Data on a Directed Graph. In: Proc. of ICML (2005)","DOI":"10.1145\/1102351.1102482"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Brasseur, C.E., Grady, R.E., Prassidis, S.: Coverings, Laplacians and Heat Kernels of Directed Graphs. Electr. J. Comb 01\/2009\u00a016(1) (2009)","DOI":"10.37236\/120"},{"key":"21_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/11564096_65","volume-title":"Machine Learning: ECML 2005","author":"R. Nock","year":"2005","unstructured":"Nock, R., Nielsen, F.: Fitting Smallest Enclosing Bregman Ball. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol.\u00a03720, pp. 649\u2013656. Springer, Heidelberg (2005)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Tsang, I.W., Kocsor, A., Kwok, J.T.: Simple Core Vector Machines with Enclosing Balls. In: Proc. of ICLM (2007)","DOI":"10.1145\/1273496.1273611"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34166-3_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:46:36Z","timestamp":1620132396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34166-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341656","9783642341663"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34166-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}