{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T19:39:09Z","timestamp":1726083549680},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030474256"},{"type":"electronic","value":"9783030474263"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-47426-3_27","type":"book-chapter","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T02:02:49Z","timestamp":1588903369000},"page":"343-355","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Decentralized and Adaptive K-Means Clustering for Non-IID Data Using HyperLogLog Counters"],"prefix":"10.1007","author":[{"given":"Amira","family":"Soliman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarunas","family":"Girdzijauskas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed-Rafik","family":"Bouguelia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sepideh","family":"Pashami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Slawomir","family":"Nowaczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"key":"27_CR1","unstructured":"Balcan, M.F., Ehrlich, S., Liang, Y.: Distributed $$ k $$-means and $$ k $$-median clustering on general topologies. In: Advances in Neural Information Processing Systems, pp. 1995\u20132003 (2013)"},{"key":"27_CR2","unstructured":"Berta, \u00c1., Heged\u0171s, I., Orm\u00e1ndi, R.: Lightning fast asynchronous distributed k-means clustering (2014)"},{"key":"27_CR3","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Proceedings of Compression and Complexity of SEQUENCES 1997 (Cat. No. 97TB100171), pp. 21\u201329. IEEE (1997)"},{"issue":"1\u20133","key":"27_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","volume":"56","author":"P Drineas","year":"2004","unstructured":"Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering large graphs via the singular value decomposition. Mach. Learn. 56(1\u20133), 9\u201333 (2004)","journal-title":"Mach. Learn."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Fellus, J, Picard, D., Gosselin, P.-H.: Decentralized k-means using randomized gossip protocols for clustering large datasets. In: 2013 IEEE 13th International Conference on Data Mining Workshops, pp. 599\u2013606. IEEE (2013)","DOI":"10.1109\/ICDMW.2013.58"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Fusy, \u00c9., Gandouet, O., Meunier, F.: HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm. In: Discrete Mathematics and Theoretical Computer Science, pp. 137\u2013156 (2007)","DOI":"10.46298\/dmtcs.3545"},{"issue":"2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/380995.381010","volume":"2","author":"G Forman","year":"2000","unstructured":"Forman, G., Zhang, B.: Distributed data clustering can be efficient and exact. SIGKDD Explor. 2(2), 34\u201338 (2000)","journal-title":"SIGKDD Explor."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Giaretta, L., Girdzijauskas, \u0160.: Gossip learning: off the beaten path. In: IEEE International Conference on Big Data (IEEE Big Data 2019), Los Angeles, CA, USA, 9\u201312 December 2019, p. 2019 (2019)","DOI":"10.1109\/BigData47090.2019.9006216"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Heule, S., Nunkesser, M., Hall, A.: Hyperloglog in practice: algorithmic engineering of a state of the art cardinality estimation algorithm. In: Proceedings of the 16th International Conference on Extending Database Technology, pp. 683\u2013692. ACM (2013)","DOI":"10.1145\/2452376.2452456"},{"key":"27_CR10","unstructured":"Januzaj, E., Kriegel, H.-P., Pfeifle, M.: Towards effective and efficient distributed clustering. In: Workshop on Clustering Large Data Sets (ICDM 2003) (2003)"},{"issue":"4","key":"27_CR11","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/PL00011677","volume":"3","author":"H Kargupta","year":"2001","unstructured":"Kargupta, H., Huang, W., Sivakumar, K., Johnson, E.: Distributed clustering using collective principal component analysis. Knowl. Inf. Syst. 3(4), 422\u2013448 (2001)","journal-title":"Knowl. Inf. Syst."},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-319-09581-3_26","volume-title":"Networked Systems","author":"M Khelghatdoust","year":"2014","unstructured":"Khelghatdoust, M., Girdzijauskas, S.: Short: gossip-based sampling in social overlays. In: Noubir, G., Raynal, M. (eds.) NETYS 2014. LNCS, vol. 8593, pp. 335\u2013340. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09581-3_26"},{"key":"27_CR13","unstructured":"Kone\u010dn\u1ef3, J., McMahan, H.B., Ramage, D., Richt\u00e1rik, P.: Federated optimization: distributed machine learning for on-device intelligence. arXiv preprint arXiv:1610.02527 (2016)"},{"issue":"2","key":"27_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR15","unstructured":"MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA, USA, vol. 1, pp. 281\u2013297 (1967)"},{"issue":"7","key":"27_CR16","doi-asserted-by":"publisher","first-page":"1892","DOI":"10.1109\/TKDE.2015.2391123","volume":"27","author":"H Mashayekhi","year":"2015","unstructured":"Mashayekhi, H., Habibi, J., Khalafbeigi, T., Voulgaris, S., Van Steen, M.: GDCluster: a general decentralized clustering algorithm. IEEE Trans. Knowl. Data Eng. 27(7), 1892\u20131905 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"27_CR17","volume-title":"Pattern Recognition","author":"GH Nguyen","year":"2009","unstructured":"Nguyen, G.H., Bouzerdoum, A., Phung, S.L.: Learning pattern classification tasks with imbalanced data sets. In: Yin, P.-Y. (ed.) Pattern Recognition. IntechOpen, Rijeka (2009)"},{"issue":"4","key":"27_CR18","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1002\/cpe.2858","volume":"25","author":"R Orm\u00e1ndi","year":"2013","unstructured":"Orm\u00e1ndi, R., Heged\u0171s, I., Jelasity, M.: Gossip learning with linear models on fully distributed data. Concurrency Comput. Pract. Experience 25(4), 556\u2013571 (2013)","journal-title":"Concurrency Comput. Pract. Experience"},{"key":"27_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139058452","volume-title":"Mining of Massive Datasets","author":"A Rajaraman","year":"2011","unstructured":"Rajaraman, A., David Ullman, J.: Mining of Massive Datasets. Cambridge University Press, Cambridge (2011)"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Soliman, A., Bahri, L., Carminati, B., Ferrari, E., Girdzijauskas, S.: DIVa: decentralized identity validation for social networks. In: Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, pp. 383\u2013391. ACM (2015)","DOI":"10.1145\/2808797.2808861"},{"issue":"1","key":"27_CR21","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s13278-016-0343-z","volume":"6","author":"A Soliman","year":"2016","unstructured":"Soliman, A., Bahri, L., Girdzijauskas, S., Carminati, B., Ferrari, E.: CADIVa: cooperative and adaptive decentralized identity validation model for social networks. Soc. Network Anal. Min. 6(1), 36 (2016)","journal-title":"Soc. Network Anal. Min."},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Soliman, A., Girdzijauskas, S.: DLSAS: distributed large-scale anti-spam framework for decentralized online social networks. In: 2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC), pp. 363\u2013372. IEEE (2016)","DOI":"10.1109\/CIC.2016.055"},{"key":"27_CR23","unstructured":"Tasoulis, D.K., Vrahatis, M.N.: Unsupervised distributed clustering. In: Parallel and Distributed Computing and Networks, pp. 347\u2013351 (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-47426-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T04:36:03Z","timestamp":1666499763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-47426-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030474256","9783030474263"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-47426-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pakdd2020.org\/","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":"CMT System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"628","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":"135","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":"0","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":"21% - 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-4","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":"6-8","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}