{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:34:52Z","timestamp":1762868092883,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:00:00Z","timestamp":1584489600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Background: A common task in machine learning is clustering data into different groups based on similarities. Clustering methods can be divided in two groups: linear and nonlinear. A commonly used linear clustering method is K-means. Its extension, kernel K-means, is a non-linear technique that utilizes a kernel function to project the data to a higher dimensional space. The projected data will then be clustered in different groups. Different kernels do not perform similarly when they are applied to different datasets. Methods: A kernel function might be relevant for one application but perform poorly to project data for another application. In turn choosing the right kernel for an arbitrary dataset is a challenging task. To address this challenge, a potential approach is aggregating the clustering results to obtain an impartial clustering result regardless of the selected kernel function. To this end, the main challenge is how to aggregate the clustering results. A potential solution is to combine the clustering results using a weight function. In this work, we introduce Weighted Mutual Information (WMI) for calculating the weights for different clustering methods based on their performance to combine the results. The performance of each method is evaluated using a training set with known labels. Results: We applied the proposed Weighted Mutual Information to four data sets that cannot be linearly separated. We also tested the method in different noise conditions. Conclusions: Our results show that the proposed Weighted Mutual Information method is impartial, does not rely on a single kernel, and performs better than each individual kernel specially in high noise.<\/jats:p>","DOI":"10.3390\/e22030351","type":"journal-article","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T03:54:14Z","timestamp":1584590054000},"page":"351","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Weighted Mutual Information for Aggregated Kernel Clustering"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9397-1807","authenticated-orcid":false,"given":"Nezamoddin N.","family":"Kachouie","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Florida Institute of Technology, Melbourne, FL 32901, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1454-2962","authenticated-orcid":false,"given":"Meshal","family":"Shutaywi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, King Abdulaziz University, Rabigh 21911, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"key":"ref_1","unstructured":"Kassambara, A. (2020, March 17). Practical Guide to Cluster Analysis in R: Unsupervised Machine Learning. Available online: http:\/www.sthda.com."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/A:1023949509487","article-title":"Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data","volume":"52","author":"Monti","year":"2003","journal-title":"Mach. Learn."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","article-title":"Data clustering: A review","volume":"31","author":"Jain","year":"1999","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Guan, Y., and Kulis, B. (2004). Kernel k-means: Spectral clustering and normalized cuts. Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM.","DOI":"10.1145\/1014052.1014118"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Wu, J. (2012). Advances in K-means Clustering: A Data Mining Thinking, Springer Science & Business Media.","DOI":"10.1007\/978-3-642-29807-3"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Han, E.H., Boley, D., Gini, M., Gross, R., Hastings, K., Karypis, G., Kumar, V., Mobasher, B., and Moore, J. (1998). Webace: A web agent for document categorization and exploration. Proceedings of the Second International Conference on Autonomous Agents, ACM.","DOI":"10.1145\/280765.280872"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Nguyen, N., and Caruana, R. (2007, January 28\u201331). Consensus clusterings. Proceedings of the Seventh IEEE International Conference on Data Mining (ICDM 2007), Omaha, NE, USA.","DOI":"10.1109\/ICDM.2007.73"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Borcard, D., Gillet, F., and Legendre, P. (2011). Numerical Ecology with R, Springer Science & Business Media.","DOI":"10.1007\/978-1-4419-7976-6"},{"key":"ref_9","unstructured":"Legendre, P., and Legendre, L. (1998). Numerical Ecology: Developments in Environmental Modelling, Elsevier. [2nd ed.]."},{"key":"ref_10","unstructured":"Arthur, D., and Vassilvitskii, S. (2007). k-means++: The advantages of careful seeding. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"De La Vega, W.F., Karpinski, M., Kenyon, C., and Rabani, Y. (2003). Approximation schemes for clustering problems. Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, ACM.","DOI":"10.1145\/780542.780550"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., and Mazumdar, S. (2004). On coresets for k-means and k-median clustering. Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of computing, ACM.","DOI":"10.1145\/1007352.1007400"},{"key":"ref_13","unstructured":"Kumar, A., Sabharwal, Y., and Sen, S. (2004, January 17\u201319). A simple linear time (1+\/spl epsiv\/)-approximation algorithm for k-means clustering in any dimensions. Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, Rome, Italy."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s004540010019","article-title":"On approximate geometric k-clustering","volume":"24","year":"2000","journal-title":"Discrete & Computational Geometry"},{"key":"ref_15","unstructured":"Shutaywi, M., and Kachouie, N.N. (2018, January 3\u20135). A Weighted Majority Voting based on Normalized Mutual Information for Cluster Analysis. Proceedings of the Fifteenth International Symposium on Artificial Intelligence and Mathematics (ISAIM), Fort Lauderdale, FL, USA."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Kv\u00e5lseth, T. (2017). On normalized mutual information: Measure derivations and properties. Entropy, 19.","DOI":"10.3390\/e19110631"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s41237-018-0075-7","article-title":"Understanding information theoretic measures for comparing clusterings","volume":"46","author":"Warrens","year":"2019","journal-title":"Behaviormetrika"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1111\/coin.12100","article-title":"Correction for closeness: Adjusting normalized mutual information measure for clustering comparison","volume":"33","author":"Amelio","year":"2017","journal-title":"Comput. Intell."},{"key":"ref_19","unstructured":"Ranganathan, S., Nakai, K., and Schonbach, C. (2018). Encyclopedia of Bioinformatics and Computational Biology: ABC of Bioinformatics, Elsevier. Chapter\u2014Data Mining: Clustering by Amelio, A.; Tagarelli, A."},{"key":"ref_20","first-page":"155","article-title":"An introduction to kernel methods","volume":"66","author":"Campbell","year":"2001","journal-title":"Studies in Fuzziness and Soft Computing"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1080\/07357907.2019.1667368","article-title":"Identifying Similarities and Disparities Between DNA Copy Number Changes in Cancer and Matched Blood Samples","volume":"37","author":"Kachouie","year":"2019","journal-title":"Cancer Investig."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1080\/07357907.2020.1719501","article-title":"Discriminant Analysis of Lung Cancer Using Nonlinear Clustering of Copy Numbers","volume":"38","author":"Kachouie","year":"2020","journal-title":"Cancer Investig."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Nemenman, I., Shafee, F., and Bialek, W. (2002). Entropy and inference, revisited. Advances in Neural Information Processing Systems, MIT Press.","DOI":"10.7551\/mitpress\/1120.003.0065"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/3\/351\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:07:41Z","timestamp":1760173661000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/3\/351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,18]]},"references-count":23,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,3]]}},"alternative-id":["e22030351"],"URL":"https:\/\/doi.org\/10.3390\/e22030351","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2020,3,18]]}}}