Binary Dissimilarities and Clustering

We revisit partitioning criteria for binary observations and extend their analysis to general dissimilarities, weighted observations, and categorical attributes. Seven aggregation criteria are examined with consistent pair-counting conventions and explicit treatment of singleton classes. A deletion argument establishes monotonicity of the optimum as the number of nonempty classes increases. For the family |C|−α ∑ i

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-17
DOI
https://doi.org/10.5281/zenodo.23438303
Primary Topic
Advanced Clustering Algorithms Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Binary Dissimilarities and Clustering

Eduardo Piza, Javier Trejos
Zenodo (CERN European Organization for Nuclear Research)
Advanced Clustering Algorithms Research
preprint

Binary Dissimilarities and Clustering

Eduardo Piza, Javier Trejos
preprint en

Abstract

We revisit partitioning criteria for binary observations and extend their analysis to general dissimilarities, weighted observations, and categorical attributes. Seven aggregation criteria are examined with consistent pair-counting conventions and explicit treatment of singleton classes. A deletion argument establishes monotonicity of the optimum as the number of nonempty classes increases. For the family |C|−α ∑ i

Zenodo (CERN European Organization for Nuclear Research)
Universidad de Costa Rica (CR)
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.