{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:09:09Z","timestamp":1743044949209,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030140847"},{"type":"electronic","value":"9783030140854"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14085-4_12","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"143-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A New Entropy for Hypergraphs"],"prefix":"10.1007","author":[{"given":"Isabelle","family":"Bloch","sequence":"first","affiliation":[]},{"given":"Alain","family":"Bretto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.patcog.2016.01.004","volume":"54","author":"L Bai","year":"2016","unstructured":"Bai, L., Escolano, F., Hancock, E.R.: Depth-based hypergraph complexity traces from directed line graphs. Pattern Recogn. 54, 229\u2013240 (2016)","journal-title":"Pattern Recogn."},{"key":"12_CR2","series-title":"NATO ASI Series (Series C: Mathematical and Physical Sciences)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-94-015-8439-5_1","volume-title":"Real and Complex Dynamical Systems","author":"V Baladi","year":"1995","unstructured":"Baladi, V.: Dynamical zeta functions. In: Branner, B., Hjorth, P. (eds.) Real and Complex Dynamical Systems. NATO ASI Series (Series C: Mathematical and Physical Sciences), vol. 464, pp. 1\u201326. Springer, Dordrecht (1995). https:\/\/doi.org\/10.1007\/978-94-015-8439-5_1"},{"key":"12_CR3","volume-title":"Hypergraphs","author":"C Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs. Elsevier Science Publisher, The Netherlands (1989)"},{"key":"12_CR4","volume-title":"Lattice Theory","author":"G Birkho","year":"1979","unstructured":"Birkho, G.: Lattice Theory, vol. 25, 3rd edn. American Mathematical Society, Providence (1979)","edition":"3"},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.cviu.2012.10.013","volume":"117","author":"I Bloch","year":"2013","unstructured":"Bloch, I., Bretto, A.: Mathematical morphology on hypergraphs, application to similarity and positive kernel. Comput. Vis. Image Underst. 117(4), 342\u2013354 (2013)","journal-title":"Comput. Vis. Image Underst."},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.dam.2014.08.013","volume":"183","author":"I Bloch","year":"2015","unstructured":"Bloch, I., Bretto, A., Leborgne, A.: Robust similarity between hypergraphs based on valuations and mathematical morphology operators. Discrete Appl. Math. 183, 2\u201319 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00026-006-0289-3","volume":"10","author":"SL Braunstein","year":"2006","unstructured":"Braunstein, S.L., Ghosh, S., Severini, S.: The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states. Ann. Comb. 10(3), 291\u2013317 (2006)","journal-title":"Ann. Comb."},{"key":"12_CR8","series-title":"Mathematical Engineering","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0","volume-title":"Hypergraph Theory: An Introduction","author":"A Bretto","year":"2013","unstructured":"Bretto, A.: Hypergraph Theory: An Introduction. Mathematical Engineering. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-3-319-00080-0"},{"key":"12_CR9","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, Hoboken (2012)"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ins.2010.08.041","volume":"181","author":"M Dehmer","year":"2011","unstructured":"Dehmer, M., Mowshowitz, A.: A history of graph entropy measures. Inf. Sci. 181(1), 57\u201378 (2011)","journal-title":"Inf. Sci."},{"issue":"15","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1958","DOI":"10.1016\/j.patrec.2012.03.016","volume":"33","author":"L Han","year":"2012","unstructured":"Han, L., Escolano, F., Hancock, E.R., Wilson, R.C.: Graph characterizations from von Neumann entropy. Pattern Recogn. Lett. 33(15), 1958\u20131967 (2012)","journal-title":"Pattern Recogn. Lett."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.dam.2018.04.004","volume":"247","author":"H Lin","year":"2018","unstructured":"Lin, H., Zhou, B.: On the von Neumann entropy of a graph. Discrete Appl. Math. 247, 448\u2013455 (2018)","journal-title":"Discrete Appl. Math."},{"key":"12_CR13","volume-title":"Mathematische Grundlagen der Quantenmechanik","author":"J von Neumann","year":"1955","unstructured":"von Neumann, J.: Mathematische Grundlagen der Quantenmechanik, vol. 38. Springer, New york (1955)"},{"issue":"11","key":"12_CR14","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1142\/S0217984907013146","volume":"21","author":"O Shanker","year":"2007","unstructured":"Shanker, O.: Graph zeta function and dimension of complex network. Mod. Phys. Lett. B 21(11), 639\u2013644 (2007)","journal-title":"Mod. Phys. Lett. B"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Simovici, D.: Betweenness, metrics and entropies in lattices. In: 38th IEEE International Symposium on Multiple Valued Logic, ISMVL 2008, pp. 26\u201331 (2008)","DOI":"10.1109\/ISMVL.2008.21"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"327","DOI":"10.2969\/aspm\/02110327","volume":"21","author":"A Voros","year":"1992","unstructured":"Voros, A.: Spectral zeta functions. Adv. Stud. Pure Math. 21, 327\u2013358 (1992)","journal-title":"Adv. Stud. Pure Math."},{"issue":"11","key":"12_CR18","doi-asserted-by":"publisher","first-page":"2589","DOI":"10.1016\/j.patcog.2008.12.029","volume":"42","author":"B Xiao","year":"2009","unstructured":"Xiao, B., Hancock, E.R., Wilson, R.C.: Graph characteristics from the heat kernel trace. Pattern Recogn. 42(11), 2589\u20132606 (2009)","journal-title":"Pattern Recogn."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"1991","DOI":"10.1016\/j.patrec.2012.03.021","volume":"33","author":"Z Zhang","year":"2012","unstructured":"Zhang, Z., Hancock, E.: Hypergraph based information-theoretic feature selection. Pattern Recogn. Lett. 33, 1991\u20131999 (2012)","journal-title":"Pattern Recogn. Lett."}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14085-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:08:03Z","timestamp":1679188083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry for Computer Imagery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dgci2019.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1-2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}