A Novel Semi-supervised Clustering Algorithm for Finding Clusters of Arbitrary Shapes

DOI10.1007/978-3-540-89985-3_123MaRDI QIDQ3628555zbMATH OpenOpenAlexFDO

Authors Mahdieh Soleymani Baghshah, Saeed Bagheri-Shouraki

Publication date 20 May 2009

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89985-3_123

zbMATH Keywords

clusteringpair wise constraintssemi-supervisedsub-clusters

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05)

Recommendations

• A semi-supervised spectral clustering algorithm based on pairwise constraints
• A semi-supervised clustering algorithm based on seeds and pair-wise constraints
• Semi-supervised fuzzy \(c\)-means algorithms by revising dissimilarity/kernel matrices
• Some Pairwise Constrained Semi-Supervised Fuzzy c-Means Clustering Algorithms
• A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering

Cites work

• A Novel Semi-supervised Clustering Algorithm for Finding Clusters of Arbitrary Shapes
• Correlation clustering
• Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
• Gaussian mixture models with equivalence constraints
• scientific article; zbMATH DE number 5957283 (Why is no real title available?)
• Improving fuzzy clustering of biological data by metric learning with side information
• Mixture Modeling with Pairwise, Instance-Level Class Constraints
• Robust path-based spectral clustering

Cited in

(2)

• A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering
• A Novel Semi-supervised Clustering Algorithm for Finding Clusters of Arbitrary Shapes

This page was built for publication: A Novel Semi-supervised Clustering Algorithm for Finding Clusters of Arbitrary Shapes

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