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. Acta cybernetica, (19) 1. pp. 149-158. (2009)

[img] Cikk, tanulmány, mű
actacyb_19_1_2009_10.pdf

Download (146kB)

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
Journal or Publication Title: Acta cybernetica
Date: 2009
Volume: 19
Number: 1
Page Range: pp. 149-158
ISSN: 0324-721X
Language: angol
Heading title: Regular papers
DOI: https://doi.org/10.14232/actacyb.19.1.2009.10
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: 158. p.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 12:39
URI: http://acta.bibl.u-szeged.hu/id/eprint/12858

Actions (login required)

View Item View Item