Journal
FUZZY SETS AND SYSTEMS
Volume 221, Issue -, Pages 24-47Publisher
ELSEVIER
DOI: 10.1016/j.fss.2013.01.001
Keywords
Information measures; Fuzzy sets; Fuzzy clustering; Graph matching; Graph representation; Graph mining
Ask authors/readers for more resources
In this paper, we propose a rigorous way to define the concept of ambiguity in the domain of graphs. In past studies, the classical definition of ambiguity has been derived starting from fuzzy set and fuzzy information theories. Our aim is to show that also in the domain of the graphs it is possible to derive a formulation able to capture the same semantic and mathematical concept. To strengthen the theoretical results, we discuss the application of the graph ambiguity concept to the graph classification setting, conceiving a new kind of inexact graph matching procedure. The results prove that the graph ambiguity concept is a characterizing and discriminative property of graphs. (C) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available