Fuzzy clustering based on coverings
From MaRDI portal
Publication:2829662
DOI10.1007/978-3-642-30278-7_25zbMATH Open1349.62294OpenAlexW200643186MaRDI QIDQ2829662FDOQ2829662
Publication date: 8 November 2016
Published in: Towards Advanced Data Analysis by Combining Soft Computing and Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-30278-7_25
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Multivariate analysis and fuzziness (62H86)
Cites Work
- On the structure of F-indistinguishability operators
- Gradual elements in a fuzzy set
- Similarity relations and fuzzy orderings
- On a non-nested level-based representation of fuzziness
- Title not available (Why is that?)
- On the hardness of approximating minimization problems
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Fuzzy partitions and relations; an axiomatic basis for clustering
- Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques
Cited In (9)
- Clustering method based on transitive closure of fuzzy relations
- P-FCM: a proximity-based fuzzy clustering
- Fuzzy clustering based on \(K\)-nearest-neighbours rule
- Representation by levels: an alternative to fuzzy sets for fuzzy data mining
- Title not available (Why is that?)
- Title not available (Why is that?)
- RL-instances: an alternative to conjunctive fuzzy sets of tuples for flexible querying in relational databases
- Fuzzy disk for covering fuzzy points
- Mining representative subset based on fuzzy clustering
Uses Software
This page was built for publication: Fuzzy clustering based on coverings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829662)
