Computing semantic clusters by semantic mirroring and spectral graph partitioning

DOI10.1007/s11786-013-0159-4zbMath1343.68257OpenAlexW2019092573MaRDI QIDQ2254077

Magnus Merkel, Lars Eldén, Lars Ahrenberg, Martin Fagerlund

Publication date: 4 February 2015

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-013-0159-4

zbMATH Keywords

clusterwordnetspectralpartitioninggrapheigenvalueeigenvectorsemanticsmatrixadjacencyFiedler vectorgraph Laplaciandictionarybilingualmirroring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Natural language processing (68T50) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (1)

Computing semantic clusters by semantic mirroring and spectral graph partitioning

Uses Software

• WordNet
• Europarl

Cites Work

• Finding good approximate vertex and edge partitions is NP-hard
• Computing semantic clusters by semantic mirroring and spectral graph partitioning
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Formal Concept Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing semantic clusters by semantic mirroring and spectral graph partitioning