{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T09:04:45Z","timestamp":1750064685241,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T00:00:00Z","timestamp":1670198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T00:00:00Z","timestamp":1670198400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Scientific Research Project of Tianjin Educational Committee","award":["2021KJ182"],"award-info":[{"award-number":["2021KJ182"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Kmeans clustering algorithm is widely used for the advantages of simplicity and efficient operation. However, the lack of clustering centers in the algorithm usually causes incorrect category of some discrete points. Therefore, in order to obtain more accurate clustering results when studying the factors affecting the professional growth of outstanding teachers, this paper proposes an improved algorithm of Kmeans combined with DBSCAN. Observing the clustering results of the influencing factors and calculating the evaluation standard values of the clustering results, it is found that the optimized DB-Kmeans algorithm has obvious improvements in the accuracy of the clustering results, and the clustering effect of the algorithm on edge points is more advantageous than the original algorithms according to the scatter diagram.<\/jats:p>","DOI":"10.1186\/s13634-022-00948-2","type":"journal-article","created":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T07:03:04Z","timestamp":1670223784000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Analysis of influencing factors on excellent teachers' professional growth based on DB-Kmeans method"],"prefix":"10.1186","volume":"2022","author":[{"given":"Xu","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4257-7740","authenticated-orcid":false,"given":"Xiaoming","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tingting","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yueyuan","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,5]]},"reference":[{"key":"948_CR1","volume-title":"Research on Passenger Car Passenger Order Scheduling Based on Canopy-Kmeans Algorithm","author":"Y Wu","year":"2020","unstructured":"Y. Wu, Research on Passenger Car Passenger Order Scheduling Based on Canopy-Kmeans Algorithm (Shanxi University, 2020)"},{"key":"948_CR2","volume-title":"An Improved K-means Clustering Algorithm and a New Clustering Effectiveness Index Research","author":"X Gao","year":"2020","unstructured":"X. Gao, An Improved K-means Clustering Algorithm and a New Clustering Effectiveness Index Research (Anhui University, 2020)"},{"unstructured":"M. Yan, X. Xie, W. Li, D. Wu, X. Cui, S. Pan, Morphological clustering algorithm of typical load curve based on Gaussian kernel density estimation. Electr. Meas. Instrum. 1\u20138 (2022). https:\/\/kns.cnki.net\/kcms\/detail\/detail.aspx?dbcode=CAPJ%26dbname=CAPJLAST%26filename=DCYQ20210316003%26uniplatform=NZKPT%26v=fzYhayA03xb9KgYHcfE22jsZ7B3eNVIqtoqr0ToI60YAoWnfgwuDsWQj7-MOLMZ","key":"948_CR3"},{"doi-asserted-by":"publisher","unstructured":"G. HimaBindu, Ch. Raghu Kumar, C. H. Hemanand, N. Rama Krishna, Hybrid clustering algorithm to process big data using firefly optimization mechanism. Mater. Today Proc. (2020). https:\/\/doi.org\/10.1016\/j.matpr.2020.10.273","key":"948_CR4","DOI":"10.1016\/j.matpr.2020.10.273"},{"doi-asserted-by":"publisher","unstructured":"N. Valarmathy, S. Krishnaveni, A novel method to enhance the performance evaluation of DBSCAN clustering algorithm using different distinguished metrics. Mater. Today Proc. (2020). https:\/\/doi.org\/10.1016\/j.matpr.2020.09.623","key":"948_CR5","DOI":"10.1016\/j.matpr.2020.09.623"},{"issue":"3","key":"948_CR6","doi-asserted-by":"publisher","first-page":"2099","DOI":"10.1007\/s11277-017-5044-z","volume":"102","author":"G Manogaran","year":"2018","unstructured":"G. Manogaran, V. Vijayakumar, R. Varatharajan, P.M. Kumar, R. Sundarasekar, C.-H. Hsu, Machine learning based big data processing framework for cancer diagnosis using hidden Markov model and GM clustering. Wirel. Pers. Commun. 102(3), 2099\u20132116 (2018)","journal-title":"Wirel. Pers. Commun."},{"key":"948_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.knosys.2019.04.020","volume":"178","author":"W Jia","year":"2019","unstructured":"W. Jia, Y. Tan, L. Liu, J. Li, H. Zhang, K. Zhao, Hierarchical prediction based on two-level Gaussian mixture model clustering for bike-sharing system. Knowl.-Based Syst. 178, 84\u201397 (2019)","journal-title":"Knowl.-Based Syst."},{"issue":"21","key":"948_CR8","doi-asserted-by":"publisher","first-page":"7163","DOI":"10.3390\/s21217163","volume":"21","author":"J Zhong","year":"2021","unstructured":"J. Zhong, D. Hai, J. Cheng, C. Jiao, S. Gou, Y. Liu, H. Zhou, W. Zhu, Convolutional autoencoding and Gaussian mixture clustering for unsupervised beat-to-beat heart rate estimation of electrocardiograms from wearable sensors. Sensors 21(21), 7163 (2021)","journal-title":"Sensors"},{"issue":"1","key":"948_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1088\/1742-6596\/2010\/1\/012060","volume":"2010","author":"Y Shi","year":"2021","unstructured":"Y. Shi, S. Yan, M. He, X. Li, Hybrid data mining method of telecom customer based on improved Kmeans and XGBoost. J. Phys. Conf. Ser. 2010(1), 120 (2021)","journal-title":"J. Phys. Conf. Ser."},{"unstructured":"T. Li, Research on patent text clustering based on improved k-means algorithm. Hebei University of Engineering (2020)","key":"948_CR10"},{"issue":"05","key":"948_CR11","first-page":"152","volume":"36","author":"J Xiaoyun","year":"2018","unstructured":"J. Xiaoyun, Ru. Zheng, C. Jingxia, An EEG emotion recognition method based on multi-feature extraction. J. Shaanxi Univ. Sci. Technol. 36(05), 152\u2013158 (2018)","journal-title":"J. Shaanxi Univ. Sci. Technol."}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-022-00948-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13634-022-00948-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-022-00948-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T07:13:00Z","timestamp":1670224380000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-022-00948-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,5]]},"references-count":11,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["948"],"URL":"https:\/\/doi.org\/10.1186\/s13634-022-00948-2","relation":{},"ISSN":["1687-6180"],"issn-type":[{"type":"electronic","value":"1687-6180"}],"subject":[],"published":{"date-parts":[[2022,12,5]]},"assertion":[{"value":"31 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"117"}}