Explainable Graph Spectral Clustering of text documents.
Spectral clustering methods are known for their ability to represent 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 relati...
Saved in:
Main Authors: | Bartłomiej Starosta, Mieczysław A Kłopotek, Sławomir T Wierzchoń, Dariusz Czerski, Marcin Sydow, Piotr Borkowski |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2025-01-01
|
Series: | PLoS ONE |
Online Access: | https://doi.org/10.1371/journal.pone.0313238 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fast Spectral Clustering via Efficient Multilayer Anchor Graph
by: Yiwei Wei, et al.
Published: (2024-01-01) -
Spectral deviations of graphs
by: Stanić Zoran
Published: (2025-02-01) -
Non-hierarchic document clustering
by: Gareth Jones, et al.
Published: (1995-01-01) -
ABOUT THE DIGITAL RESTORATION OF HISTORICAL TEXT DOCUMENTS
by: V. V. Starovoitov
Published: (2015-08-01) -
Spectral Sufficient Conditions on Pancyclic Graphs
by: Guidong Yu, et al.
Published: (2021-01-01)