Abstract
We present a new method for explicit graph embedding. Our algorithm extracts a feature vector for an undirected attributed graph. The proposed feature vector encodes details about the number of nodes, number of edges, node degrees, the attributes of nodes and the attributes of edges in the graph. The first two features are for the number of nodes and the number of edges. These are followed by w features for node degrees, m features for k node attributes and n features for l edge attributes — which represent the distribution of node degrees, node attribute values and edge attribute values, and are obtained by defining (in an unsupervised fashion), fuzzy-intervals over the list of node degrees, node attributes and edge attributes. Experimental results are provided for sample data of ICPR2010 contest GEPR.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Colot, O., Olivier, C., Courtellemont, P., El-Matouat, A.: Information criteria and abrupt changes in probability laws. In: Signal Processing VII: Theories and Applications, pp. 1855–1858 (1994)
http://nerone.diiie.unisa.it/contest/index.shtml (as on May 26, 2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luqman, M.M., Lladós, J., Ramel, JY., Brouard, T. (2010). A Fuzzy-Interval Based Approach for Explicit Graph Embedding. In: Ünay, D., Çataltepe, Z., Aksoy, S. (eds) Recognizing Patterns in Signals, Speech, Images and Videos. ICPR 2010. Lecture Notes in Computer Science, vol 6388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17711-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-17711-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17710-1
Online ISBN: 978-3-642-17711-8
eBook Packages: Computer ScienceComputer Science (R0)