A comparative analysis of matrix reordering algorithms regarding canonical data patterns
Uloženo v:
| Název: | A comparative analysis of matrix reordering algorithms regarding canonical data patterns |
|---|---|
| Autoři: | Matheus Peron Baroni, Celmar Guimarães da Silva |
| Zdroj: | Information Visualization. 21:321-332 |
| Informace o vydavateli: | SAGE Publications, 2022. |
| Rok vydání: | 2022 |
| Témata: | 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0101 mathematics, 01 natural sciences |
| Popis: | Matrix reordering is an Information Visualization topic that aims to study how to reveal information hidden within matrix-based visualizations, through appropriate reordering of its rows and columns. Considering the plethora of algorithms currently available to perform this task, and the set of matrix patterns presented in the visualization literature, we noted a lack of a comprehensive comparative analysis related to a subset of these patterns, known as canonical data patterns. Thus, this work aimed to perform a broad comparison of 37 state-of-the-art reordering algorithms by measuring the efficiency (execution time) and effectiveness (which combines objective functions as Moore Neighborhood, Minimal Span Loss Function and Circular Correlation, and a qualitative approach by visually assessing the output matrices) of the algorithms. We used as input a large synthetic matrix data set with different canonical data patterns. As a result, it was possible to indicate the most appropriate reordering algorithms for each pattern considered. |
| Druh dokumentu: | Article |
| Jazyk: | English |
| ISSN: | 1473-8724 1473-8716 |
| DOI: | 10.1177/14738716221091487 |
| Rights: | URL: https://journals.sagepub.com/page/policies/text-and-data-mining-license |
| Přístupové číslo: | edsair.doi...........ad12de59e237f5158e83170729cf770f |
| Databáze: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstrakt: | Matrix reordering is an Information Visualization topic that aims to study how to reveal information hidden within matrix-based visualizations, through appropriate reordering of its rows and columns. Considering the plethora of algorithms currently available to perform this task, and the set of matrix patterns presented in the visualization literature, we noted a lack of a comprehensive comparative analysis related to a subset of these patterns, known as canonical data patterns. Thus, this work aimed to perform a broad comparison of 37 state-of-the-art reordering algorithms by measuring the efficiency (execution time) and effectiveness (which combines objective functions as Moore Neighborhood, Minimal Span Loss Function and Circular Correlation, and a qualitative approach by visually assessing the output matrices) of the algorithms. We used as input a large synthetic matrix data set with different canonical data patterns. As a result, it was possible to indicate the most appropriate reordering algorithms for each pattern considered. |
|---|---|
| ISSN: | 14738724 14738716 |
| DOI: | 10.1177/14738716221091487 |