乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T12:43:20Z","timestamp":1700138600145},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"35","license":[{"start":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T00:00:00Z","timestamp":1677801600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T00:00:00Z","timestamp":1677801600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00521-023-08392-5","type":"journal-article","created":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T11:02:36Z","timestamp":1677841356000},"page":"24743-24754","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DDCM: a decentralized density clustering and its results gathering approach"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-8511-9243","authenticated-orcid":false,"given":"Lida","family":"Zou","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,3]]},"reference":[{"key":"8392_CR1","unstructured":"Zhang Y, Zhou Y, School S (2019) Review of clustering algorithms. J Comput Appl"},{"key":"8392_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04005-4_2","volume-title":"Review of clustering algorithms","author":"WA Barbakh","year":"2009","unstructured":"Barbakh WA, Ying W, Fyfe C (2009) Review of clustering algorithms. Springer, Berlin Heidelb"},{"key":"8392_CR3","first-page":"17","volume":"15","author":"E Bajal","year":"2021","unstructured":"Bajal E, Katara V, Bhatia M, Hooda M (2021) A review of clustering algorithms: comparison of DBSCAN and K-mean with oversampling and t-SNE. Recent Patents Eng 15:17\u201331","journal-title":"Recent Patents Eng"},{"issue":"9","key":"8392_CR4","first-page":"2561","volume":"30","author":"M Hai","year":"2013","unstructured":"Hai M, Zhang SY, Yan-Lin MA (2013) Algorithm review of distributed clustering problem in distributed environments. Appl Res Comput 30(9):2561\u20132564","journal-title":"Appl Res Comput"},{"key":"8392_CR5","doi-asserted-by":"crossref","unstructured":"Djouzi K, Beghdad-Bey K (2019) A review of clustering algorithms for big data. In: international conference on networking and advanced systems","DOI":"10.1109\/ICNAS.2019.8807822"},{"key":"8392_CR6","unstructured":"Luo P, Huang Q, Tung A (2021) A generic distributed clustering framework for massive data"},{"key":"8392_CR7","doi-asserted-by":"crossref","unstructured":"Januzaj E, Kriegel HP, Pfeifle M (2004) DBDC: density based distributed clustering, DBLP","DOI":"10.1007\/978-3-540-30116-5_23"},{"issue":"1","key":"8392_CR8","first-page":"39","volume":"37","author":"LI Liu","year":"2010","unstructured":"Liu LI (2010) K-DmeansWM: an effective distributed clustering algorithm based on P2P. Comput Sci 37(1):39\u201341","journal-title":"Comput Sci"},{"key":"8392_CR9","unstructured":"Ester M (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc int conf knowledg Discov Data Min"},{"key":"8392_CR10","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. ACM SIGCOMM Comput Commun Rev 31(4)","DOI":"10.1145\/964723.383072"},{"key":"8392_CR11","doi-asserted-by":"publisher","first-page":"104232","DOI":"10.1109\/ACCESS.2020.2999085","volume":"8","author":"HC Ryu","year":"2020","unstructured":"Ryu HC, Jung S (2020) MapReduce-based distributed clustering method using CF+ tree. IEEE Access 8:104232\u2013104246","journal-title":"IEEE Access"},{"key":"8392_CR12","doi-asserted-by":"crossref","unstructured":"Sardar TH, Ansari Z (2021) MapReduce-based Fuzzy C-means algorithm for distributed document clustering","DOI":"10.1007\/s40031-021-00651-0"},{"key":"8392_CR13","first-page":"1","volume":"103","author":"TH Sardar","year":"2021","unstructured":"Sardar TH, Ansari Z (2021) Distributed big data clustering using MapReduce-based fuzzy C-medoids. J Inst Eng Ser B 103:1\u201310","journal-title":"J Inst Eng Ser B"},{"key":"8392_CR14","doi-asserted-by":"publisher","first-page":"e12827","DOI":"10.1111\/exsy.12827","volume":"39","author":"CM Dasari","year":"2022","unstructured":"Dasari CM, Bhukya R (2022) MapReduce paradigm: DNA sequence clustering based on repeats as features. Expert Syst 39:e12827","journal-title":"Expert Syst"},{"key":"8392_CR15","unstructured":"Hu QZYLJZKZQWL (2022) Parallel spectral clustering based on MapReduce. Zte Commun Technol English version no. 2"},{"key":"8392_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.3390\/data6070073","volume":"6","author":"AE Abdallah","year":"2021","unstructured":"Abdallah AE (2021) A robust distributed clustering of large data sets on a grid of commodity machines. Data 6:73","journal-title":"Data"},{"key":"8392_CR17","doi-asserted-by":"publisher","first-page":"105930","DOI":"10.1016\/j.knosys.2020.105930","volume":"199","author":"D Yu","year":"2020","unstructured":"Yu D, Ying Y, Ha Ng LZ, Liu C, Zheng H (2020) Balanced scheduling of distributed workflow tasks based on clustering. Knowledge-Based Syst 199:105930","journal-title":"Knowledge-Based Syst"},{"issue":"8","key":"8392_CR18","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1109\/TPDS.2020.2975550","volume":"31","author":"YA Geng","year":"2020","unstructured":"Geng YA, Li Q, Liang M, Chi CY, Tan J, Huang H (2020) Local-density subspace distributed clustering for high-dimensional data. IEEE Trans Parallel Distrib Syst 31(8):1799\u20131814","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"8392_CR19","unstructured":"Tong HE, Wei-Hong XU, Hong-Hua MA, Zeng SL (2019) An efficient distributed clustering algorithm based on peak density. Comput Technol Autom"},{"key":"8392_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-019-0207-2","volume":"6","author":"R Corizzo","year":"2019","unstructured":"Corizzo R, Pio G, Ceci M, Malerba D (2019) DENCAST: distributed density-based clustering for multi-target regression. J Big Data 6:1\u201327","journal-title":"J Big Data"},{"key":"8392_CR21","unstructured":"Januzaj E, Kriegel HP, Pfeifle M (2004) Towards effective and efficient distributed clustering. Work Clust Large Data Sets"},{"key":"8392_CR22","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.csi.2016.08.002","volume":"49","author":"S Demirci","year":"2017","unstructured":"Demirci S, Yardimci A, Sayit M, Tunali ET, Bulut H (2017) A hierarchical P2P clustering framework for video streaming systems. Comput Stand Interfaces 49:44\u201358","journal-title":"Comput Stand Interfaces"},{"key":"8392_CR23","unstructured":"Kai G, Liu Z (2008) A new efficient hierarchical distributed P2P clustering algorithm. In: fifth international conference on fuzzy systems & knowledge discovery"},{"issue":"8","key":"8392_CR24","first-page":"83","volume":"26","author":"L Yang","year":"2009","unstructured":"Yang L, Zhong C, Xiang-Yan LU (2009) Advances for distributed clustering algorithms based on P2P networks. Microelectron Comput 26(8):83\u201385","journal-title":"Microelectron Comput"},{"key":"8392_CR25","unstructured":"Mo H, Guo S (2010) A distributed node clustering mechanism in P2P networks. In: advanced data mining and applications-6th international conference, ADMA 2010, Chongqing, China, Proceedings, Part II, 19-21 November 2010"},{"key":"8392_CR26","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: international conference on scalable information systems","DOI":"10.1145\/1146847.1146886"},{"key":"8392_CR27","unstructured":"Jagadish HV (2005) BATON: a balanced tree structure for peer-to-peer networks. In: international conference on very large data bases"},{"key":"8392_CR28","unstructured":"Rowstron A (2003) Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Ifip\/acm Int Conf Distrib Syst Platforms Open Distrib Process, Springer, 2003"},{"key":"8392_CR29","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek F, Balakr-Ishnan H (2001) Chord: a scalable content-addressable network. In: Proc Acm Sigcomm","DOI":"10.1145\/383059.383071"},{"key":"8392_CR30","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s11704-013-3158-3","volume":"8","author":"Y He","year":"2014","unstructured":"He Y, Tan H, Luo W, Feng S, Fan J (2014) MR-DBSCAN: a scalable MapReduce-based DBSCAN algorithm for heavily skewed data. Front Comput Sci 8:83\u201399","journal-title":"Front Comput Sci"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08392-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-08392-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-08392-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T12:04:50Z","timestamp":1700136290000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-08392-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,3]]},"references-count":30,"journal-issue":{"issue":"35","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["8392"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-08392-5","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,3]]},"assertion":[{"value":"27 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no conflict of interest among the authors. Meanwhile, the authors declared that the work described was original research that had not previously been published and that the work was not being considered for publication elsewhere, in whole or in part.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"A copy of this manuscript has been read by all authors, and they are willing to proceed with its publication.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}},{"value":"The study in this manuscript does not require ethical approval.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}