{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:57Z","timestamp":1750221117697,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T00:00:00Z","timestamp":1544745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,12,14]]},"DOI":"10.1145\/3301326.3301354","type":"proceedings-article","created":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T17:16:26Z","timestamp":1552583786000},"page":"27-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Predict the Best Graph Partitioning Strategy by Using Machine Learning Technology"],"prefix":"10.1145","author":[{"given":"Jiayi","family":"Shen","sequence":"first","affiliation":[{"name":"SEI, East China Normal University, University of Nice Sophia-Antipolis"}]},{"given":"Fabrice","family":"Huet","sequence":"additional","affiliation":[{"name":"University of Nice Sophia-Antipolis, CNRS"}]}],"member":"320","published-online":{"date-parts":[[2018,12,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICITST.2016.7856670"},{"key":"e_1_3_2_1_2_1","unstructured":"Apache. GraphX Programming Guide. Retrieved from https:\/\/spark.apache.org\/docs\/latest\/graphx-programming-guide.html.  Apache. GraphX Programming Guide. Retrieved from https:\/\/spark.apache.org\/docs\/latest\/graphx-programming-guide.html."},{"key":"e_1_3_2_1_3_1","unstructured":"Apache. Graph X | Apache Spark. Retrieved from https:\/\/spark.apache.org\/graphx\/.  Apache. Graph X | Apache Spark. Retrieved from https:\/\/spark.apache.org\/graphx\/."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 2nd USENIX conference on Hot topics in cloud computing (HotCloud '10)","author":"Matei Zaharia","year":"2010","unstructured":"Matei Zaharia , Mosharaf Chowdhury, Michael J. Franklin , Scott Shenker, and Ion Stoica . 2010 . Spark: cluster computing with working sets . In Proceedings of the 2nd USENIX conference on Hot topics in cloud computing (HotCloud '10) . USENIX Association, Berkeley, CA, USA, 10--10. Matei Zaharia, Mosharaf Chowdhury, Michael J. Franklin, Scott Shenker, and Ion Stoica. 2010. Spark: cluster computing with working sets. In Proceedings of the 2nd USENIX conference on Hot topics in cloud computing (HotCloud '10). USENIX Association, Berkeley, CA, USA, 10--10."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/21.97458"},{"key":"e_1_3_2_1_6_1","volume-title":"K-nearest neighbor. Scholarpedia, 4, 2","author":"Peterson L. E.","year":"1883","unstructured":"Peterson , L. E. 2009. K-nearest neighbor. Scholarpedia, 4, 2 ( 1883 ). Peterson, L. E. 2009. K-nearest neighbor. Scholarpedia, 4, 2 (1883)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022627411411"},{"key":"e_1_3_2_1_8_1","volume-title":"Machine Learning Algorithms: Which One to Choose for your problem? (Oct","author":"Daniil Korbut","year":"2017","unstructured":"Daniil Korbut . 2017. Machine Learning Algorithms: Which One to Choose for your problem? (Oct . 2017 ). Retrieved October 1, 2018 from https:\/\/dzone.com\/. Daniil Korbut. 2017. Machine Learning Algorithms: Which One to Choose for your problem? (Oct. 2017). Retrieved October 1, 2018 from https:\/\/dzone.com\/."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022643204877"},{"volume-title":"Programs for Machine Learning","author":"Ross Quinlan","key":"e_1_3_2_1_10_1","unstructured":"J. Ross Quinlan . 1993. C4.5 : Programs for Machine Learning . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA. J. Ross Quinlan. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA."},{"volume-title":"Classification and regression trees","author":"Breiman L.","key":"e_1_3_2_1_11_1","unstructured":"Breiman , L. 1984. Classification and regression trees . Routledge, New York , NY. Breiman, L. 1984. Classification and regression trees. Routledge, New York, NY."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/72.991427"},{"key":"e_1_3_2_1_13_1","volume-title":"Spark implementation. Retrieved","author":"Larry Xiao","year":"2018","unstructured":"Larry Xiao . 2014. Spark implementation. Retrieved April 1, 2018 from https:\/\/github.com\/larryxiao\/spark. Larry Xiao. 2014. Spark implementation. Retrieved April 1, 2018 from https:\/\/github.com\/larryxiao\/spark."},{"volume-title":"Pattern recognition and machine learning","author":"Bishop","key":"e_1_3_2_1_14_1","unstructured":"Bishop , Christopher. 2006. Pattern recognition and machine learning . Springer , Berlin . Bishop, Christopher. 2006. Pattern recognition and machine learning. Springer, Berlin."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3136625"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/90417.90738"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2005.05.030"},{"key":"e_1_3_2_1_18_1","volume-title":"Stanford Large Network Dataset Collection. Retrieved","author":"Stanford","year":"2018","unstructured":"Stanford . Stanford Large Network Dataset Collection. Retrieved April 1, 2018 from https:\/\/snap.stanford.edu\/data\/. Stanford. Stanford Large Network Dataset Collection. Retrieved April 1, 2018 from https:\/\/snap.stanford.edu\/data\/."}],"event":{"name":"ICNCC 2018: 2018 VII International Conference on Network, Communication and Computing","acronym":"ICNCC 2018","location":"Taipei City Taiwan"},"container-title":["Proceedings of the 2018 VII International Conference on Network, Communication and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3301326.3301354","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3301326.3301354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:05Z","timestamp":1750208525000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3301326.3301354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,14]]},"references-count":18,"alternative-id":["10.1145\/3301326.3301354","10.1145\/3301326"],"URL":"https:\/\/doi.org\/10.1145\/3301326.3301354","relation":{},"subject":[],"published":{"date-parts":[[2018,12,14]]},"assertion":[{"value":"2018-12-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}