arXiv AI By Yiqun Zhang, Yiu-ming Cheung

Learnable Weighting of Intra-Attribute Distances for Categorical Data Clustering with Nominal and Ordinal Attributes

Read the original on arXiv AI →

arXiv:2607. 05464v1 Announce Type: cross Abstract: The success of categorical data clustering generally much relies on the distance metric that measures the dissimilarity degree between two objects.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Sep 24

Binary Classification from Coupled Pairwise Labels

The paper introduces SD-Pcomp learning, a binary classification framework that jointly utilizes Similarity/Dissimilarity (SD) labels and Pairwise Comparison (Pcomp) labels from instance pairs. It proposes an objective function that can be decomposed into either an SD estimator plus ordering information or a Pcomp estimator plus pair-type information, thereby integrating complementary relational cues. Experiments on eight datasets demonstrate that combining both label types improves classification accuracy and AUC compared to using either alone or a simple convex combination.

By Tomoya Tate, Kosuke Sugiyama, Masato Uchida
arXiv Statistics ML
Sep 3

Multidimensional scaling of two-mode three-way asymmetric dissimilarities: finding archetypal profiles and clustering

The paper extends the h‑plot multidimensional scaling technique to handle three‑way asymmetric dissimilarities, enabling the extraction of archetypal profiles and clustering in a unified Euclidean space. It provides an explicit eigenvector‑based solution that avoids local minima, is scale‑invariant, computationally efficient, and includes a straightforward goodness‑of‑fit assessment. The method is benchmarked against existing models and demonstrated on a financial dataset, with all data and code made publicly available for reproducibility.

By Mireia Mollar-Gumbau, Aleix Alcacer, Rafael Benitez, Vicente J. Bolos, Irene Epifanio