{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:24:21Z","timestamp":1743067461759,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031212437"},{"type":"electronic","value":"9783031212444"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21244-4_29","type":"book-chapter","created":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T20:06:23Z","timestamp":1668110783000},"page":"390-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive K-means Algorithm Based on\u00a0Three-Way Decision"],"prefix":"10.1007","author":[{"given":"Yihang","family":"Peng","sequence":"first","affiliation":[]},{"given":"Qinghua","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhihua","family":"Ai","sequence":"additional","affiliation":[]},{"given":"Xuechao","family":"Zhi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,11]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"961","DOI":"10.32604\/iasc.2020.010128","volume":"26","author":"YL Wang","year":"2020","unstructured":"Wang, Y.L., Luo, X., Zhang, J.: An improved algorithm of k-means based on evolutionary computation. Intell. Autom. Soft Comput. 26, 961\u2013971 (2020)","journal-title":"Intell. Autom. Soft Comput."},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10489-019-01583-5","volume":"50","author":"F Yuan","year":"2020","unstructured":"Yuan, F., Yang, Y.L., Yuan, T.T.: A dissimilarity measure for mixed nominal and ordinal attribute data in k-modes algorithm. Appl. Intell. 50, 1\u201312 (2020)","journal-title":"Appl. Intell."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.bdr.2017.09.002","volume":"11","author":"B Lorbeer","year":"2018","unstructured":"Lorbeer, B., Kosareva, A., Deva, B.: Variations on the clustering algorithm BIRCH. Big Data Res. 11, 44\u201353 (2018)","journal-title":"Big Data Res."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Li, Y.F., Jiang, H.T., Lu, J.Y.: MR-BIRCH: a scalable mapreduce-based BIRCH clustering algorithm. J. Intell. Fuzzy Syst. 40, 5295\u20135305 (2021)","DOI":"10.3233\/JIFS-202079"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10044-019-00809-z","volume":"23","author":"R Scitovski","year":"2020","unstructured":"Scitovski, R., Sabo, K.: DBSCAN-like clustering method for various data densities. Pattern Anal. Appl. 23, 541\u2013554 (2020)","journal-title":"Pattern Anal. Appl."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.3390\/sym12071168","volume":"12","author":"JL Lin","year":"2020","unstructured":"Lin, J.L., Kuo, J., Chuang, H.: Improving density peak clustering by automatic peak selection and single linkage clustering. Symmetry 12, 1168 (2020)","journal-title":"Symmetry"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Zhang, H.R., Fan, M., Shi, B.: Regression-based three-way recommendation. Info. Sci. 37, 444\u2013461 (2017). https:\/\/cn.overleaf.com\/project8","DOI":"10.1016\/j.ins.2016.03.019"},{"key":"29_CR8","unstructured":"Li, L., Jin, Q., Yao, B., Wu, J.: A rough set model based on fuzzifying neighborhood systems. Soft. Comput. 52, 2381\u20132410 (2020)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ins.2020.05.039","volume":"535","author":"XL Chu","year":"2020","unstructured":"Chu, X.L., Sun, B.Z., Li, X.: Neighborhood rough set-based three-way clustering considering attribute correlations: an approach to classification of potential gout groups. Inf. Sci. 535, 28\u201341 (2020)","journal-title":"Inf. Sci."},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.knosys.2018.04.029","volume":"155","author":"PX Wang","year":"2018","unstructured":"Wang, P.X., Yao, Y.Y.: CE3: a three-way clustering method based on mathematical morphology. Knowl.-Based Syst. 155, 54\u201365 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.knosys.2015.05.028","volume":"91","author":"H Yu","year":"2016","unstructured":"Yu, H., Zhang, C., Wang, G.Y.: A tree-based incremental overlapping clustering method using the three-way decision theory. Knowl.-Based Syst. 91, 189\u2013203 (2016)","journal-title":"Knowl.-Based Syst."},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1007\/s13042-019-00988-5","volume":"11","author":"H Yu","year":"2020","unstructured":"Yu, H., Chang, Z.H., Wang, G.Y.: An efficient three-way clustering algorithm based on gravitational search. Int. J. Mach. Learn. Cybern. 11, 1003\u20131016 (2020)","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"33944","DOI":"10.1109\/ACCESS.2021.3057405","volume":"9","author":"PX Wang","year":"2021","unstructured":"Wang, P.X., Yang, X.B.: Three-way clustering method based on stability. IEEE Access. 9, 33944\u201333953 (2021)","journal-title":"IEEE Access."},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.ins.2009.09.021","volume":"180","author":"YY Yao","year":"2010","unstructured":"Yao, Y.Y.: Three-way decisions with probabilistic rough sets. Inf. Sci. 180, 341\u2013353 (2010)","journal-title":"Inf. Sci."},{"key":"29_CR15","doi-asserted-by":"publisher","unstructured":"Yu, H.: A framework of three-way cluster analysis. In: Rough Sets, IJCRS 2017, vol. 10314, pp. 300\u2013312 (2017). https:\/\/doi.org\/10.1007\/978-3-319-60840-2-22","DOI":"10.1007\/978-3-319-60840-2-22"},{"key":"29_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106532","volume":"211","author":"H Yu","year":"2021","unstructured":"Yu, H., Chen, L.Y., Yao, J.T.: A three-way density peak clustering method based on evidence theory. Knowl.-Based Syst. 211, 106532 (2021)","journal-title":"Knowl.-Based Syst."},{"key":"29_CR17","doi-asserted-by":"publisher","unstructured":"Yu, H., Su, T., Zeng, X.H.: A three-way decisions clustering algorithm for incomplete Data. In: Rough Sets and Knowledge Technology, RSKT 2014, vol. 8818, pp. 765\u2013776 (2014). https:\/\/doi.org\/10.1007\/978-3-319-11740-9","DOI":"10.1007\/978-3-319-11740-9"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ijar.2019.09.001","volume":"115","author":"H Yu","year":"2019","unstructured":"Yu, H., Yun, C., Lingras, P.: A three-way cluster ensemble approach for large-scale data. Int. J. Approx. Reason. 115, 32\u201349 (2019)","journal-title":"Int. J. Approx. Reason."},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ijar.2018.04.001","volume":"98","author":"MK Afridi","year":"2018","unstructured":"Afridi, M.K., Azam, N., Yao, J.T.: A three-way clustering approach for handling missing data using GTRS. Int. J. Approx. Reason. 98, 11\u201324 (2018)","journal-title":"Int. J. Approx. Reason."},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Yu, H, Chen, L.Y., Yao J.T.: A three-way clustering method based on an improved DBSCAN Algorithm. Physica A: Stat. Mech. Appl. 535, 122289 (2019)","DOI":"10.1016\/j.physa.2019.122289"},{"key":"29_CR21","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1016\/j.ins.2018.03.009","volume":"507","author":"H Yu","year":"2020","unstructured":"Yu, H., Wang, X.C., Wang, G.Y.: An active three-way clustering method via low-rank matrices for multi-view data. Inf. Sci. 507, 823\u2013839 (2020)","journal-title":"Inf. Sci."},{"issue":"10","key":"29_CR22","doi-asserted-by":"publisher","first-page":"2767","DOI":"10.1007\/s13042-018-0901-y","volume":"10","author":"P Wang","year":"2019","unstructured":"Wang, P., Shi, H., Yang, X., Mi, J.: Three-way k-means: integrating k-means and three-way decision. Int. J. Mach. Learn. Cybern. 10(10), 2767\u20132777 (2019). https:\/\/doi.org\/10.1007\/s13042-018-0901-y","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"29_CR23","first-page":"31","volume":"5","author":"H Yu","year":"2016","unstructured":"Yu, H.: Three-way cluster analysis. Peak Data Sci. 5, 31\u201335 (2016)","journal-title":"Peak Data Sci."},{"key":"29_CR24","first-page":"18","volume":"106","author":"CZ Wang","year":"2019","unstructured":"Wang, C.Z., Shi, Y.P., Fan, X.D.: Attribute reduction based on k-nearest neighborhood rough sets. Acoustic Bull. 106, 18\u201331 (2019)","journal-title":"Acoustic Bull."},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-7373(88)80032-4","volume":"29","author":"Z Pawlak","year":"1988","unstructured":"Pawlak, Z., Wong, S.K.M., Ziarko, W.: Rough sets: probabilistic versus deterministic approach. Int. J. Man Mach. Stud. 29, 81\u201395 (1988)","journal-title":"Int. J. Man Mach. Stud."},{"key":"29_CR26","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.15672\/hujms.662711","volume":"49","author":"PK Singh","year":"2020","unstructured":"Singh, P.K., Tiwari, S.: Topological structures in rough set theory: a survey. Hacettepe J. Math. Stat. 49, 1270\u20131294 (2020)","journal-title":"Hacettepe J. Math. Stat."},{"key":"29_CR27","first-page":"248","volume":"27","author":"JR Xia","year":"2012","unstructured":"Xia, J.R.: The granular accuracy of approximation for the rough sets. Appl. Math. A J. Chin. 27, 248\u2013252 (2012)","journal-title":"Appl. Math. A J. Chin."},{"key":"29_CR28","doi-asserted-by":"publisher","first-page":"640","DOI":"10.3724\/SP.J.1001.2008.00640","volume":"19","author":"QH Hu","year":"2018","unstructured":"Hu, Q.H., Yu, D.R., Xie, Z.X.: Numerical attribute based on neighborhood granulation and rough approximation. J. Softw. 19, 640\u2013649 (2018)","journal-title":"J. Softw."},{"key":"29_CR29","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ins.2020.05.079","volume":"539","author":"Y Xu","year":"2020","unstructured":"Xu, Y., Tang, J.X., Wang, X.S.: Three sequential multi-class three-way decision models. Inf. Sci. 539, 62\u201390 (2020)","journal-title":"Inf. Sci."},{"key":"29_CR30","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.knosys.2018.01.031","volume":"145","author":"G Zhang","year":"2018","unstructured":"Zhang, G., Zhang, C.C., Zhang, H.Y.: Improved k-means algorithm based on density canopy. Knowl.-Based Syst. 145, 289\u2013297 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"29_CR31","unstructured":"Dua, D., Graff, C.: UCI Machine Learning Repository (2019). http:\/\/archive.ics.uci.edu\/ml"},{"issue":"12","key":"29_CR32","doi-asserted-by":"publisher","first-page":"4743","DOI":"10.1007\/s10489-018-1238-7","volume":"48","author":"P Fr\u00e4nti","year":"2018","unstructured":"Fr\u00e4nti, P., Sieranoja, S.: K-means properties on six clustering benchmark datasets. Appl. Intell. 48(12), 4743\u20134759 (2018). https:\/\/doi.org\/10.1007\/s10489-018-1238-7","journal-title":"Appl. Intell."},{"key":"29_CR33","doi-asserted-by":"publisher","first-page":"180336","DOI":"10.1109\/ACCESS.2019.2954086","volume":"7","author":"H Wang","year":"2019","unstructured":"Wang, H., Chai, X.H.: Sequential three-way decision of tolerance-based multi-granularity fuzzy-rough sets. IEEE Access 7, 180336\u2013180348 (2019)","journal-title":"IEEE Access"},{"key":"29_CR34","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ins.2019.09.026","volume":"510","author":"SY Zhang","year":"2020","unstructured":"Zhang, S.Y., Li, S.G., Yang, H.L.: Three-way convex systems and three-way fuzzy convex systems. Inf. Sci. 510, 89\u201398 (2020)","journal-title":"Inf. Sci."},{"key":"29_CR35","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.1007\/s00500-020-05247-2","volume":"25","author":"M Sivaguru","year":"2021","unstructured":"Sivaguru, M., Punniyamoorthy, M.: Performance-enhanced rough k-means clustering algorithm. Soft. Comput. 25, 1595\u20131616 (2021)","journal-title":"Soft. Comput."}],"container-title":["Lecture Notes in Computer Science","Rough Sets"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21244-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:07:28Z","timestamp":1709831248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21244-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031212437","9783031212444"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21244-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCRS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rough Sets","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Suzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcrs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ijcrs2022.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","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":"28","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":"67% - 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","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":"2","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)"}}]}}