Akademik Veri Yönetim Sistemi
20th International Conference on Pattern Recognition Conference, İstanbul, Türkiye, 23 - 26 Nisan 2010, cilt.6388, ss.93-94
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 in 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(1) contest GEPR(2).