Fuzzy entropy and conditioning
Information Sciences: an International Journal
Higher order fuzzy entropy and hybrid entropy of a set
Information Sciences: an International Journal
Some new information measures for fuzzy sets
Information Sciences: an International Journal
Addition as fuzzy mutual entropy
Information Sciences: an International Journal
A note on fuzzy information measures
Pattern Recognition Letters
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Multilevel k-way hypergraph partitioning
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Principles of data mining
Some new fuzzy entropy formulas
Fuzzy Sets and Systems
Algorithms for estimating relative importance in networks
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Kernel Methods for Pattern Analysis
Kernel Methods for Pattern Analysis
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
Multi-Constraint Mesh Partitioning for Contact/Impact Computations
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Protein function prediction via graph kernels
Bioinformatics
Uncertainty and Information: Foundations of Generalized Information Theory
Uncertainty and Information: Foundations of Generalized Information Theory
Graph-Theoretic Techniques for Web Content Mining
Graph-Theoretic Techniques for Web Content Mining
The Dissimilarity Representation for Pattern Recognition: Foundations And Applications (Machine Perception and Artificial Intelligence)
Engineering graph clustering: Models and experimental evaluation
Journal of Experimental Algorithmics (JEA)
Studies on Fuzzy Information Measures
FSKD '07 Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03
Automatic Classification of Graphs by Symbolic Histograms
GRC '07 Proceedings of the 2007 IEEE International Conference on Granular Computing
Computers & Mathematics with Applications
HMM-based graph edit distance for image indexing
International Journal of Imaging Systems and Technology - Multimedia Information Retrieval
A Graph Partition-Based Soft Clustering Algorithm
IITA '08 Proceedings of the 2008 Second International Symposium on Intelligent Information Technology Application - Volume 02
Bridging the Gap Between Graph Edit Distance and Kernel Machines
Bridging the Gap Between Graph Edit Distance and Kernel Machines
Nonextensive Information Theoretic Kernels on Measures
The Journal of Machine Learning Research
Full-Subtopic Retrieval with Keyphrase-Based Search Results Clustering
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
A survey of graph edit distance
Pattern Analysis & Applications
Managing and Mining Graph Data
Managing and Mining Graph Data
The Journal of Machine Learning Research
On finding graph clusterings with maximum modularity
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Discussion on new integral entropy and energy of fuzzy sets
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 6
Information Theoretic Learning: Renyi's Entropy and Kernel Perspectives
Information Theoretic Learning: Renyi's Entropy and Kernel Perspectives
Graph Classification and Clustering Based on Vector Space Embedding
Graph Classification and Clustering Based on Vector Space Embedding
The Journal of Machine Learning Research
Hi-index | 0.20 |
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.