Computing semantic clusters by semantic mirroring and spectral graph partitioning

DOI10.1007/S11786-013-0159-4MaRDI QIDQ2254077zbMATH OpenOpenAlexFDO

Authors Lars Eldén, Magnus Merkel, 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

adjacencybilingualclusterdictionaryeigenvalueeigenvectorFiedler vectorgraphgraph Laplacianmatrixmirroringpartitioningsemanticsspectralwordnet

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)

Recommendations

• scientific article; zbMATH DE number 1897849
• Formal Concept Analysis
• SPECTRAL METHODS CLUSTER WORDS OF THE SAME CLASS IN A SYNTACTIC DEPENDENCY NETWORK
• scientific article; zbMATH DE number 2043367
• A method for spectral co-clustering documents and words based on morphology

Cites work

• Computing semantic clusters by semantic mirroring and spectral graph partitioning
• Finding good approximate vertex and edge partitions is NP-hard
• Formal Concept Analysis
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 1175490 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Partitioning Sparse Matrices with Eigenvectors of Graphs

Cited in

(2)

• Computing semantic clusters by semantic mirroring and spectral graph partitioning
• Formal Concept Analysis

Describes a project that uses

Uses Software

• Europarl
• WordNet

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254077)