2020
DOI: 10.1007/978-3-030-57321-8_13
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Method for Mining Informative Association Rules in Knowledge Extraction

Abstract: Minining association rules is an important problem in Knowledge Extraction (KE). This paper proposes an efficient method for mining simultaneously informative positive and negative association rules, using a new selective pair support-MGK . For this, we define four new bases of positive and negative association rules, based on Galois connetion semantics. These bases are characterized by frequent closed itemsets, maximal frequent itemsets, and their generator itemsets; it consists of the non-redundant exact and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 11 publications
0
1
0
Order By: Relevance
“…Multiple support degrees are also applied to PNARs mining to improve the interesting rules mining efciency in reference [36]. Based on the previous works, Bemarisika and Totohasina [37] proposed a two-level confdence threshold-setting method for positive and negative association rules mining to limit the number of frequent and infrequent items. Also, four confdences are introduced to solve the problem that sole confdence usually results in plenty of useless rules in reference [38].…”
Section: Pnars Mining Techniquesmentioning
confidence: 99%
“…Multiple support degrees are also applied to PNARs mining to improve the interesting rules mining efciency in reference [36]. Based on the previous works, Bemarisika and Totohasina [37] proposed a two-level confdence threshold-setting method for positive and negative association rules mining to limit the number of frequent and infrequent items. Also, four confdences are introduced to solve the problem that sole confdence usually results in plenty of useless rules in reference [38].…”
Section: Pnars Mining Techniquesmentioning
confidence: 99%
“…Very often, the response time of mining rules is not always better when the database is dense. For this, we adopt a pruning reduce-rules-space procedure [20,21]. The challenge of this procedure is to reduce the number of rules without loss of information.…”
Section: Generating Valid Association Rulesmentioning
confidence: 99%