Clustering of Data Represented by Pairwise Comparisons
From MaRDI portal
Publication:5887399
DOI10.2478/CANDC-2022-0021OpenAlexW4360786157MaRDI QIDQ5887399FDOQ5887399
Authors: Sergey Dvoenko
Publication date: 11 April 2023
Published in: Control and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/candc-2022-0021
Recommendations
Cited In (12)
- Clustering analysis and decision-making by ``ranks of links
- Clustering algorithms for chains
- Comparison of clustering algorithms: an example with proteomic data
- Consistent clustering of entries in large pairwise comparison matrices
- Cost functions for pairwise data clustering
- Clustering objects described by juxtaposition of binary data tables
- Metric correctness of pairwise comparisons in intelligent data analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clustering using similarity measure
- Card sorting data collection methodology: how many participants is most efficient?
- Title not available (Why is that?)
This page was built for publication: Clustering of Data Represented by Pairwise Comparisons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5887399)