Nonparametric Density-Based Clustering of Mixed Data

We discuss a general extension of nonparametric clustering to mixed-type data. The approach relies on a suitable density function defined directly on mixed-type spaces and estimated nonparametrically via a generalized product kernel estimator, which handles variables of different types without requiring latent representations or data transformations. Clusters are then associated with the maximum connected components of the estimated upper level sets, approximated through a k−nearest neighbor graph built on the dissimilarity induced by the kernel itself. This ensures that the geometry governing level set connectivity is coherent with that underlying the density estimator. As in the continuous case, varying the density threshold yields the estimated cluster tree that, in the current framework, is recast as a cluster forest and whose consistency we establish. The proposed procedure proves to be effective in practical applications, offering a flexible and coherent framework for clustering datasets with heterogeneous variable types.

Authors

Institutions

Publication Details

Journal
Measurement Interdisciplinary Research and Perspectives
Published
2026-10-26
DOI
https://doi.org/10.1080/15366367.2026.2744712
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Nonparametric Density-Based Clustering of Mixed Data

Giovanna Menardi, Noemi Corsini
1 links
Measurement Interdisciplinary Research and Perspectives
Advanced Clustering Algorithms Research
article

Nonparametric Density-Based Clustering of Mixed Data

Giovanna Menardi, Noemi Corsini
article en

Abstract

We discuss a general extension of nonparametric clustering to mixed-type data. The approach relies on a suitable density function defined directly on mixed-type spaces and estimated nonparametrically via a generalized product kernel estimator, which handles variables of different types without requiring latent representations or data transformations. Clusters are then associated with the maximum connected components of the estimated upper level sets, approximated through a k−nearest neighbor graph built on the dissimilarity induced by the kernel itself. This ensures that the geometry governing level set connectivity is coherent with that underlying the density estimator. As in the continuous case, varying the density threshold yields the estimated cluster tree that, in the current framework, is recast as a cluster forest and whose consistency we establish. The proposed procedure proves to be effective in practical applications, offering a flexible and coherent framework for clustering datasets with heterogeneous variable types.

Measurement Interdisciplinary Research and Perspectives
University of Padua (IT), University of Cambridge (GB)
Openalex Percentile: Top 14%
Advanced Clustering Algorithms Research
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.

Laika access coming soon
Nonparametric Density-Based Clustering of Mixed Data — Giovanna Menardi, Noemi Corsini · Measurement Interdisciplinary Research and Perspectives (2026) | TGRS Research Map | TGRS