Dynamic discreduction using Rough Sets

Authors:
P. Dey;S. Dey;S. Datta;J. Sil
Affiliations:
School of Materials Science and Engineering, Bengal Engineering and Science University, Shibpur, Howrah 711 103, India;School of Materials Science and Engineering, Bengal Engineering and Science University, Shibpur, Howrah 711 103, India;Birla Institute of Technology, Deoghar, Jasidih, Deoghar 814 142, India;Department of Computer Science and Technology, Bengal Engineering and Science University, Shibpur, Howrah 711 103, India
Venue:
Applied Soft Computing
Year:
2011

Citing 12
Cited 1

On the Handling of Continuous-Valued Attributes in Decision Tree Generation

Machine Learning
Very Simple Classification Rules Perform Well on Most Commonly Used Datasets

Machine Learning
Discretization: An Enabling Technique

Data Mining and Knowledge Discovery
Discretization of Continuous Attributes for Learning Classification Rules

PAKDD '99 Proceedings of the Third Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining
Discovering Numeric Association Rules via Evolutionary Algorithm

PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Khiops: A Statistical Discretization Method of Continuous Attributes

Machine Learning
Data Discretization Unification

ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Rough sets approach to symbolic value partition

International Journal of Approximate Reasoning
Attribute reduction and optimal decision rules acquisition for continuous valued information systems

Information Sciences: an International Journal
Using Resampling Techniques for Better Quality Discretization

MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
An Extended Comparison of Six Approaches to Discretization - A Rough Set Approach

Fundamenta Informaticae - Fundamentals of Knowledge Technology
Reduction and Dynamic Discretization of Multi-attribute Based on Rough Set

WCSE '09 Proceedings of the 2009 WRI World Congress on Software Engineering - Volume 03

Attribute reduction for dynamic data sets

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Discretization of continuous attributes is a necessary pre-requisite in deriving association rules and discovery of knowledge from databases. The derived rules are simpler and intuitively more meaningful if only a small number of attributes are used, and each attribute is discretized into a few intervals. The present research paper explores the interrelation between discretization and reduction of attributes. A method has been developed that uses Rough Set Theory and notions of Statistics to merge the two tasks into a single seamless process named dynamic discreduction. The method is tested on benchmark data sets and the results are compared with those obtained by existing state-of-the-art techniques. A real life data on TRIP steel is also analysed using the proposed method.