Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.12436 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912965445287936 |
|---|---|
| author | Starosta, Bartłomiej Wierzchoń, Sławomir T. Borkowski, Piotr Czerski, Dariusz Sydow, Marcin Laskowski, Eryk Kłopotek, Mieczysław A. |
| author_facet | Starosta, Bartłomiej Wierzchoń, Sławomir T. Borkowski, Piotr Czerski, Dariusz Sydow, Marcin Laskowski, Eryk Kłopotek, Mieczysław A. |
| contents | Graph Spectral Clustering methods (GSC) allow representing clusters of diverse shapes, densities, etc. However, the results of such algorithms, when applied e.g. to text documents, are hard to explain to the user, especially due to embedding in the spectral space which has no obvious relation to document contents. Furthermore, the presence of documents without clear content meaning and the stochastic nature of the clustering algorithms deteriorate explainability. This paper proposes an enhancement to the explanation methodology, proposed in an earlier research of our team. It allows us to overcome the latter problems by taking inspiration from rough set theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_12436 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Rough Sets for Explainability of Spectral Graph Clustering Starosta, Bartłomiej Wierzchoń, Sławomir T. Borkowski, Piotr Czerski, Dariusz Sydow, Marcin Laskowski, Eryk Kłopotek, Mieczysław A. Machine Learning Artificial Intelligence Graph Spectral Clustering methods (GSC) allow representing clusters of diverse shapes, densities, etc. However, the results of such algorithms, when applied e.g. to text documents, are hard to explain to the user, especially due to embedding in the spectral space which has no obvious relation to document contents. Furthermore, the presence of documents without clear content meaning and the stochastic nature of the clustering algorithms deteriorate explainability. This paper proposes an enhancement to the explanation methodology, proposed in an earlier research of our team. It allows us to overcome the latter problems by taking inspiration from rough set theory. |
| title | Rough Sets for Explainability of Spectral Graph Clustering |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2512.12436 |