methodology-3

Constrained Clustering

3260 papers • 126 benchmarks • 313 datasets

Split data into groups, taking into account knowledge in the form of constraints on points, groups of points, or clusters.

(Image credit: Papersgraph)

Benchmarks

These leaderboards are used to track progress in constrained-clustering-3

Trend

Dataset

Best Model

Actions

No benchmarks available.

Libraries

i

Use these libraries to find constrained-clustering-3 models and implementations

Datasets

No datasets available.

Subtasks

Only Connect Walls Dataset Task 1 (Grouping)Incremental Constrained Clustering

Most implemented papers

Fast Computation of Wasserstein Barycenters

A. Doucet, Marco Cuturi•Tue Oct 15 2013

The Wasserstein distance is proposed to be smoothed with an entropic regularizer and recover in doing so a strictly convex objective whose gradients can be computed for a considerably cheaper computational cost using matrix scaling algorithms.

786

Content

0

Paper Graph

Learning Discrete Representations via Constrained Clustering for Effective and Efficient Dense Retrieval

M. Zhang, Shaoping Ma, Jingtao Zhan, Jiafeng Guo, Yiqun Liu, Jiaxin Mao•Mon Oct 11 2021

RepCONC is a novel retrieval model that learns discrete Representations via CONstrained Clustering and substantially outperforms a wide range of existing retrieval models in terms of retrieval effectiveness, memory efficiency, and time efficiency.

72 0

Paper Graph

Towards Uncovering the Intrinsic Data Structures for Unsupervised Domain Adaptation Using Structurally Regularized Deep Clustering

Xiatian Zhu, K. Jia, Hui Tang, C. L. P. Chen•Mon Dec 07 2020

This work proposes a hybrid model of Structurally Regularized Deep Clustering, which integrates the regularized discriminative clustering of target data with a generative one, and term the method as H-SRDC, which outperforms all the existing methods under both the inductive and transductive settings.

31 0

Paper Graph

On constrained spectral clustering and its applications

I. Davidson, Xiang Wang, B. Qian•Tue Jan 24 2012

This paper presents a more natural and principled formulation of constrained spectral clustering, which explicitly encodes the constraints as part of a constrained optimization problem, and demonstrates an innovative use of encoding large number of constraints: transfer learning via constraints.

207 0

Paper Graph

Learning to cluster in order to Transfer across domains and tasks

Z. Kira, Zhaoyang Lv, Yen-Chang Hsu•Mon Nov 27 2017

A novel method to perform transfer learning across domains and tasks, formulating it as a problem of learning to cluster with state of the art results for the challenging cross-task problem, applied on Omniglot and ImageNet.

240 0

Paper Graph

SPONGE: A generalized eigenproblem for clustering signed networks

Mihai Cucuringu, Peter Davies, Aldo Glielmo, Hemant Tyagi•Mon Apr 15 2019

This work introduces a principled and theoretically sound spectral method for k-way clustering in signed graphs, where the affinity measure between nodes takes either positive or negative values.

64 0

Paper Graph

Deep Constrained Dominant Sets for Person Re-Identification

M. Shah, M. Pelillo, L. T. Alemu•Wed Apr 24 2019

This work proposes an intriguing scheme which treats person-image retrieval problem as a constrained clustering optimization problem, called deep constrained dominant sets (DCDS), and shows that the proposed method can outperform state-of-the-art methods.

40 0

Paper Graph

Constrained Clustering: General Pairwise and Cardinality Constraints

Bernard Ghanem, Adel Bibi, A. Alqahtani•Tue Jul 23 2019

The experimental results show that the proposed method exploits the constraints to achieve perfect clustering performance with improved clustering to $2-5$ % in classical clustering metrics, e.g., Adjusted Random Index (ARI), Mirkin's Index (MI), and Huber’s Index (HI), outerperfomring all compared-againts methods across the board.

7 0

Paper Graph

Statistical control for spatio-temporal MEG/EEG source imaging with desparsified multi-task Lasso

Alexandre Gramfort, B. Thirion, Jérôme-Alexis Chevalier, J. Salmon•Mon Sep 28 2020

Extensive simulations on realistic head geometries, as well as empirical results on various MEG datasets, demonstrate the high recovery performance of ecd-MTLasso and its primary practical benefit: offer a statistically principled way to threshold MEG/EEG source maps.

10 0

Paper Graph

Adding a benchmark result helps the community track progress.