Instance Selection for Hybrid and Incomplete Data based on Clustering

This paper presents the HICCS algorithm, a novel clustering approach that handles mixed and incomplete data. HICCS improves clustering by using compact sets as initial clusters, employing holotypes to measure intergroup dissimilarity, and merging clusters based on similarity in an order-independent manner. Additionally, it incorporates a user-defined similarity function, making it adaptable to various real-world domains. Furthermore, we introduce the IS-HICCS algorithm for instance selection, which reduces the instance set without compromising classifier accuracy, highlighting clustering's potential to enhance supervised classification models. We evaluate HICCS and IS-HICCS on synthetic and real-life datasets, showing their statistically superior performance compared to other clustering and instance selection methods, respectively

Authors

Institutions

Publication Details

Journal
International Journal of Combinatorial Optimization Problems and Informatics.
Published
2025-07-14
DOI
https://doi.org/10.61467/2007.1558.2025.v16i3.845
Primary Topic
Data Mining Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Instance Selection for Hybrid and Incomplete Data based on Clustering

Oscar Camacho-Nieto, Yenny Villuendas-Rey, Claudia C. Tusell-Rey, Cornelio Yáñez-Márquéz et al.
International Journal of Combinatorial Optimization Problems and Informatics.
Data Mining Algorithms and Applications
article

Instance Selection for Hybrid and Incomplete Data based on Clustering

Oscar Camacho-Nieto, Yenny Villuendas-Rey, Claudia C. Tusell-Rey, Cornelio Yáñez-Márquéz, Viridiana Salinas-García
article en

Abstract

This paper presents the HICCS algorithm, a novel clustering approach that handles mixed and incomplete data. HICCS improves clustering by using compact sets as initial clusters, employing holotypes to measure intergroup dissimilarity, and merging clusters based on similarity in an order-independent manner. Additionally, it incorporates a user-defined similarity function, making it adaptable to various real-world domains. Furthermore, we introduce the IS-HICCS algorithm for instance selection, which reduces the instance set without compromising classifier accuracy, highlighting clustering's potential to enhance supervised classification models. We evaluate HICCS and IS-HICCS on synthetic and real-life datasets, showing their statistically superior performance compared to other clustering and instance selection methods, respectively

International Journal of Combinatorial Optimization Problems and Informatics.Vol. 16(3)
Instituto Politécnico Nacional (MX)
Openalex Percentile: Top 75%
Data Mining Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Instance Selection for Hybrid and Incomplete Data based on Clustering — Oscar Camacho-Nieto, Yenny Villuendas-Rey, et al. · International Journal of Combinatorial Optimization Problems and Informatics. (2025) | TGRS Research Map | TGRS