2008
DOI: 10.1002/tee.20256
|View full text |Cite
|
Sign up to set email alerts
|

Association Rule Mining for Continuous Attributes using Genetic Network Programming

Abstract: Most of the existing association rule mining algorithms are able to extract knowledge from databases with attributes of binary values. However, in real-world applications, databases are usually composed of continuous values such as height, length or weight. If the attributes are continuous, the algorithms are commonly integrated with a discretization method that transforms them into discrete attributes. Discretization is a process of transforming a continuous attribute value into a finite number of intervals a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 19 publications
(16 citation statements)
references
References 18 publications
0
16
0
Order By: Relevance
“…Genetic programming for mining continuous variable is used in [21]. Fuzzy sets are also used as a tool to overcome the problems brought by discretization [22], [23].…”
Section: Review Of Literaturementioning
confidence: 99%
“…Genetic programming for mining continuous variable is used in [21]. Fuzzy sets are also used as a tool to overcome the problems brought by discretization [22], [23].…”
Section: Review Of Literaturementioning
confidence: 99%
“…The judgment node has a one‐to‐one correspondence with the attribute in the database. The transition in the judgment nodes represents a subset of candidate CARs [20], while the processing node calculates the importance measures of those candidate CARs. As shown in Fig.…”
Section: Related Work and Problems Analysismentioning
confidence: 99%
“…Using the geometric distances in the traditional PCA‐based face recognition algorithm is another problem leading to the low accuracy and low robustness under the MTIP‐CID condition. In this section, a robust FCAR‐based classifier constructed by GNP‐FDM [20] is applied to all the clusters of \documentclass{article}\usepackage{amsmath}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{amsfonts}\pagestyle{empty}\begin{document}$\mathrm{{FD}}_{\mathrm{{pca}}}^{2}$\end{document} to solve this problem. Compared with traditional CARs‐based classifiers, fuzzification is used in the GNP‐FDM to deal with the continuous attributes in \documentclass{article}\usepackage{amsmath}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{amsfonts}\pagestyle{empty}\begin{document}$\mathrm{{FD}}_{\mathrm{{pca}}}^{2}$\end{document} and to reduce the influence of the fluctuations of the instances caused by noise on the recognition accuracy.…”
Section: Robust Fcar‐based Classifiermentioning
confidence: 99%
See 1 more Smart Citation
“…Genetic Programming This theory is a biologically inspired evolutionary theory for solving multiobjective optimization problems. Recent developments in association rule mining using genetic network programming are described in [158,167,186]. Genetic programming was used for mining association rules in temporal data [79] and an extension called Grammar Guided Genetic Programming (G3P ) for solving the problem of generating invalid individuals was proposed [47,179].…”
Section: Evolutionary Frameworkmentioning
confidence: 99%