Relational duals of the c-means clustering algorithms
From MaRDI portal
Publication:1120933
DOI10.1016/0031-3203(89)90066-6zbMATH Open0673.62050OpenAlexW2061708588MaRDI QIDQ1120933FDOQ1120933
Authors: Richard J. Hathaway, John W. Davenport, James C. Bezdek 
Publication date: 1989
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0031-3203(89)90066-6
Recommendations
- Kernelized non-Euclidean relational c-means algorithms
- On relational possibilistic clustering
- Clustering with relational constraint
- Gaussian-kernel \(c\)-means clustering algorithms
- DUAL OBJECT-RELATION CLUSTERING MODELS
- c-Means Clustering on the Multinomial Manifold
- Clustering incomplete relational data using the non-Euclidean relational fuzzy \(c\)-means algorithm
clusteringpattern recognitionconvergence propertiesrelational datafuzzy c-means algorithmshard c-means algorithm
Cites Work
- Printer graphics for clustering
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms
- Optimal Fuzzy Partitions: A Heuristic for Estimating the Parameters in a Mixture of Normal Distributions
- Local convergence analysis of a grouped variable version of coordinate descent
- On the asymptotic properties of fuzzy c-means cluster prototypes as estimators of mixture subpopulation centers
- A new approach to information retrieval systems using fuzzy expressions
- Clustering with relational c-means partitions from pairwise distance data
- Title not available (Why is that?)
Cited In (32)
- Fuzzy clustering with weighted medoids for relational data
- Dealing with non-metric dissimilarities in fuzzy central clustering algorithms
- Advances in theory and applications of fuzzy clustering
- Fuzzy relational clustering based on comparing two proximity matrices with utilization of particle swarm optimization
- Some types of clustering with relational constraints
- P-FCM: a proximity-based fuzzy clustering
- Kernelized non-Euclidean relational c-means algorithms
- Evolutionary fuzzy clustering of relational data
- Approximating a similarity matrix by a latent class model: a reappraisal of additive fuzzy clustering
- Cophenetic-based fuzzy clustering of time series by linear dependency
- Three-way fuzzy clustering models for LR fuzzy time trajectories
- On the efficiency of evolutionary fuzzy clustering
- Rederivation of the fuzzy-possibilistic clustering objective function through Bayesian inference
- A fuzzy clustering procedure for random fuzzy sets
- Soft clustering
- A survey of fuzzy clustering
- Semi-supervised Fuzzy c-Means Algorithms by Revising Dissimilarity/Kernel Matrices
- Handling Noise and Outliers in Fuzzy Clustering
- A convergence theorem for graph shift-type algorithms
- Approximate clustering in very large relational data
- ECM: An evidential version of the fuzzy \(c\)-means algorithm
- On relational possibilistic clustering
- Clustering incomplete relational data using the non-Euclidean relational fuzzy \(c\)-means algorithm
- Incorporating spatial context into fuzzy-possibilistic clustering using Bayesian inference
- Partitioning hard clustering algorithms based on multiple dissimilarity matrices
- A novel approach to fuzzy clustering based on a dissimilarity relation extracted from data using a TS system
- Evolutionary algorithms for robust density-based data clustering
- Topographic mapping of large dissimilarity data sets
- DUAL OBJECT-RELATION CLUSTERING MODELS
- Relational topological map
- A sequential Bayesian alternative to the classical parallel fuzzy clustering model
- Clustering and aggregation of relational data with applications to image database categorization
This page was built for publication: Relational duals of the c-means clustering algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120933)
