{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:30Z","timestamp":1750221150726,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":6,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"the National Key Research and Development Program of China","award":["2017YFC0820402"],"award-info":[{"award-number":["2017YFC0820402"]}]},{"name":"the Intelligent Manufacturing Comprehensive Standardization and New Pattern Application Project of MIIT","award":["Experimental validation of key technical standards for trusted s"],"award-info":[{"award-number":["Experimental validation of key technical standards for trusted s"]}]},{"name":"the China National Arts Fund","award":["20164129"],"award-info":[{"award-number":["20164129"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3184558.3186912","type":"proceedings-article","created":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T18:04:25Z","timestamp":1524074665000},"page":"27-28","source":"Crossref","is-referenced-by-count":2,"title":["Which Algorithm Performs Best"],"prefix":"10.1145","author":[{"given":"Gaoyang","family":"Guo","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Chaokun","family":"Wang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Xiang","family":"Ying","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]}],"member":"320","reference":[{"key":"key-10.1145\/3184558.3186912-1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 855--864.","DOI":"10.1145\/2939672.2939754"},{"key":"key-10.1145\/3184558.3186912-2","unstructured":"Mathias Niepert, Mohamed Ahmed, and Konstantin Kutzkov. 2016. Learning convolutional neural networks for graphs. In International Conference on Machine Learning. 2014--2023."},{"key":"key-10.1145\/3184558.3186912-3","unstructured":"Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, and Karsten M Borgwardt. 2011. Weisfeiler-lehman graph kernels. Journal of Machine Learning Research Vol. 12, Sep (2011), 2539--2561."},{"key":"key-10.1145\/3184558.3186912-4","doi-asserted-by":"crossref","unstructured":"Charles Spearman. 1904. The proof and measurement of association between two things. The American journal of psychology Vol. 15, 1 (1904), 72--101.","DOI":"10.2307\/1412159"},{"key":"key-10.1145\/3184558.3186912-5","doi-asserted-by":"crossref","unstructured":"Meng Wang, Chaokun Wang, Jeffrey Xu Yu, and Jun Zhang. 2015. Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework. Proceedings of the VLDB Endowment Vol. 8, 10 (June. 2015), 998--1009.","DOI":"10.14778\/2794367.2794370"},{"key":"key-10.1145\/3184558.3186912-6","doi-asserted-by":"crossref","unstructured":"Yifei Yue, Chaokun Wang, Xiang Ying, and Jun Qian. 2017. CoDeT: An Easy-to-Use Community Detection Tool. International Journal of Data Mining and Bioinformatics Vol. 19, 1 (2017), 52--74.","DOI":"10.1504\/IJDMB.2017.088537"}],"event":{"number":"2018","sponsor":["IW3C2, International World Wide Web Conference Committee","SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"acronym":"WWW '18","name":"Companion of the The Web Conference 2018","start":{"date-parts":[[2018,4,23]]},"location":"Lyon, France","end":{"date-parts":[[2018,4,27]]}},"container-title":["Companion of the The Web Conference 2018 on The Web Conference 2018  - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3184558.3186912","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186912&ftid=1958131&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:23Z","timestamp":1750208903000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3184558.3186912"}},"subtitle":["Algorithm Selection for Community Detection"],"proceedings-subject":"The Web Conference 2018","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":6,"URL":"https:\/\/doi.org\/10.1145\/3184558.3186912","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}