Investigating composite neighbourhood structure for attribute reduction in rough set theory
Authors:
- 1 November 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1183-1188
Abstract
Attribute reduction is one of the main issues in the theoretical research of rough set theory which is known as a NP-hard optimization problem. The objective is to find the minimal number of attributes from a large dataset. Hence it is difficult to solve to optimality. This paper proposes a composite neighbourhood structure approach to solve the attribute reduction problem that consists of two versions. The first version is a basic composite neighbourhood structure (CNS) approach where the neighbourhood is selected at random. For the second version, the selection of the neighbourhood structure is based on certain rules (coded as IS-CNS). Both of the algorithms only accept an improved solution. The proposed approach is tested on a set of benchmark datasets taken from University of California, Irvine (UCI) machine learning respiratory in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed approach is able to produce competitive results for the test datasets.Keywords
This publication has 13 references indexed in Scilit:
- An efficient ant colony optimization approach to attribute reduction in rough set theoryPattern Recognition Letters, 2008
- Scatter Search for Rough Set Attribute Reduction2007
- A general approach to attribute reduction in rough set theoryScience China Information Sciences, 2007
- Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approachesIEEE Transactions on Knowledge and Data Engineering, 2004
- A tabu search algorithm for parallel machine total tardiness problemComputers & Operations Research, 2004
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problemComputers & Operations Research, 2003
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problemOperations Research Letters, 2003
- A tabu search heuristic for preventive maintenance schedulingComputers & Industrial Engineering, 2001
- Sequencing of jobs in some production systemEuropean Journal of Operational Research, 2000
- Uncertainty measures of rough set predictionArtificial Intelligence, 1998