Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Unsupervised Optimal Fuzzy Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structured spatial domain image and data comparison metrics
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
A Linear Programming Approach for the Weighted Graph Matching Problem
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
On cluster validity for the fuzzy c-means model
IEEE Transactions on Fuzzy Systems
Hi-index | 0.00 |
In several applications it is necessary to compare two or more data sets. In this paper we describe a new technique to compare two data partitions of two different data sets with a quite similar structure as frequently occurs in defect detection. The comparison is obtained dividing each data set in partitions by means of a supervised fuzzy clustering algorithm and associating an undirected complete weighted graph structure to these partitions. Then, a graph matching operation returns an estimation of the level of similarity between the data sets.