{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:50:59Z","timestamp":1761648659572,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T00:00:00Z","timestamp":1562025600000},"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":[[2019,7,2]]},"DOI":"10.1145\/3327960.3332383","type":"proceedings-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T12:53:20Z","timestamp":1562676800000},"page":"57-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Decentralized Ensemble Learning Based on Sample Exchange among Multiple Agents"],"prefix":"10.1145","author":[{"given":"Yong","family":"Yu","sequence":"first","affiliation":[{"name":"Southwest University, Chongqing, China"}]},{"given":"Jia","family":"Deng","sequence":"additional","affiliation":[{"name":"University of Auckland, Auckland, New Zealand"}]},{"given":"Yanni","family":"Tang","sequence":"additional","affiliation":[{"name":"Southwest University, Chongqing, China"}]},{"given":"Jiamou","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Auckland, Auckland, New Zealand"}]},{"given":"Wu","family":"Chen","sequence":"additional","affiliation":[{"name":"Southwest University, Chongqing, China"}]}],"member":"320","published-online":{"date-parts":[[2019,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1027","volume-title":"Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms.","author":"Arthur D.","year":"2007","unstructured":"Arthur , D. , Vassilvitskii , S. : k-means+: The advantages of careful seeding . In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. pp. 1027 -- 1035 . Society for Industrial and Applied Mathematics ( 2007 ) Arthur, D., Vassilvitskii, S.: k-means+: The advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. pp. 1027--1035. Society for Industrial and Applied Mathematics (2007)"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","DOI":"10.1201\/9781315139470","volume-title":"Classification and regression trees","author":"Breiman L.","year":"2017","unstructured":"Breiman , L. : Classification and regression trees . Routledge ( 2017 ) Breiman, L.: Classification and regression trees. Routledge (2017)"},{"key":"e_1_3_2_1_5_1","first-page":"193","volume-title":"Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems.","author":"Cai Y.","year":"2018","unstructured":"Cai , Y. , Zheng , H. , Liu , J. , Yan , B. , Su , H. , Liu , Y. : Balancing the pain and gain of hobnobbing: Utility-based network building over atributed social networks . In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. pp. 193 -- 201 . International Foundation for Autonomous Agents and Multiagent Systems ( 2018 ) Cai, Y., Zheng, H., Liu, J., Yan, B., Su, H., Liu, Y.: Balancing the pain and gain of hobnobbing: Utility-based network building over atributed social networks. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. pp. 193--201. International Foundation for Autonomous Agents and Multiagent Systems (2018)"},{"volume-title":"Essay on the application of analysis to the probability of majority decisions","author":"Condorcet M.d.","key":"e_1_3_2_1_6_1","unstructured":"Condorcet , M.d. : Essay on the application of analysis to the probability of majority decisions . Paris : Imprimerie Royale ( 1785) Condorcet, M.d.: Essay on the application of analysis to the probability of majority decisions. Paris: Imprimerie Royale (1785)"},{"volume-title":"Proceedings of the IEEE textbf67(5), 708--713 (1979)","author":"Dasarathy B.V.","key":"e_1_3_2_1_7_1","unstructured":"Dasarathy , B.V. , Sheela , B.V. : A composite classifier system design: Concepts and methodology . Proceedings of the IEEE textbf67(5), 708--713 (1979) Dasarathy, B.V., Sheela, B.V.: A composite classifier system design: Concepts and methodology. Proceedings of the IEEE textbf67(5), 708--713 (1979)"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007607513941"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347107"},{"key":"e_1_3_2_1_10_1","volume-title":"Amorim","author":"Fern\u00e1ndez-Delgado M.","year":"2014","unstructured":"Fern\u00e1ndez-Delgado , M. , Cernadas , E. , Barro , S. , Amorim , D. : Do we need hundreds of classifiers to solve real world classification problems? The Journal of Machine Learning Research textbf15(1), 3133--3181 ( 2014 ) Fern\u00e1ndez-Delgado, M., Cernadas, E., Barro, S., Amorim, D.: Do we need hundreds of classifiers to solve real world classification problems? The Journal of Machine Learning Research textbf15(1), 3133--3181 (2014)"},{"key":"e_1_3_2_1_11_1","first-page":"148","volume-title":"Icml.","author":"Freund Y.","year":"1996","unstructured":"Freund , Y. , Schapire , R.E. , : Experiments with a new boosting algorithm . In: Icml. vol. 96 , pp. 148 -- 156 . Citeseer ( 1996 ) Freund, Y., Schapire, R.E., et al.: Experiments with a new boosting algorithm. In: Icml. vol. 96, pp. 148--156. Citeseer (1996)"},{"key":"e_1_3_2_1_12_1","first-page":"1189","volume-title":": Greedy function approximation: a gradient boosting machine. Annals of statistics","author":"Friedman J.H.","year":"2001","unstructured":"Friedman , J.H. : Greedy function approximation: a gradient boosting machine. Annals of statistics pp. 1189 -- 1232 ( 2001 ) Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Annals of statistics pp. 1189--1232 (2001)"},{"key":"e_1_3_2_1_13_1","volume-title":"Hall","author":"Friedman J.H.","year":"2007","unstructured":"Friedman , J.H. , Hall , P. : On bagging and nonlinear estimation. Journal of statistical planning and inference textbf137(3), 669--683 ( 2007 ) Friedman, J.H., Hall, P.: On bagging and nonlinear estimation. Journal of statistical planning and inference textbf137(3), 669--683 (2007)"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.58871"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Hoeffding W.: Probability inequalities for sums of bounded random variables. Journal of the American statistical association textbf58(301) 13--30 (1963)  Hoeffding W.: Probability inequalities for sums of bounded random variables. Journal of the American statistical association textbf58(301) 13--30 (1963)","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835893"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"e_1_3_2_1_18_1","volume-title":"O'Shea, J., Nguyen","author":"Jke","year":"2011","unstructured":"Jke drzejowicz, P. : Machine learning and agents . In: O'Shea, J., Nguyen , N.T., Crockett, K., Howlett, R.J., Jain, L.C. (eds.) Agent and Multi-Agent Systems: Technologies and Applications. Springer ( 2011 ) Jke drzejowicz, P.: Machine learning and agents. In: O'Shea, J., Nguyen, N.T., Crockett, K., Howlett, R.J., Jain, L.C. (eds.) Agent and Multi-Agent Systems: Technologies and Applications. Springer (2011)"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03816-7_41"},{"key":"e_1_3_2_1_20_1","unstructured":"Koren Y.: The bellkor solution to the netflix grand prize. Netflix prize documentation textbf81 1--10 (2009)  Koren Y.: The bellkor solution to the netflix grand prize. Netflix prize documentation textbf81 1--10 (2009)"},{"key":"e_1_3_2_1_21_1","unstructured":"Lichman M. etal: Uci machine learning repository (2013)  Lichman M. et al.: Uci machine learning repository (2013)"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CANDAR.2014.20"},{"key":"e_1_3_2_1_23_1","unstructured":"Louppe G.: Understanding random forests: From theory to practice. arXiv preprint arXiv:1407.7502 (2014)  Louppe G.: Understanding random forests: From theory to practice. arXiv preprint arXiv:1407.7502 (2014)"},{"key":"e_1_3_2_1_24_1","first-page":"59","volume-title":"Moore","author":"Maron O.","year":"1994","unstructured":"Maron , O. , Moore , A.W. : Hoeffding races: Accelerating model selection search for classification and function approximation. In : Advances in neural information processing systems. pp. 59 -- 66 ( 1994 ) Maron, O., Moore, A.W.: Hoeffding races: Accelerating model selection search for classification and function approximation. In: Advances in neural information processing systems. pp. 59--66 (1994)"},{"key":"e_1_3_2_1_25_1","first-page":"33","volume-title":"Alan Cohn","author":"Michael J.","year":"2018","unstructured":"Michael J. Rennock , Alan Cohn , J.B. : Blockchain technology and regulatory investigations. Journal of Practical Law pp. 33 -- 44 ( 2018 ) Michael J. Rennock, Alan Cohn, J.B.: Blockchain technology and regulatory investigations. Journal of Practical Law pp. 33--44 (2018)"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/3060832.3060984"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42345-6_4"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/3192424.3192466"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31537-4_13"},{"key":"e_1_3_2_1_30_1","first-page":"2825","volume":"1","author":"Pedregosa F.","year":"2011","unstructured":"Pedregosa , F. , Varoquaux , G. , Gramfort , A. , Michel , V. , Thirion , B. , Grisel , O. , Blondel , M. , Prettenhofer , P. , Weiss , R. , Dubourg , V. , : Scikit-learn: Machine learning in python. Journal of machine learning research textbf 1 2(Oct), 2825 -- 2830 ( 2011 ) Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., et al.: Scikit-learn: Machine learning in python. Journal of machine learning research textbf12(Oct), 2825--2830 (2011)","journal-title":"Journal of machine learning research textbf"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9326-7_1"},{"key":"e_1_3_2_1_32_1","volume-title":"Boulesteix","author":"Probst P.","year":"2017","unstructured":"Probst , P. , Boulesteix , A.L. : To tune or not to tune the number of trees in random forest? arXiv preprint arXiv:1705.05654 ( 2017 ) Probst, P., Boulesteix, A.L.: To tune or not to tune the number of trees in random forest? arXiv preprint arXiv:1705.05654 (2017)"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007618119488"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022648800760"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-97304-3_80"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1996.548872"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(05)80023-1"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68783-4_6"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","DOI":"10.1201\/b12207","volume-title":": Ensemble methods: foundations and algorithms","author":"Zhou Z.H.","year":"2012","unstructured":"Zhou , Z.H. : Ensemble methods: foundations and algorithms . Chapman and Hall\/CRC ( 2012 ) Zhou, Z.H.: Ensemble methods: foundations and algorithms. Chapman and Hall\/CRC (2012)"}],"event":{"name":"Asia CCS '19: ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Auckland New Zealand","acronym":"Asia CCS '19"},"container-title":["Proceedings of the 2019 ACM International Symposium on Blockchain and Secure Critical Infrastructure"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3327960.3332383","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3327960.3332383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:32Z","timestamp":1750206332000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3327960.3332383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,2]]},"references-count":39,"alternative-id":["10.1145\/3327960.3332383","10.1145\/3327960"],"URL":"https:\/\/doi.org\/10.1145\/3327960.3332383","relation":{},"subject":[],"published":{"date-parts":[[2019,7,2]]},"assertion":[{"value":"2019-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}