2013
DOI: 10.5897/ijps2013.3842
|View full text |Cite
|
Sign up to set email alerts
|

Feature subset selection using association rule mining and JRip classifier

Abstract: Feature selection is an important task in many fields such as statistics and machine learning. It aims at preprocessing step that include removal of irrelevant and redundant features and the retention of useful features. Selecting the relevant features increases the accuracy and decreases the computational cost. Feature selection also helps to understand the relevant data, addressing the complexity of dimensionality. In this paper, we have proposed a technique that uses JRip classifier and association rule min… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…The WEKA workbench is used for classification, clustering and selection problems 37 , 67 . The four classifiers: Naïve Bayes 68 , support vector machines (SMO) 69 , the decision tree C4.5 (J48) 70 and the rule-based RIPPER (Jrip) 71 were implemented to analyse the DNA sequences.…”
Section: Methodsmentioning
confidence: 99%
“…The WEKA workbench is used for classification, clustering and selection problems 37 , 67 . The four classifiers: Naïve Bayes 68 , support vector machines (SMO) 69 , the decision tree C4.5 (J48) 70 and the rule-based RIPPER (Jrip) 71 were implemented to analyse the DNA sequences.…”
Section: Methodsmentioning
confidence: 99%
“…In pre-processing, the policy data obtained in Subsection 3.1 was passed as input to AWK [20] for text manipulation and labeling. AWK is a Linux/Unix text manipulation utility that searches and substitutes text.…”
Section: Pre-processing Of Policy Data To Generate a Datasetmentioning
confidence: 99%
“…This process is stopped when a subset has a place with a similar class in all the instances [31].  JRip main premise is to produce error reduction at each incremental pruning and it consists on two phases: the grow phase when it continues to add terms to the rule until it is accurate and the incrementally pruning phase of each rule [32].  CART is a tree-building technique structured as a binary recursive portioning as each node from the decision tree can be split in only two groups.…”
Section: Nomentioning
confidence: 99%