Code and Data Repository for An Algorithm for Clustering with Confidence-Based Must-Link and Cannot-Link Constraints

The PCCC algorithm is a clustering method that incorporates both hard and soft must-link and cannot-link constraints.

Authors

Publication Details

Journal
INFORMS journal on computing
Published
2024-10-14
DOI
https://doi.org/10.1287/ijoc.2023.0419.cd
Citations
2
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.69
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Code and Data Repository for An Algorithm for Clustering with Confidence-Based Must-Link and Cannot-Link Constraints

Philipp Baumann, Dorit S. Hochbaum
2 citations
INFORMS journal on computing
Advanced Clustering Algorithms Research
0.69
article

Code and Data Repository for An Algorithm for Clustering with Confidence-Based Must-Link and Cannot-Link Constraints

Philipp Baumann, Dorit S. Hochbaum
article en
2 citations

Abstract

The PCCC algorithm is a clustering method that incorporates both hard and soft must-link and cannot-link constraints.

INFORMS journal on computing
Openalex Percentile: Top 24%
Advanced Clustering Algorithms Research
0.69
DOISourceOpenAlex
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.

Code and Data Repository for An Algorithm for Clustering with Confidence-Based Must-Link and Cannot-Link Constraints — Philipp Baumann, Dorit S. Hochbaum · INFORMS journal on computing (2024) | TGRS Research Map | TGRS