Quantum Spectral Clustering of Mixed Graphs

Spectral graph partitioning is a well known technique to estimate clusters in undirected graphs. Recent approaches explored efficient spectral algorithms for directed and mixed graphs utilizing various matrix representations. Despite its success in clustering tasks, classical spectral algorithms suf...

Celý popis

Podrobná bibliografia

Vydané v:	2021 58th ACM/IEEE Design Automation Conference (DAC) s. 463 - 468
Hlavní autori:	Volya, Daniel, Mishra, Prabhat
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 05.12.2021
Predmet:	Clustering algorithms Computers eigenvalue computation eigenvector projection Machine learning Machine learning algorithms Partitioning algorithms Quantum computing Runtime spectral graph clustering
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!