Mining Closed Gradual Patterns

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00504029
Contributor : Sarra Ayouni <>
Submitted on : Tuesday, April 2, 2019 - 5:17:15 PM
Last modification on : Tuesday, April 2, 2019 - 6:42:50 PM
Long-term archiving on : Wednesday, July 3, 2019 - 5:36:02 PM

File

ICAISC2010.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

130

Files downloads

33