On relational data versions of c-means algorithms

Authors:
Richard J. Hathaway;James C. Bezdek;John W. Davenport
Affiliations:
Mathematics and Computer Science Department, Georgia Southern University, Statesboro, GA 30460, USA;Computer Science Department, University of West Florida, Pensacola, FL 32514, USA;Mathematics and Computer Science Department, Georgia Southern University, Statesboro, GA 30460, USA
Venue:
Pattern Recognition Letters - Special issue on fuzzy set technology in pattern recognition
Year:
1996

Citing 3
Cited 9

Local convergence analysis of a grouped variable version of coordinate descent

Journal of Optimization Theory and Applications
Characterization and detection of noise in clustering

Pattern Recognition Letters
An iterative procedure for minimizing a generalized sum-of-squared-errors clustering criterion

Neural, Parallel & Scientific Computations

Fuzzy clustering with a knowledge-based guidance

Pattern Recognition Letters
On relational possibilistic clustering

Pattern Recognition
ECM: An evidential version of the fuzzy c-means algorithm

Pattern Recognition
Adaptive time-domain blind separation of speech signals

LVA/ICA'10 Proceedings of the 9th international conference on Latent variable analysis and signal separation
Maximin initialization for cluster analysis

CIARP'06 Proceedings of the 11th Iberoamerican conference on Progress in Pattern Recognition, Image Analysis and Applications
Adaptive web usage profiling

WebKDD'05 Proceedings of the 7th international conference on Knowledge Discovery on the Web: advances in Web Mining and Web Usage Analysis
Credit-Card fraud profiling using a hybrid incremental clustering methodology

SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Dynamic credit-card fraud profiling

MDAI'12 Proceedings of the 9th international conference on Modeling Decisions for Artificial Intelligence
Online fuzzy medoid based clustering algorithms

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Relational data describes objects by specifying pairwise similarities or dissimilarities between objects, while object data describes the objects through feature measurements. This paper shows how c-means clustering methodology for object data can be applied to relational data.