Variable neighbourhood iterated improvement search algorithm for attribute reduction problems

Yahya Z. Arajy, Salwani Abdullah, Saif Kifah

Research output: Contribution to journalArticle

Abstract

Attribute reduction is one of the main contributions in Rough Set Theory (RST) that tries to find all possible reducts by eliminating redundant attributes while maintaining the information of the problem in hand. In this paper, we propose a meta-heuristic approach called a Variable Neighbourhood Iterated Improvement Search (VNS-IIS) algorithm for attribute reduction. It is a combination of the variable neighbourhood search with the iterated search algorithm where two local search algorithms i.e. a random iterated local search and a sequential iterated local search algorithm are employed in a parallel strategy. In VNS-IIS, an improved solution will always be accepted. The proposed method has been tested on the 13 well-known datasets that are available in the UCI machine learning repository. Experimental results show that the VNS-IIS is able to obtain competitive results when compared with other approaches mentioned in the literature in terms of minimal reducts.

Original languageEnglish
Pages (from-to)554-568
Number of pages15
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8886
Publication statusPublished - 2014

Fingerprint

Iterated Local Search
Attribute Reduction
Reduct
Local Search Algorithm
Search Algorithm
Variable Neighborhood Search
Rough Set Theory
Metaheuristics
Repository
Machine Learning
Attribute
Rough set theory
Experimental Results
Learning systems
Strategy

Keywords

  • Attribute Reduction
  • Iterated Search
  • Variable Neighbourhood Search

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

@article{6052c8aec96643c880cadf1998f5dfc3,
title = "Variable neighbourhood iterated improvement search algorithm for attribute reduction problems",
abstract = "Attribute reduction is one of the main contributions in Rough Set Theory (RST) that tries to find all possible reducts by eliminating redundant attributes while maintaining the information of the problem in hand. In this paper, we propose a meta-heuristic approach called a Variable Neighbourhood Iterated Improvement Search (VNS-IIS) algorithm for attribute reduction. It is a combination of the variable neighbourhood search with the iterated search algorithm where two local search algorithms i.e. a random iterated local search and a sequential iterated local search algorithm are employed in a parallel strategy. In VNS-IIS, an improved solution will always be accepted. The proposed method has been tested on the 13 well-known datasets that are available in the UCI machine learning repository. Experimental results show that the VNS-IIS is able to obtain competitive results when compared with other approaches mentioned in the literature in terms of minimal reducts.",
keywords = "Attribute Reduction, Iterated Search, Variable Neighbourhood Search",
author = "Arajy, {Yahya Z.} and Salwani Abdullah and Saif Kifah",
year = "2014",
language = "English",
volume = "8886",
pages = "554--568",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Variable neighbourhood iterated improvement search algorithm for attribute reduction problems

AU - Arajy, Yahya Z.

AU - Abdullah, Salwani

AU - Kifah, Saif

PY - 2014

Y1 - 2014

N2 - Attribute reduction is one of the main contributions in Rough Set Theory (RST) that tries to find all possible reducts by eliminating redundant attributes while maintaining the information of the problem in hand. In this paper, we propose a meta-heuristic approach called a Variable Neighbourhood Iterated Improvement Search (VNS-IIS) algorithm for attribute reduction. It is a combination of the variable neighbourhood search with the iterated search algorithm where two local search algorithms i.e. a random iterated local search and a sequential iterated local search algorithm are employed in a parallel strategy. In VNS-IIS, an improved solution will always be accepted. The proposed method has been tested on the 13 well-known datasets that are available in the UCI machine learning repository. Experimental results show that the VNS-IIS is able to obtain competitive results when compared with other approaches mentioned in the literature in terms of minimal reducts.

AB - Attribute reduction is one of the main contributions in Rough Set Theory (RST) that tries to find all possible reducts by eliminating redundant attributes while maintaining the information of the problem in hand. In this paper, we propose a meta-heuristic approach called a Variable Neighbourhood Iterated Improvement Search (VNS-IIS) algorithm for attribute reduction. It is a combination of the variable neighbourhood search with the iterated search algorithm where two local search algorithms i.e. a random iterated local search and a sequential iterated local search algorithm are employed in a parallel strategy. In VNS-IIS, an improved solution will always be accepted. The proposed method has been tested on the 13 well-known datasets that are available in the UCI machine learning repository. Experimental results show that the VNS-IIS is able to obtain competitive results when compared with other approaches mentioned in the literature in terms of minimal reducts.

KW - Attribute Reduction

KW - Iterated Search

KW - Variable Neighbourhood Search

UR - http://www.scopus.com/inward/record.url?scp=84921746855&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84921746855&partnerID=8YFLogxK

M3 - Article

VL - 8886

SP - 554

EP - 568

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -