A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Generalized Learning Graph Quantization
[chapter]
2011
Lecture Notes in Computer Science
This contribution extends generalized LVQ, generalized relevance LVQ, and robust soft LVQ to the graph domain. The proposed approaches are based on the basic learning graph quantization (lgq) algorithm using the orbifold framework. Experiments on three data sets show that the proposed approaches outperform lgq and lgq2.1.
doi:10.1007/978-3-642-20844-7_13
fatcat:js5f4gooebh3hishc3okvdpocm