Learning a metric when clustering data points in the presence of constraints

DOI10.1007/S11634-019-00359-6zbMATH Open1474.30037OpenAlexW2944951088MaRDI QIDQ2183649FDOQ2183649

Authors: Ahmad Ali Abin, Mohammad Ali Bashiri, H. Beigy 

Publication date: 27 May 2020

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-019-00359-6

Recommendations

• Learning a Mahalanobis distance metric for data clustering and classification
• Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
• Kernel-based metric learning for semi-supervised clustering
• Efficiently learning the metric with side-information
• scientific article; zbMATH DE number 5957283

zbMATH Keywords

metric learningconstrained clusteringweighted constraintsinstance-level constraints

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Metric spaces, metrizability (54E35) Kernel functions in one complex variable and applications (30C40)

Cites Work

• Title not available (Why is that?)
• Learning a Mahalanobis distance metric for data clustering and classification
• Clustering based on conditional distributions in an auxiliary space
• Semi-supervised graph clustering: a kernel approach
• Semi-supervised clustering with metric learning: an adaptive kernel method
• Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
• Constrained clustering with a complex cluster structure
• Title not available (Why is that?)
• Semi-supervised metric learning via topology preserving multiple semi-supervised assumptions
• Semi-supervised clustering via multi-level random walk
• Active constrained fuzzy clustering: a multiple kernels learning approach
• Marginal semi-supervised sub-manifold projections with informative constraints for dimensionality reduction and recognition
• Semi-supervised model-based clustering with positive and negative constraints
• Hierarchical constraints
• A flexible cluster-oriented alternative clustering algorithm for choosing from the Pareto front of solutions

Cited In (3)

• Multi-objective soft subspace clustering in the composite kernel space
• Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
• Learning a Mahalanobis distance metric for data clustering and classification

Uses Software

• MNIST

This page was built for publication: Learning a metric when clustering data points in the presence of constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183649)