Abstract
We propose a new method to automatically obtain edit costs for error-tolerant graph matching based on interactive and adaptive graph recognition. Values of edit costs for deleting and inserting nodes and vertices are crucial to obtain good results in the recognition ratio. Nevertheless, these parameters are difficult to be estimated and they are usually set by a naive trial and error method. Moreover, we wish to seek these costs such that the system obtains the correct labelling between nodes of the input graph and nodes of the model graph. We consider the labelling imposed by a specialist is the correct one, for this reason, we need to present an interactive and adaptive graph recognition method in which there is a human interaction. Results show that when cost values are automatically found, the quality of labelling increases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
