Optimistic Rough Sets Attribute Reduction using Dynamic Programming

Abstract

Nowadays, and with the current progress in technologies and business sales, databases with large amount of data exist especially in Retail Companies. The main objective of this study is to reduce the complexity of the classification problems while maintaining the prediction classification quality. We propose to apply the promising technique Rough set theory which is a new mathematical approach to data analysis based on classification of objects of interest into similarity classes, which are indiscernible with respect to some features. Since some features are of high interest, this leads to the fundamental concept of ¡§Attribute Reduction¡¨. The goal of Rough set is to enumerate good attribute subsets that have high dependence, discriminating index and significance. The naive way of is to generate all possible subsets of attribute but in high dimension cases, this approach is very inefficient while it will require 2d ƒ{1 iterations. Therefore, we propose the Dynamic programming technique in order to enumerate dynamically the optimal subsets of the reduced attributes of high interest by reducing the degree of complexity. Implementation has been developed, applied, and tested over a 3 years historical business data in Retail Business (RB). Simulations and visual analysis are shown and discussed in order to validate the accuracy of the proposed tool.

Authors and Affiliations

Walid MOUDANI , Ahmad SHAHIN , Fadi CHAKIK , Félix Mora-Camino

Keywords

Related Articles

Abs-Laplacian and Robert’s cross operator offers high speed edge detection capabilities with comparable speed-quality tradeoffs

Abs-Laplacian is a newer technique for detecting edges. While the Sobel and Prewitt seems to be used predominantly in image processing due to better edge detection. However they need higher amount of complexity twice tha...

Laser Speckle Image Processing

In this paper, Electronic laser speckle correlation technique has been adopted to measure small deformation of a specimen. A Low cost Opto-electronic Laser Speckle Interferometer is designed. Laser speckle images are cap...

Li-Fi - The Future of Internet

Wireless network has now become the most common form of internet. The use of wireless internet either at home or public places can sometimes lead to slow internet speed and increased processing time as more than one devi...

Cloud Computing Business Advantages for IT Sector 

Cloud computing is an efficacious technology to perform massive-scale and complex computing on the go. It terminates the need to maintain immoderate computing hardware, dedicated space, and software. This paper also expl...

A SURVEY ON INFRASTRUCTURE ABSTRACTION OF WIRELESS SENSOR NETWORK

Wireless Sensor Network (WSN) is an autonomous sensor. Several abstractions are harnessed to ease out the difficult WSN application development. Various parameters have been developed to satisfy the different requirement...

Download PDF file
  • EP ID EP161199
  • DOI -
  • Views 121
  • Downloads 0

How To Cite

Walid MOUDANI, Ahmad SHAHIN, Fadi CHAKIK, Félix Mora-Camino (2010). Optimistic Rough Sets Attribute Reduction using Dynamic Programming. International Journal of Computer Science & Engineering Technology, 1(2), 21-31. https://europub.co.uk/articles/-A-161199