Detection and Characterization of Cluster Substructure II. Fuzzy c-Varieties and Convex Combinations Thereof
- 1 April 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 40 (2) , 358-372
- https://doi.org/10.1137/0140030
Abstract
In Part I [SIAM J. Appl. Math., 40 (1981), pp. 339–357], Fuzzy c-Lines was introduced as an algorithm for detection and characterization of linearly clustered data. In Part II, we address two extensions of the theory in Part I. Specifically, we will first generalize the straight line prototype of a cluster developed in Part I to any r-dimensional linear variety of $R^s ,( 0\leqq r < s)$; secondly, we will consider a distance functional which utilizes convex combinations of the distance functionals developed here and in Part I. All of the notation and symbols used here are unchanged from Part I.Keywords
This publication has 9 references indexed in Scilit:
- A new approach to clusteringPublished by Elsevier ,2004
- Detection and Characterization of Cluster Substructure I. Linear Structure: Fuzzy c-LinesSIAM Journal on Applied Mathematics, 1981
- Pattern Recognition with Fuzzy Objective Function AlgorithmsPublished by Springer Nature ,1981
- Prototype classification and feature selection with fuzzy setsIEEE Transactions on Systems, Man, and Cybernetics, 1977
- Numerical taxonomy with fuzzy setsJournal of Mathematical Biology, 1974
- Clinical Pure Types as a Fuzzy PartitionJournal of Cybernetics, 1974
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated ClustersJournal of Cybernetics, 1973
- Graph-Theoretical Methods for Detecting and Describing Gestalt ClustersIEEE Transactions on Computers, 1971
- Fuzzy setsInformation and Control, 1965