José Nataniel Andrade de Sá , Marcelo Rodrigo Portela Ferreira , Francisco de Assis Tenorio de Carvalho
{"title":"Kernel clustering with automatic variable weighting for interval data","authors":"José Nataniel Andrade de Sá , Marcelo Rodrigo Portela Ferreira , Francisco de Assis Tenorio de Carvalho","doi":"10.1016/j.neucom.2025.130849","DOIUrl":null,"url":null,"abstract":"<div><div>Symbolic Data Analysis (SDA) is a field associated with statistics and artificial intelligence that deals with multi-valued data, such as histograms, intervals, and lists. This type of data emerges as an alternative to conventional aggregation methods (mean, median, and mode) to account for variability. It is particularly useful when analyzing groups of individuals rather than single individuals. For example, when we have information about patients but aim to describe and analyze hospitals. Kernel functions are extensively employed in clustering algorithms because they perform better when there is no linear separability between clusters and/or the clusters are not hyperspherical. This paper proposes new clustering methods based on the Gaussian kernel that weigh the interval-valued variables automatically. These methods are particularly appropriate when there are non-informative variables or variables relevant to specific clusters. We introduce four global variants, in which each variable has the same weight across all clusters, and two local variants, where variable weights differ for each cluster. Although local methods offer greater flexibility in the weighting scheme, global methods are less susceptible to local minima. Experimental evaluation over simulated and real interval-valued datasets, compared to traditional clustering methods for interval data, demonstrated the effectiveness of the introduced algorithms. The source code and datasets are available at <span><span>https://github.com/Natandradesa/Kernel-Clustering-for-Interval-Data</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"650 ","pages":"Article 130849"},"PeriodicalIF":6.5000,"publicationDate":"2025-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231225015218","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Symbolic Data Analysis (SDA) is a field associated with statistics and artificial intelligence that deals with multi-valued data, such as histograms, intervals, and lists. This type of data emerges as an alternative to conventional aggregation methods (mean, median, and mode) to account for variability. It is particularly useful when analyzing groups of individuals rather than single individuals. For example, when we have information about patients but aim to describe and analyze hospitals. Kernel functions are extensively employed in clustering algorithms because they perform better when there is no linear separability between clusters and/or the clusters are not hyperspherical. This paper proposes new clustering methods based on the Gaussian kernel that weigh the interval-valued variables automatically. These methods are particularly appropriate when there are non-informative variables or variables relevant to specific clusters. We introduce four global variants, in which each variable has the same weight across all clusters, and two local variants, where variable weights differ for each cluster. Although local methods offer greater flexibility in the weighting scheme, global methods are less susceptible to local minima. Experimental evaluation over simulated and real interval-valued datasets, compared to traditional clustering methods for interval data, demonstrated the effectiveness of the introduced algorithms. The source code and datasets are available at https://github.com/Natandradesa/Kernel-Clustering-for-Interval-Data.
期刊介绍:
Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.