{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:36:34Z","timestamp":1761597394727},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2013,1,3]],"date-time":"2013-01-03T00:00:00Z","timestamp":1357171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00607-012-0264-2","type":"journal-article","created":{"date-parts":[[2013,1,2]],"date-time":"2013-01-02T17:31:47Z","timestamp":1357147907000},"page":"759-784","source":"Crossref","is-referenced-by-count":14,"title":["GoSCAN: Decentralized scalable data clustering"],"prefix":"10.1007","volume":"95","author":[{"given":"Hoda","family":"Mashayekhi","sequence":"first","affiliation":[]},{"given":"Jafar","family":"Habibi","sequence":"additional","affiliation":[]},{"given":"Spyros","family":"Voulgaris","sequence":"additional","affiliation":[]},{"given":"Maarten","family":"van Steen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,3]]},"reference":[{"key":"264_CR1","doi-asserted-by":"crossref","unstructured":"Aouad LM, Le-Khac NA, Kechadi TM (2007) Lightweight clustering technique for distributed data mining applications. In: 7th international conference on data mining. Springer, Berlin, pp 120\u2013134","DOI":"10.1007\/978-3-540-73435-2_10"},{"issue":"4","key":"264_CR2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/356789.356797","volume":"11","author":"JL Bentley","year":"1979","unstructured":"Bentley JL, Friedman JH (1979) Data structures for range searching. ACM Comput Surv 11(4):397\u2013409","journal-title":"ACM Comput Surv"},{"issue":"4","key":"264_CR3","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/MIC.2006.74","volume":"10","author":"S Datta","year":"2006","unstructured":"Datta S, Bhaduri K, Giannella C, Wolff R, Kargupta H (2006) Distributed data mining in peer-to-peer networks. IEEE Internet Comput 10(4):18\u201326","journal-title":"IEEE Internet Comput"},{"issue":"10","key":"264_CR4","doi-asserted-by":"crossref","first-page":"1372","DOI":"10.1109\/TKDE.2008.222","volume":"21","author":"S Datta","year":"2009","unstructured":"Datta S, Giannella CR, Kargupta H (2009) Approximate distributed K-means clustering over a peer-to-peer network. IEEE Trans Knowl Data Eng 21(10):1372\u20131388","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"264_CR5","doi-asserted-by":"crossref","unstructured":"Demers A, Greene D, Hauser C, Irish W, Larson J, Shenker S, Sturgis H, Swinehart D, Terry D (1987) Epidemic algorithms for replicated database maintenance. In: 6th symposium on principles of distributed computing. ACM, pp 1\u201312","DOI":"10.1145\/41840.41841"},{"key":"264_CR6","unstructured":"Dhillon IS, Modha DS (2000) A data-clustering algorithm on distributed memory multiprocessors. In: Large-scale parallel data mining. Springer, Berlin, Lecture Notes in Computer Science, vol 1759, pp 245\u2013260"},{"key":"264_CR7","unstructured":"Eisenhardt M, Muller W, Henrich A (2003) Classifying documents by distributed P2P clustering. In: Inform. pp 286\u2013291"},{"key":"264_CR8","unstructured":"Ester M, Kriegel HP, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: 2nd international conference knowledge discovery and data mining. ACM Press, New York, pp 226\u2013231"},{"issue":"5","key":"264_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00446-011-0143-7","volume":"24","author":"I Eyal","year":"2011","unstructured":"Eyal I, Keidar I, Rom R (2011) Distributed data clustering in sensor networks. Distrib Comput 24(5):207\u2013222","journal-title":"Distrib Comput"},{"key":"264_CR10","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/380995.381010","volume":"2","author":"G Forman","year":"2000","unstructured":"Forman G, Zhang B (2000) Distributed data clustering can be efficient and exact. SIGKDD Explor Newsl 2:34\u201338","journal-title":"SIGKDD Explor Newsl"},{"key":"264_CR11","doi-asserted-by":"crossref","unstructured":"Guha S, Rastogi R, Shim K (1998) CURE: an efficient clustering algorithm for large databases. In: SIGMOD international conference on management Of data. ACM Press, New York, SIGMOD\u201998, pp 73\u201384","DOI":"10.1145\/276305.276312"},{"key":"264_CR12","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/TKDE.2008.189","volume":"21","author":"KM Hammouda","year":"2009","unstructured":"Hammouda KM, Kamel MS (2009) Hierarchically distributed peer-to-peer document clustering and cluster summarization. IEEE Trans Knowl Data Eng 21:681\u2013698","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"264_CR13","doi-asserted-by":"crossref","unstructured":"Holm J, de Lichtenberg C, Thorup M (1998) Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In Proceedings of the thirtieth annual ACM symposium on Theory of computing (STOC \u201998). ACM, New York, pp 79\u201389","DOI":"10.1145\/276698.276715"},{"key":"264_CR14","doi-asserted-by":"crossref","unstructured":"Januzaj E, Kriegel HP, Pfeifle M (2004) Scalable density-based distributed clustering. In: 8th european conference on principles and practice of knowledge discovery in databases, Springer, Berlin, pp 231\u2013244","DOI":"10.1007\/978-3-540-30116-5_23"},{"key":"264_CR15","doi-asserted-by":"crossref","unstructured":"Jelasity M, Voulgaris S, Guerraoui R, Kermarrec AM, van Steen M (2007) Gossip-based peer sampling. ACM Trans Comput Syst 25(3):8","DOI":"10.1145\/1275517.1275520"},{"key":"264_CR16","first-page":"713","volume":"17","author":"W Kowalczyk","year":"2005","unstructured":"Kowalczyk W, Vlassis N (2005) Newscast EM. NIPS 17:713\u2013720","journal-title":"NIPS"},{"key":"264_CR17","doi-asserted-by":"crossref","unstructured":"Kriegel HP, Kroger P, Pryakhin A, Schubert M (2005) Effective and efficient distributed model-based clustering. In: 5th international conference on data mining. IEEE Computer Society Press, Los Alamitos, CA, pp 258\u2013265","DOI":"10.1109\/ICDM.2005.53"},{"key":"264_CR18","doi-asserted-by":"crossref","unstructured":"Kriegel HP, Kunath P, Pfeie M, Renz M (2005) Approximated clustering of distributed high-dimensional data. In: 9th advances in knowledge discovery and data mining. Lecture Notes in Computer Science, vol 3518, pp 432\u2013441","DOI":"10.1007\/11430919_51"},{"key":"264_CR19","doi-asserted-by":"crossref","unstructured":"Li M, Lee G, Lee WC, Sivasubramaniam A (2006) PENS: an algorithm for density-based clustering in peer-to-peer systems. In: 1st international conference on scalable information systems. ACM Press, New York","DOI":"10.1145\/1146847.1146886"},{"key":"264_CR20","doi-asserted-by":"crossref","unstructured":"Liu YB, Liu ZX (2011) Scalable local density-based distributed clustering. Expert Syst Appl 38(8):9491\u20139498","DOI":"10.1016\/j.eswa.2011.01.144"},{"key":"264_CR21","unstructured":"Lodi S, Moro G, Sartori C (2010) Distributed data clustering in multi-dimensional peer-to-peer networks. In: 21st Australasian conference on database technologies, vol 104. pp 171\u2013178"},{"key":"264_CR22","doi-asserted-by":"crossref","unstructured":"Luo P, Xiong H, Lu K, Shi Z (2007) Distributed classification in peer-to-peer networks. In: 13th ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press, New York, pp 968\u2013976","DOI":"10.1145\/1281192.1281296"},{"issue":"4","key":"264_CR23","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/j.patrec.2004.08.003","volume":"26","author":"S Merugu","year":"2005","unstructured":"Merugu S, Ghosh J (2005) A privacy-sensitive approach to distributed clustering. Pattern Recogn Lett 26(4):399\u2013410","journal-title":"Pattern Recogn Lett"},{"key":"264_CR24","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Schenker S (2001) A scalable content-addressable network. In: SIGCOMM. ACM, San Diego, pp 161\u2013172","DOI":"10.1145\/964723.383072"},{"key":"264_CR25","first-page":"157","volume":"11","author":"NF Samatova","year":"2002","unstructured":"Samatova NF, Ostrouchov G, Geist A, Melechko AV (2002) RACHET: an efficient cover-based merging of clustering hierarchies from distributed datasets. Distrib Parallel Datab 11:157\u2013180","journal-title":"Distrib Parallel Datab"},{"key":"264_CR26","doi-asserted-by":"crossref","unstructured":"Stonebraker M, Frew J, Gardels K, Meredith J (1993) The sequoia 2000 storage benchmark. In Proceedings of SIGMOD, pp 2\u201311","DOI":"10.1145\/170036.170038"},{"key":"264_CR27","unstructured":"Tasoulis DK, Vrahatis MN (2004) Unsupervised distributed clustering. In: IASTED international conference on parallel and distributed computing and networks"},{"key":"264_CR28","doi-asserted-by":"crossref","unstructured":"Visalakshi N, Thangavel K (2009) Distributed data clustering: a comparative analysis. In: Abraham A, Hassanien AE, de Leon F de Carvalho A, Snasel V (eds) Found Comput Intell 206:371\u2013397","DOI":"10.1007\/978-3-642-01091-0_16"},{"issue":"17","key":"264_CR29","doi-asserted-by":"crossref","first-page":"2299","DOI":"10.1002\/cpe.1225","volume":"19","author":"S Voulgaris","year":"2007","unstructured":"Voulgaris S, van Steen M, Iwanicki K (2007) Proactive gossip-based management of semantic overlay networks. Concurr Comput : Pract Expert 19(17):2299\u20132311","journal-title":"Concurr Comput : Pract Expert"},{"issue":"6","key":"264_CR30","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/TSMCB.2004.836888","volume":"34","author":"R Wolff","year":"2004","unstructured":"Wolff R, Schuster A (2004) Association rule mining in peer-to-peer systems. IEEE Trans Syst Man Cybern 34(6):242\u20132438","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"264_CR31","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1109\/TKDE.2008.169","volume":"21","author":"R Wolff","year":"2009","unstructured":"Wolff R, Bhaduri K, Kargupta H (2009) A generic local algorithm for mining data streams in large distributed systems. IEEE Trans Knowl Data Eng 21:465\u2013478","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-012-0264-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-012-0264-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-012-0264-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T20:40:30Z","timestamp":1562532030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-012-0264-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,3]]},"references-count":31,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["264"],"URL":"https:\/\/doi.org\/10.1007\/s00607-012-0264-2","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,3]]}}}