Some developments of determinacy analysis

Authors:
Rein Kuusik;Grete Lind
Affiliations:
Department of Informatics, Tallinn University of Technology, Tallinn, Estonia;Department of Informatics, Tallinn University of Technology, Tallinn, Estonia
Venue:
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Year:
2010

Citing 1
Cited 1

Some ideas for determinacy analysis realisation

ASC '07 Proceedings of The Eleventh IASTED International Conference on Artificial Intelligence and Soft Computing

New developments of determinacy analysis

ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with development of Determincy Analysis (DA), a method for data mining. There are two approaches to DA that give a different result consisting of non-overlapping (exclusive each other) rules. The first method finds exactly one system consisting of rules that have equal length. The second, step by step approach enables to find very many different rule systems where the rules have different length. In the first case the rules contain a lot of redundant attributes, in the second case there are too many different (formally complete) systems of rules what makes the selection hard. A better result can be obtained by finding overlapping rules. This paper presents DA approach and technique that enables to find overlapping rules with different length and algorithm realizing it. Such approach for DA has not been created earlier.