dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniversidade de São Paulo (USP)
dc.date.accessioned2019-10-06T15:30:55Z
dc.date.accessioned2022-12-19T18:28:55Z
dc.date.available2019-10-06T15:30:55Z
dc.date.available2022-12-19T18:28:55Z
dc.date.created2019-10-06T15:30:55Z
dc.date.issued2018-01-01
dc.identifierLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10632 LNAI, p. 336-351.
dc.identifier1611-3349
dc.identifier0302-9743
dc.identifierhttp://hdl.handle.net/11449/187266
dc.identifier10.1007/978-3-030-02837-4_28
dc.identifier2-s2.0-85059948027
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5368304
dc.description.abstractThe association rules (ARs) post-processing step is challenging, since many patterns are extracted and only a few of them are useful to the user. One of the most traditional approaches to find rules that are of interestingness is the use of objective measures (OMs). Due to their frequent use, many of them exist (over 50). Therefore, when a user decides to apply such strategy he has to decide which one to use. To solve this problem this work proposes a process to cluster ARs based on their interestingness, according to a set of OMs, to obtain an ordered list containing the most relevant patterns. That way, the user does not need to know which OM to use/select nor to handle the output of different OMs lists. Experiments show that the proposed process behaves equal or better than as if the best OM had been used.
dc.languageeng
dc.relationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rightsAcesso aberto
dc.sourceScopus
dc.subjectAssociation rules
dc.subjectClustering
dc.subjectObjective measures
dc.subjectPost-processing
dc.titleRanking association rules by clustering through interestingness
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución