- Compression-based inference on graph data
- Belgian-Dutch Conference on Machine Learning
- Book/source title
- BENELEARN 2013: Proceedings of the 22nd Belgian-Dutch Conference on Machine Learning
- Pages (from-to)
- Nijmegen: Raboud University Nijmegen
- Document type
- Conference contribution
- Faculty of Science (FNWI)
- Informatics Institute (IVI)
We investigate the use of compression-based learning on graph data. General purpose compressors operate on bitstrings or other sequential representations. A single graph can be represented sequentially in many ways, which may in uence the performance of sequential compressors. Using Normalized Compression Distance (NCD), we test a sequential compressor versus a native
graph compressor. We use both synthetic, randomly generated graphs and reallife datasets. We conclude that, even under adverse circumstances, sequential representations contain enough structure for shallow algorithms to perform inference successfully. Algorithms that operate directly on the graph representation usually require a considerable increase in resources, but do allow
for an increase in performance also.
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.