Pith. sign in

REVIEW 1 cited by

Can an unsupervised clustering algorithm reproduce a categorization system?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.10340 v1 pith:R2FLGBEW submitted 2024-08-19 stat.ML cs.LGq-fin.STstat.AP

classification stat.MLcs.LGq-fin.STstat.AP
keywords clusteringclassesgroundtruthunsupervisedcategorizationdistancemetric
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Peer analysis is a critical component of investment management, often relying on expert-provided categorization systems. These systems' consistency is questioned when they do not align with cohorts from unsupervised clustering algorithms optimized for various metrics. We investigate whether unsupervised clustering can reproduce ground truth classes in a labeled dataset, showing that success depends on feature selection and the chosen distance metric. Using toy datasets and fund categorization as real-world examples we demonstrate that accurately reproducing ground truth classes is challenging. We also highlight the limitations of standard clustering evaluation metrics in identifying the optimal number of clusters relative to the ground truth classes. We then show that if appropriate features are available in the dataset, and a proper distance metric is known (e.g., using a supervised Random Forest-based distance metric learning method), then an unsupervised clustering can indeed reproduce the ground truth classes as distinct clusters.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Supervised Similarity for High-Yield Corporate Bonds with Quantum Cognition Machine Learning

    q-fin.ST 2025-02 conditional novelty 5.0 of 10

    A quantum-fidelity proximity measure from QCML-trained quantum states gives lower k-NN prediction error than random forest proximity for high-yield corporate bond similarity.

Pith tools