{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T19:06:01Z","timestamp":1772910361171,"version":"3.50.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030322502","type":"print"},{"value":"9783030322519","type":"electronic"}],"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-32251-9_74","type":"book-chapter","created":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T23:08:49Z","timestamp":1570662529000},"page":"674-682","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Coidentification of Group-Level Hole Structures in Brain Networks via Hodge Laplacian"],"prefix":"10.1007","author":[{"given":"Hyekyoung","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moo K.","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyejin","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyoon","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seunggyun","family":"Ha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youngmin","family":"Huh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eunkyung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong Soo","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,10]]},"reference":[{"key":"74_CR1","volume-title":"Pattern Recognition and Machine Learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Springer, New York (2006)"},{"key":"74_CR2","doi-asserted-by":"crossref","unstructured":"Coifman, R.R., Lafon, S., Lee, A.B., Maggioni, M., Warner, F., Zucker, S.: Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps. In: Proceedings of the National Academy of Sciences (2005)","DOI":"10.1073\/pnas.0500334102"},{"issue":"3","key":"74_CR3","first-page":"229","volume":"31","author":"RJM Dawson","year":"1990","unstructured":"Dawson, R.J.M.: Homology of weighted simplicial complexes. Cahiers de Topologie et G\u00e9om\u00e9trie Diff\u00e9rentielle Cat\u00e9goriques 31(3), 229\u2013243 (1990)","journal-title":"Cahiers de Topologie et G\u00e9om\u00e9trie Diff\u00e9rentielle Cat\u00e9goriques"},{"issue":"1","key":"74_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10827-016-0608-6","volume":"41","author":"C Giusti","year":"2016","unstructured":"Giusti, C., Ghrist, R., Bassett, D.S.: Two\u2019s company, three (or more) is a simplex. J. Comput. Neurosci. 41(1), 1\u201314 (2016)","journal-title":"J. Comput. Neurosci."},{"key":"74_CR5","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.aim.2013.05.007","volume":"244","author":"D Horak","year":"2013","unstructured":"Horak, D., Jost, J.: Spectra of combinatorial Laplace operators on simplicial complexes. Adv. Math. 244, 303\u2013336 (2013)","journal-title":"Adv. Math."},{"key":"74_CR6","first-page":"1","volume":"67","author":"YJ Kim","year":"2018","unstructured":"Kim, Y.J., Kook, W.: Harmonic cycles for graphs. Linear Multilinear Algebra 67, 1\u201311 (2018)","journal-title":"Linear Multilinear Algebra"},{"key":"74_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-319-10443-0_38","volume-title":"Medical Image Computing and Computer-Assisted Intervention \u2013 MICCAI 2014","author":"H Lee","year":"2014","unstructured":"Lee, H., Chung, M.K., Kang, H., Lee, D.S.: Hole detection in metabolic connectivity of alzheimer\u2019s disease using k-laplacian. In: Golland, P., Hata, N., Barillot, C., Hornegger, J., Howe, R. (eds.) MICCAI 2014. LNCS, vol. 8675, pp. 297\u2013304. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10443-0_38"},{"issue":"6","key":"74_CR8","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1109\/TIP.2016.2553459","volume":"25","author":"C Lu","year":"2016","unstructured":"Lu, C., Yan, S., Lin, Z.: Convex sparse spectral clustering: Single-view to multi-view. IEEE Trans. Image Process. 25(6), 2833\u20132843 (2016)","journal-title":"IEEE Trans. Image Process."},{"key":"74_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-319-59050-9_7","volume-title":"Information Processing in Medical Imaging","author":"P Wu","year":"2017","unstructured":"Wu, P., et al.: Optimal topological cycles and their application in cardiac trabeculae restoration. In: Niethammer, M., et al. (eds.) IPMI 2017. LNCS, vol. 10265, pp. 80\u201392. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59050-9_7"},{"key":"74_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.cag.2010.03.007","volume":"34","author":"A Zomorodian","year":"2010","unstructured":"Zomorodian, A.: Fast construction of the Vietoris-Rips complex. Comput. Graph. 34, 263\u2013271 (2010)","journal-title":"Comput. Graph."},{"key":"74_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00454-004-1146-y","volume":"33","author":"A Zomorodian","year":"2005","unstructured":"Zomorodian, A., Carlsson, G.: Computing persistent homology. Discrete Comput. Geom. 33, 249\u2013274 (2005)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Medical Image Computing and Computer Assisted Intervention \u2013 MICCAI 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32251-9_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T00:20:13Z","timestamp":1728519613000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-32251-9_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030322502","9783030322519"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32251-9_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Medical Image Computing and Computer-Assisted Intervention","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"13 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"miccai2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.miccai2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1730","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":"539","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":"31% - 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.07","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":"6.31","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"}]}}