{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:26:20Z","timestamp":1742912780099,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030260712"},{"type":"electronic","value":"9783030260729"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26072-9_20","type":"book-chapter","created":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T23:05:48Z","timestamp":1564009548000},"page":"273-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Iterative Hypergraph Computation Based on Hyperedge-Connected Graphs"],"prefix":"10.1007","author":[{"given":"Kaiqiang","family":"Yu","sequence":"first","affiliation":[]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Shuo","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Song","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,18]]},"reference":[{"key":"20_CR1","unstructured":"Berlt, K., de Moura, E.S., da Costa Carvalho, A.L., et al.: A hypergraph model for computing page reputation on web collections. In: da Silva, A.S. (ed.) XXII Simp\u00f3sio Brasileiro de Banco de Dados, pp. 35\u201349. SBC (2007)"},{"issue":"12","key":"20_CR2","first-page":"1804","volume":"8","author":"A Ching","year":"2015","unstructured":"Ching, A., Edunov, S., Kabiljo, M., et al.: One trillion edges: graph processing at facebook-scale. PVLDB 8(12), 1804\u20131815 (2015)","journal-title":"PVLDB"},{"issue":"6","key":"20_CR3","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1109\/TNET.2014.2343914","volume":"23","author":"J Gao","year":"2015","unstructured":"Gao, J., Zhao, Q., Ren, W., et al.: Dynamic shortest path algorithms for hypergraphs. IEEE\/ACM Trans. Netw. 23(6), 1805\u20131817 (2015)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"20_CR4","unstructured":"Gonzalez, J.E., Xin, R.S., Dave, A., et al.: GraphX: graph processing in a distributed dataflow framework. In: Flinn, J., Levy, H. (eds.) 11th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2014, pp. 599\u2013613. USENIX Association (2014)"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1109\/TIP.2016.2621671","volume":"26","author":"Q Liu","year":"2017","unstructured":"Liu, Q., Sun, Y., Wang, C., et al.: Elastic net hypergraph learning for image clustering and semi-supervised classification. IEEE Trans. Image Process. 26(1), 452\u2013463 (2017)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s41019-017-0055-z","volume":"2","author":"W Shi","year":"2017","unstructured":"Shi, W., Zheng, W., Yu, J.X., et al.: Keyphrase extraction using knowledge graphs. Data Sci. Eng. 2(4), 275\u2013288 (2017)","journal-title":"Data Sci. Eng."},{"issue":"11","key":"20_CR7","doi-asserted-by":"publisher","first-page":"239:1","DOI":"10.1007\/s10916-016-0600-8","volume":"40","author":"N Somu","year":"2016","unstructured":"Somu, N., Raman, M.R.G., Kannan, K., et al.: Hypergraph based feature selection technique for medical diagnosis. J. Med. Syst. 40(11), 239:1\u2013239:16 (2016)","journal-title":"J. Med. Syst."},{"issue":"2","key":"20_CR8","first-page":"22","volume":"7","author":"S Tan","year":"2011","unstructured":"Tan, S., Bu, J., Chen, C., et al.: Using rich social media information for music recommendation via hypergraph model. TOMCCAP 7(2), 22 (2011)","journal-title":"TOMCCAP"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Wang, Z., Gu, Y., Bao, Y., et al.: Hybrid pulling\/pushing for I\/O-efficient distributed and iterative graph computing. In: \u00d6zcan, F., Koutrika, G., Madden, S. (eds.) Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, pp. 479\u2013494. ACM (2016)","DOI":"10.1145\/2882903.2882938"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26072-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:25:51Z","timestamp":1709810751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26072-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030260712","9783030260729"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26072-9_20","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":"18 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","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":"1 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cfm.uestc.edu.cn\/apwebwaim2019\/","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":"Research Microsoft","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","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":"42","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":"17","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":"23% - 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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}