Matching of Matching-Graphs - A Novel Approach for Graph Classification

Fuchs, Mathias; Riesen, Kaspar (2020). Matching of Matching-Graphs - A Novel Approach for Graph Classification. In: Proceedings of 2020 25th International Conference on Pattern Recognition (ICPR).

[img] Text
fuchs20matching.pdf - Submitted Version
Restricted to registered users only
Available under License Publisher holds Copyright.

Download (354kB) | Request a copy

Due to fast developments in data acquisition, we observe rapidly increasing amounts of data available in diverse areas. Simultaneously, we observe that in many applications the underlying data is inherently complex, making graphs a very useful and adequate data structure for formal representation. A large amount of graph based methods for pattern recognition have been proposed. Many of these methods actually rely on graph matching. In the present paper a novel encoding of graph matching information is proposed. The idea of this encoding is to formalize the stable cores of specific classes by means of graphs. In an empirical evaluation we show that it can be highly beneficial to focus on these stable parts of graphs during graph classification.

Item Type:

Conference or Workshop Item (Paper)

Division/Institute:

08 Faculty of Science > Institute of Computer Science (INF) > Logic and Theory Group (LTG)
08 Faculty of Science > Institute of Computer Science (INF)

UniBE Contributor:

Fuchs, Mathias Christian, Riesen, Kaspar

Subjects:

000 Computer science, knowledge & systems
500 Science > 510 Mathematics

Language:

English

Submitter:

Atefeh Rohani

Date Deposited:

15 Feb 2021 14:40

Last Modified:

04 Mar 2024 14:33

BORIS DOI:

10.48350/152161

URI:

https://boris.unibe.ch/id/eprint/152161

Actions (login required)

Edit item Edit item
Provide Feedback