loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock
Relaxed Dissimilarity-based Symbolic Histogram Variants for Granular Graph Embedding

Topics: Applications: Image Processing and Artificial Vision, Pattern Recognition, Decision Making, Industrial and Real World Applications, Financial Applications, Neural Prostheses and Medical Applications, Neural Based Data Mining and Complex Information Process; Learning Paradigms and Algorithms; Stochastic Learning and Statistical Algorithms

Authors: Luca Baldini 1 ; Alessio Martino 2 ; 3 and Antonello Rizzi 1

Affiliations: 1 Department of Information Engineering, Electronics and Telecommunications, University of Rome “La Sapienza", Via Eudossiana 18, 00184 Rome, Italy ; 2 Institute of Cognitive Sciences and Technologies (ISTC-CNR), Italian National Research Council, Via San Martino della Battaglia 44, 00185 Rome, Italy ; 3 Department of Business and Management, LUISS University, Viale Romania 32, 00197 Rome, Italy

Keyword(s): Structural Pattern Recognition, Supervised Learning, Embedding Spaces, Granular Computing, Graph Edit Distances, Graph Embedding.

Abstract: Graph embedding is an established and popular approach when designing graph-based pattern recognition systems. Amongst the several strategies, in the last ten years, Granular Computing emerged as a promising framework for structural pattern recognition. In the late 2000’s, symbolic histograms have been proposed as the driving force in order to perform the graph embedding procedure by counting the number of times each granule of information appears in the graph to be embedded. Similarly to a bag-of-words representation of a text corpora, symbolic histograms have been originally conceived as integer-valued vectorial representation of the graphs. In this paper, we propose six ‘relaxed’ versions of symbolic histograms, where the proper dissimilarity values between the information granules and the constituent parts of the graph to be embedded are taken into account, information which is discarded in the original symbolic histogram formulation due to the hard-limited nature of the counting procedure. Experimental results on six open-access datasets of fully-labelled graphs show comparable performance in terms of classification accuracy with respect to the original symbolic histograms (average accuracy shift ranging from -7% to +2%), counterbalanced by a great improvement in terms of number of resulting information granules, hence number of features in the embedding space (up to 75% less features, on average). (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 44.192.94.177

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Baldini, L.; Martino, A. and Rizzi, A. (2021). Relaxed Dissimilarity-based Symbolic Histogram Variants for Granular Graph Embedding. In Proceedings of the 13th International Joint Conference on Computational Intelligence (IJCCI 2021) - NCTA; ISBN 978-989-758-534-0; ISSN 2184-3236, SciTePress, pages 221-235. DOI: 10.5220/0010652500003063

@conference{ncta21,
author={Luca Baldini. and Alessio Martino. and Antonello Rizzi.},
title={Relaxed Dissimilarity-based Symbolic Histogram Variants for Granular Graph Embedding},
booktitle={Proceedings of the 13th International Joint Conference on Computational Intelligence (IJCCI 2021) - NCTA},
year={2021},
pages={221-235},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010652500003063},
isbn={978-989-758-534-0},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the 13th International Joint Conference on Computational Intelligence (IJCCI 2021) - NCTA
TI - Relaxed Dissimilarity-based Symbolic Histogram Variants for Granular Graph Embedding
SN - 978-989-758-534-0
IS - 2184-3236
AU - Baldini, L.
AU - Martino, A.
AU - Rizzi, A.
PY - 2021
SP - 221
EP - 235
DO - 10.5220/0010652500003063
PB - SciTePress