The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Detection and Characterization of Cluster Substructure I. Linear Structure: Fuzzy c-Lines
Abstract
In Part I, a generalization of the Fuzzy c-Means (or Fuzzy ISODATA) clustering algorithms is developed. Necessary conditions for minimization of a generalized total weighted squared orthogonal error objective function lead to a Picard iteration scheme which generates simultaneously (i) c fuzzy clusters in the data; (ii) a set of c prototypical straight lines in feature space which best fit the data in a well-defined sense; (iii) a set of c prototpyical centers of mass (on the c lines) which characterize the “core” of each linear fuzzy cluster. Theoretical optimization is achieved using principal components of generalized within cluster fuzzy scatter matrices. A convergence theorem for each algorithm in the infinite family is given. The algorithms are exemplified by five numerical examples using both real and artificial data sets having essentially “linear” substructure. In Part II, the Fuzzy c-Means and Fuzzy c-Lines algorithms are shown to be special cases of a more general class of fuzzy algorithms, the Fuzzy c-Varieties family, which generate (for prototypes) c linear varieties of arbitrary dimension up to dimension one less than the dimension of the data space. Convex combinations of the c-Varieties algorithms will also be studied in Part II [SIAM J. Appl. Math., 40 (1981), pp. 358–372].
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Zadeh, L. A. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90241-x · Cited by 67,855
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Self-citationEveritt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,168
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
Dunn, J. C. (1973) · Journal of Cybernetics · doi:10.1080/01969727308546046 · Cited by 5,049
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
Pattern Recognition Principles
(2009) · Classification Methods for Remotely Sensed Data, Second Edition · doi:10.1201/9781420090741.ch2 · Cited by 3,188
Introduction to linear and nonlinear programming
Polak, E. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100535 · Cited by 2,100
Introduction to linear and nonlinear programming
Luenberger, D. G. (1973) · Medical Entomology and Zoology · Cited by 1,915
Cited by
Unsupervised optimal fuzzy clustering
Gath, I., & Geva, A. B. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.192473 · Cited by 1,640
Efficient Implementation of the Fuzzy c-Means Clustering Algorithms
Cannon, R. L., Dave, J. V., & Bezdek, J. C. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767778 · Cited by 619
Self-citationYang, M.-S. (1993) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(93)90202-a · Cited by 506
A cluster validity index for fuzzy clustering
Wu, K.-L., & Yang, M.-S. (2005) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.11.022 · Cited by 443
High-dimensional data clustering
Bouveyron, C., Girard, S., & Schmid, C. (2007) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2007.02.009 · Cited by 382
Computational and statistical analysis of metabolomics data
Ren, S., Hinzman, A. A., Kang, E. L., Szczesniak, R. D., & Lu, L. J. (2015) · Metabolomics · doi:10.1007/s11306-015-0823-6 · Cited by 264
Fat Storage-inducing Transmembrane Protein 2 Is Required for Normal Fat Storage in Adipose Tissue
Miranda, D. A., Kim, J.-H., Nguyen, L. N., Cheng, W., Tan, B. C., Goh, V. J., Tan, J. S. Y., Yaligar, J., KN, B. P., Velan, S. S., et al. (2014) · Journal of Biological Chemistry · doi:10.1074/jbc.m114.547687 · Cited by 71
Metadata
- Authors
- Bezdek, J. C., Coray, C., Gunderson, R., & Watson, J.
- Venue
- SIAM Journal on Applied Mathematics
- Published
- 1981-04
- Volume
- 40
- Issue
- 2
- Pages
- 339-357
- ISSN
- 0036-1399 (ISSN-L)
- 1095-712X
- OpenAlex
- W1971888031
- Cited by
- 325
- References
- 17
- FWCI
- 5.21
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.