Determinacy analysis as a diclique extracting task

Authors:
Grete Lind;Rein Kuusik
Affiliations:
Department of Informatics, Tallinn University of Technology, Tallinn, Estonia;Department of Informatics, Tallinn University of Technology, Tallinn, Estonia
Venue:
ECC'08 Proceedings of the 2nd conference on European computing conference
Year:
2008

Citing 4
Cited 1

The Diclique Representation and Decomposition of Binary Relations

Journal of the ACM (JACM)
Principles of data mining

Principles of data mining
An all closed set finding algorithm for data mining

AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
Some ideas for determinacy analysis realisation

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

Rescuing of intelligence and electronic security core applications (RIESCA)

WSEAS TRANSACTIONS on SYSTEMS

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many papers the essence of Determinacy Analysis has been treated, but none of them determines to what field this method belongs. Author of the method compares it to the classical factor analysis. In this paper we show that Determinacy Analysis is a method that solves tasks of data mining. We also show how this method can be reduced to the graph-theoretical diclique-finding task. This allows presenting new approaches to DA and exclude manual work.