{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T17:57:10Z","timestamp":1772301430422,"version":"3.50.1"},"reference-count":40,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T00:00:00Z","timestamp":1617321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Calculating and monitoring customer churn metrics is important for companies to retain customers and earn more profit in business. In this study, a churn prediction framework is developed by modified spectral clustering (SC). However, the similarity measure plays an imperative role in clustering for predicting churn with better accuracy by analyzing industrial data. The linear Euclidean distance in the traditional SC is replaced by the non-linear S-distance (Sd). The Sd is deduced from the concept of S-divergence (SD). Several characteristics of Sd are discussed in this work. Assays are conducted to endorse the proposed clustering algorithm on four synthetics, eight UCI, two industrial databases and one telecommunications database related to customer churn. Three existing clustering algorithms\u2014k-means, density-based spatial clustering of applications with noise and conventional SC\u2014are also implemented on the above-mentioned 15 databases. The empirical outcomes show that the proposed clustering algorithm beats three existing clustering algorithms in terms of its Jaccard index, f-score, recall, precision and accuracy. Finally, we also test the significance of the clustering results by the Wilcoxon\u2019s signed-rank test, Wilcoxon\u2019s rank-sum test, and sign tests. The relative study shows that the outcomes of the proposed algorithm are interesting, especially in the case of clusters of arbitrary shape.<\/jats:p>","DOI":"10.3390\/sym13040596","type":"journal-article","created":{"date-parts":[[2021,4,3]],"date-time":"2021-04-03T22:03:36Z","timestamp":1617487416000},"page":"596","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["An Enhanced Spectral Clustering Algorithm with S-Distance"],"prefix":"10.3390","volume":"13","author":[{"given":"Krishna","family":"Kumar Sharma","sequence":"first","affiliation":[{"name":"Department of Computer Science &amp; Engineering, PDPM Indian Institute of Information Technology, Design and Manufacturing, Jabalpur 482005, India"},{"name":"Department of Computer Science &amp; Informatics, University of Kota, Kota, Rajasthan 324022, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9939-2926","authenticated-orcid":false,"given":"Ayan","family":"Seal","sequence":"additional","affiliation":[{"name":"Department of Computer Science &amp; Engineering, PDPM Indian Institute of Information Technology, Design and Manufacturing, Jabalpur 482005, India"},{"name":"Center for Basic and Applied Science, Faculty of Informatics and Management, University of Hradec Kr\u00e1lov\u00e9, Hradec 50003 Kr\u00e1lov\u00e9, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7922-4984","authenticated-orcid":false,"given":"Enrique","family":"Herrera-Viedma","sequence":"additional","affiliation":[{"name":"Andalusian Research Institute in Data Science and Computational Intelligence (DaSCI), University of Granada, 18071 Granada, Spain"},{"name":"Faculty of Engineering, King Abdulaziz University, Jeddah 21589, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5992-2574","authenticated-orcid":false,"given":"Ondrej","family":"Krejcar","sequence":"additional","affiliation":[{"name":"Center for Basic and Applied Science, Faculty of Informatics and Management, University of Hradec Kr\u00e1lov\u00e9, Hradec 50003 Kr\u00e1lov\u00e9, Czech Republic"},{"name":"Malaysia-Japan International Institute of Technology (MJIIT), Universiti Teknologi Malaysia, Kuala Lumpur 54100, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,4,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIM.2020.3031835","article-title":"Facial Expression Recognition Using Local Gravitational Force Descriptor-Based Deep Convolution Neural Networks","volume":"70","author":"Mohan","year":"2020","journal-title":"IEEE Trans. Instrum. Meas."},{"key":"ref_2","first-page":"94","article-title":"Rethinking marketing","volume":"88","author":"Rust","year":"2010","journal-title":"Harv. Bus. Rev."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1016\/j.ejor.2010.10.019","article-title":"Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms","volume":"210","author":"Nobibon","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2826","DOI":"10.1016\/j.comcom.2007.05.024","article-title":"A survey on clustering algorithms for wireless sensor networks","volume":"30","author":"Abbasi","year":"2007","journal-title":"Comput. Commun."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/TEVC.2003.819264","article-title":"A novel evolutionary data mining algorithm with applications to churn prediction","volume":"7","author":"Au","year":"2003","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.eswa.2005.09.080","article-title":"Applying data mining to telecom churn management","volume":"31","author":"Hung","year":"2006","journal-title":"Expert Syst. Appl."},{"key":"ref_7","unstructured":"Hossein Javaheri, S. (2021, March 25). Response Modeling in Direct Marketing: A Data Mining Based Approach for Target Selection. Available online: https:\/\/www.researchgate.net\/publication\/292282619_Response_modeling_in_direct_marketing_A_data_mining_based_approach_for_target_selection."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/TCIAIG.2015.2401979","article-title":"Churn prediction in online games using players\u2019 login records: A frequency analysis approach","volume":"7","author":"Castro","year":"2015","journal-title":"IEEE Trans. Comput. Intell. Games"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"103928","DOI":"10.1016\/j.engappai.2020.103928","article-title":"Clustering analysis using an adaptive fused distance","volume":"96","author":"Sharma","year":"2020","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.dss.2014.03.001","article-title":"A data-driven approach to predict the success of bank telemarketing","volume":"62","author":"Moro","year":"2014","journal-title":"Decis. Support Syst."},{"key":"ref_11","first-page":"594","article-title":"Classification Of E-Customer Sessions Based On Support Vector Machine","volume":"15","author":"Suchacka","year":"2015","journal-title":"ECMS"},{"key":"ref_12","unstructured":"Suchacka, G., Skolimowska-Kulig, M., and Potempa, A. (2021, March 25). A k-Nearest Neighbors method for classifying user sessions in e-commerce scenario. J. Telecommun. Inf. Technol., Available online: https:\/\/yadda.icm.edu.pl\/baztech\/element\/bwmeta1.element.baztech-40e29335-8f5f-4d8c-aa93-8c13a90d1b2d."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/TSG.2014.2357343","article-title":"Potential of active demand reduction with residential wet appliances: A case study for Belgium","volume":"6","author":"Labeeuw","year":"2015","journal-title":"IEEE Trans. Smart Grid"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1109\/TII.2016.2541542","article-title":"Aggregation and remuneration of electricity consumers and producers for the definition of demand-response programs","volume":"12","author":"Faria","year":"2016","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1620","DOI":"10.1109\/TII.2016.2628747","article-title":"A fast density and grid based clustering method for data with arbitrary shapes and noise","volume":"13","author":"Wu","year":"2017","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s10257-016-0329-4","article-title":"Using association rules to assess purchase probability in online stores","volume":"15","author":"Suchacka","year":"2017","journal-title":"Inf. Syst. Bus. Manag."},{"key":"ref_17","unstructured":"Bottou, L., and Bengio, Y. (1995). Convergence Properties of the K-Means Algorithms, Advances in Neural Information Processing Systems."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"114326","DOI":"10.1016\/j.eswa.2020.114326","article-title":"Spectral embedded generalized mean based k-nearest neighbors clustering with s-distance","volume":"169","author":"Sharma","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_19","first-page":"1705","article-title":"Clustering with Bregman divergences","volume":"6","author":"Banerjee","year":"2005","journal-title":"J. Mach. Learn. Res."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Nock, R., Nielsen, F., and Amari, S.I. (2016). On conformal divergences and their population minimizers. IEEE Trans. Inf. Theory, 62.","DOI":"10.1109\/TIT.2015.2448072"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1162\/NECO_a_00547","article-title":"Spontaneous clustering via minimum gamma-divergence","volume":"26","author":"Notsu","year":"2014","journal-title":"Neural Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1007\/s11135-009-9240-0","article-title":"Using K-means method and spectral clustering technique in an outfitter\u2019s value analysis","volume":"44","author":"Chang","year":"2010","journal-title":"Qual. Quant."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2787","DOI":"10.1090\/proc\/12953","article-title":"Positive definite matrices and the S-divergence","volume":"144","author":"Sra","year":"2016","journal-title":"Proc. Am. Math. Soc."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A tutorial on spectral clustering","volume":"17","year":"2007","journal-title":"Stat. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"4358","DOI":"10.1016\/j.patcog.2012.05.007","article-title":"Fast semi-supervised clustering with enhanced spectral embedding","volume":"45","author":"Jiao","year":"2012","journal-title":"Pattern Recognit."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1690","DOI":"10.1109\/TPAMI.2012.237","article-title":"Learning full pairwise affinities for spectral segmentation","volume":"35","author":"Kim","year":"2013","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.neucom.2011.09.002","article-title":"Spectral clustering: A semi-supervised approach","volume":"77","author":"Chen","year":"2012","journal-title":"Neurocomputing"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TPAMI.1984.4767478","article-title":"K-means-type algorithms: A generalized convergence theorem and characterization of local optimality","volume":"1","author":"Selim","year":"1984","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.engappai.2018.03.023","article-title":"Reliable writer identification in medieval manuscripts through page layout features: The \u201cAvila\u201d Bible case","volume":"72","author":"Maniaci","year":"2018","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_31","unstructured":"Dheeru, D., and Karra Taniskidou, E. (2017). UCI Machine Learning Repository, UCI."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"6893","DOI":"10.1007\/s00521-018-3523-0","article-title":"Real-time prediction of online shoppers\u2019 purchasing intention using multilayer perceptron and LSTM recurrent neural networks","volume":"31","author":"Sakar","year":"2019","journal-title":"Neural Comput. Appl."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.eswa.2019.06.050","article-title":"Modeling uncertain data using Monte Carlo integration method for clustering","volume":"137","author":"Sharma","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"106016","DOI":"10.1016\/j.asoc.2019.106016","article-title":"Fuzzy c-means clustering using Jeffreys-divergence based similarity measure","volume":"88","author":"Seal","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.ins.2020.08.080","article-title":"Multi-view spectral clustering for uncertain objects","volume":"547","author":"Sharma","year":"2021","journal-title":"Inf. Sci."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","article-title":"An introduction to ROC analysis","volume":"27","author":"Fawcett","year":"2006","journal-title":"Pattern Recognit. Lett."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"55121","DOI":"10.1109\/ACCESS.2019.2910195","article-title":"Fuzzy k-means using non-linear s-distance","volume":"7","author":"Karlekar","year":"2019","journal-title":"IEEE Access"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"106567","DOI":"10.1016\/j.knosys.2020.106567","article-title":"Outlier-robust multi-view clustering for uncertain data","volume":"211","author":"Sharma","year":"2021","journal-title":"Knowl. Based Syst."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., and Pfeifle, M. (2005, January 21\u201324). Density-based clustering of uncertain data. Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, Chicago, IL, USA.","DOI":"10.1145\/1081870.1081955"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1111\/insr.12095_3","article-title":"Nonparametric Statistics: A Step-by-Step Approach","volume":"83","author":"Richardson","year":"2015","journal-title":"Int. Stat. Rev."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/4\/596\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:11:09Z","timestamp":1760364669000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/4\/596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,2]]},"references-count":40,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2021,4]]}},"alternative-id":["sym13040596"],"URL":"https:\/\/doi.org\/10.3390\/sym13040596","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,2]]}}}