A fixed point theorem for stronger association rules and its computational aspects

Czédli Gábor: A fixed point theorem for stronger association rules and its computational aspects. In: Acta cybernetica, (19) 1. pp. 149-158. (2009)

[thumbnail of actacyb_19_1_2009_10.pdf]
Preview
Cikk, tanulmány, mű
actacyb_19_1_2009_10.pdf

Download (146kB) | Preview

Abstract

Each relation induces a new closure operator, which is (in the sense of data mining) stronger than or equal to the Galois one. The goal is to give some evidence that the new closure operator is often properly stronger than the Galois one. An easy characterization of the new closure operator as a largest fixed point of an appropriate contraction map leads to a (modest) computer program. Finally, various experimental results obtained by this program give the desired evidence.

Item Type: Article
Heading title: Regular papers
Journal or Publication Title: Acta cybernetica
Date: 2009
Volume: 19
Number: 1
ISSN: 0324-721X
Page Range: pp. 149-158
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38527/
DOI: 10.14232/actacyb.19.1.2009.10
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: 158. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 17. 08:34
URI: http://acta.bibl.u-szeged.hu/id/eprint/12858

Actions (login required)

View Item View Item