On a Criterion of Similarity between Partitions Based on Rough Set Theory

Authors:
Yasuo Kudo;Tetsuya Murai
Affiliations:
College of Information and Systems, Muroran Institute of Technology, Muroran, Japan 050-8585;Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan 060-0814
Venue:
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Year:
2009

Citing 6
Cited 1

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Mathematical Foundations

Rough Sets: Mathematical Foundations
Efficient Discovery of Functional and Approximate Dependencies Using Partitions

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Approximate entropy reducts

Fundamenta Informaticae
FUN: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute

Transactions on Rough Sets IX
An Evaluation Method of Relative Reducts Based on Roughness of Partitions

International Journal of Cognitive Informatics and Natural Intelligence

An Axiomatic Approach to the Roughness Measure of Rough Sets

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a criterion of similarity between partitions. The proposed similarity criterion is a generalization of an evaluation criterion of relative reducts proposed by the authors and evaluates the similarity of partitions by correctness and roughness with each other. Moreover, for comparison of similarity scores between different universes, we also propose a normalized similarity criterion.