The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Graph Embedding Using Dissimilarities with Applications in Classification
Abstract
The domain of graphs contains only little mathematical structure. That is, most of the basic mathematical operations, actually required by many standard computer vision and pattern recognition algorithms, are not available for graphs. One of the few mathematical concepts that has been successfully transferred from the vector space to the graph domain is distance computation between graphs, commonly referred to as graph matching. Yet, distance-based pattern recognition is basically limited to nearest-neighbor classification. The present chapter reviews a novel approach for graph embedding in vector spaces built upon the concept of graph matching. The key-idea of the proposed embedding method is to use the distances of an input graph to a number of training graphs, termed prototypes, as vectorial description of the graph. That is, all graph matching procedures proposed in the literature during the last decades can be employed in this embedding framework. The rationale for such a graph embedding is to bridge the gap between the high representational power and flexibility of graphs and the large amount of algorithms available for object representations in terms of feature vectors. Hence, the proposed framework can be considered a contribution towards unifying the domains of structural and statistical pattern recognition.
Related Content
|
Aswathy Ravikumar, Harini Sriraman.
© 2023.
18 pages.
|
|
Ezhilarasie R., Aishwarya N., Subramani V., Umamakeswari A..
© 2023.
10 pages.
|
|
Sangeetha J..
© 2023.
13 pages.
|
|
Manivannan Doraipandian, Sriram J., Yathishan D., Palanivel S..
© 2023.
14 pages.
|
|
T. Kavitha, Malini S., Senbagavalli G..
© 2023.
36 pages.
|
|
Uma K. V., Aakash V., Deisy C..
© 2023.
23 pages.
|
|
Alageswaran Ramaiah, Arun K. S., Yathishan D., Sriram J., Palanivel S..
© 2023.
17 pages.
|
|
|