{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:12:40Z","timestamp":1742958760303,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030908874"},{"type":"electronic","value":"9783030908881"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90888-1_33","type":"book-chapter","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T14:13:49Z","timestamp":1638454429000},"page":"423-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Ordering: Towards the Optimal by Learning"],"prefix":"10.1007","author":[{"given":"Kangfei","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Yu","family":"Rong","sequence":"additional","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Wenbing","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Junzhou","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"33_CR1","unstructured":"KONECT (the koblenz network collection). konect.cc\/networks\/"},{"key":"33_CR2","unstructured":"Ahmed, A., Shervashidze, N., Narayanamurthy, S.M., Josifov, V.A., Smola, J.: Distributed large-scale natural graph factorization. In: Proceedings of WWW\u201913"},{"key":"33_CR3","unstructured":"Auroux, L., Burelle, M., Erra, R.: Reordering very large graphs for fun and profit. In: International Symposium on Web AlGorithms (2015)"},{"key":"33_CR4","unstructured":"Balaji, V., Lucia, B.: When is graph reordering an optimization? studying the effect of lightweight graph reordering across applications and input graphs. In: Proceedings of IEEE IISWC\u201918"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Behrisch, M., Bach, B., Riche, T. S., Fekete, J.: Matrix reordering methods for table and network visualization. Comput. Graph. Forum, 35(3) (2016)","DOI":"10.1111\/cgf.12935"},{"key":"33_CR6","unstructured":"Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Proceedings of NIPS\u201901"},{"key":"33_CR7","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: Proceedings of ICLR\u201917, Workshop Track"},{"key":"33_CR8","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Srinivasan, S., (eds.) Proceedings of WWW\u201911"},{"key":"33_CR9","unstructured":"Boldi, P., Santini, M., Vigna, S.: Permuting web graphs. In: Avrachenkov, K., Donato, D., Litvak, N., (eds.) Proceedings of WAW\u201909"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Cui, P., Wang, X., Pei, J., Zhu, W.: A survey on network embedding. IEEE Trans. Knowl. Data Eng. (2018)","DOI":"10.1109\/TKDE.2018.2849727"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Y. Fu and Y. Ma. Graph embedding for pattern analysis. Springer Science & Business Media, 2012","DOI":"10.1007\/978-1-4614-4457-2"},{"key":"33_CR12","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of KDD\u201916"},{"key":"33_CR13","unstructured":"Hamilton, W.L., Ying, R., Leskovec, J.: Representation learning on graphs: methods and applications. IEEE Data Eng. Bull., 40(3) (2017)"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Harper, L.H.: Optimal assignments of numbers to vertices. J. Soc. Ind. Appl. Math. 12(1), 131\u2013135 (1964)","DOI":"10.1137\/0112012"},{"key":"33_CR15","unstructured":"Kang, U., Faloutsos, C.: Beyond \u2019caveman communities\u2019: hubs and spokes for graph compression and mining. In: Proceedings of ICDM\u201911"},{"key":"33_CR16","unstructured":"E. B. Khalil, H. Dai, Y. Zhang, B. Dilkina, and L. Song. Learning combinatorial optimization algorithms over graphs. In Proc. of NIPS\u201917"},{"key":"33_CR17","unstructured":"Konda, V.R., Tsitsiklis, J.N.: Actor-critic algorithms. In: Proceedings of NIPS\u201999"},{"key":"33_CR18","unstructured":"Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems!. In: Proceedings of ICLR\u201919"},{"key":"33_CR19","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: stanford large network dataset collection (2014). snap.stanford.edu\/data"},{"key":"33_CR20","unstructured":"Mnih, V., et al.: Playing atari with deep reinforcement learning. In: Proceedings of NIPS\u201913, Deep Learning Workshop"},{"key":"33_CR21","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of KDD\u201914"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Smith, K.A.: Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS J. Comput. 11(1) (1999)","DOI":"10.1287\/ijoc.11.1.15"},{"key":"33_CR23","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: LINE: large-scale information network embedding. In: Proceedings of WWW\u201915"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Tsoumakas, G., Katakis, I.: Multi-label classification: an overview. IJDWM, 3(3) (2007)","DOI":"10.4018\/jdwm.2007070101"},{"key":"33_CR25","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Proceedings of NIPS\u201917"},{"key":"33_CR26","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Proceedings of NIPS\u201915"},{"key":"33_CR27","unstructured":"Wei, H., Yu, J.X., Lu, C., Lin, X.: Speedup graph processing by graph ordering. In: Procedigs of SIGMOD\u201916"},{"key":"33_CR28","doi-asserted-by":"crossref","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learn. 8 (1992)","DOI":"10.1007\/BF00992696"},{"key":"33_CR29","unstructured":"Zaheer, M., et al.: Deep sets. In: Proceedings of NIPS\u201917"},{"key":"33_CR30","unstructured":"Zhang, Z., Cui, P., Wang, X., Pei, J., Yao, X., Zhu, W.: Arbitrary-order proximity preserved network embedding. In: Proceedings of KDD\u201918"},{"key":"33_CR31","unstructured":"Zhao, K. Yu, X.J., Zhang, H., Li, Q., Rong, Y.: A learned sketch for subgraph counting. In: Proceedings SIGMOD \u201921"},{"key":"33_CR32","doi-asserted-by":"crossref","unstructured":"Zhao, K., Zhang, Z., Rong, Y., Yu, J.X., Huang, J.: Finding critical users in social communities via graph convolutions. IEEE Trans. Knowl. Data Eng., pp. 1\u20131 (2021)","DOI":"10.1109\/TKDE.2021.3089763"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90888-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T14:24:49Z","timestamp":1638455089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90888-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030908874","9783030908881"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90888-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2021","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":"wise2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wise-conferences.org\/2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"229","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":"55","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":"29","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":"24% - 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":"4","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)"}}]}}