Mining Closed Gradual Patterns - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2010

Mining Closed Gradual Patterns


Mining gradual rules of the form −"the more A, the more B"− is more and more grasping the interest of the data mining commu- nity. Several approaches have been recently proposed. Unfortunately, in all surveyed approaches, reducing the quantity of mined patterns (and, consequently, the quantity of extracted rules) was not the main concern. To palliate such a drawback, a possible solution consists in using results of Formal Concept Analysis to generate a lossless reduced size nucleus of gradual patterns. To do so, we introduce in this paper a novel closure op- erator acting on gradual itemsets. Results of the experiments carried out on synthetic datasets showed important profits in terms of compactness of the generated gradual patterns set.
Fichier principal
Vignette du fichier
ICAISC2010.pdf (230.93 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-00504029 , version 1 (02-04-2019)



Sarra Ayouni, Anne Laurent, Sadok Benyahia, Pascal Poncelet. Mining Closed Gradual Patterns. ICAISC: International Conference on Artificial Intelligence and Soft Computing, Jun 2010, Zakopane, Poland. pp.267-274, ⟨10.1007/978-3-642-13208-7\_34⟩. ⟨lirmm-00504029⟩
90 View
111 Download



Gmail Mastodon Facebook X LinkedIn More