An interactive rough set attribute reduction using great deluge algorithm

Najmeh Sadat Jaddi, Salwani Abdullah

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Dimensionality reduction from an information system is a problem of eliminating unimportant attributes from the original set of attributes while avoiding loss of information in data mining process. In this process, a subset of attributes that is highly correlated with decision attributes is selected. In this paper, performance of the great deluge algorithm for rough set attribute reduction is investigated by comparing the method with other available approaches in the literature in terms of cardinality of obtained reducts (subsets), time required to obtain reducts, number of calculating dependency degree functions, number of rules generated by reducts, and the accuracy of the classification. An interactive interface is initially developed that user can easily select the parameters for reduction. This user interface is developed toward visual data mining.The carried out model has been tested on the standard datasets available in the UCI machine learning repository. Experimental results show the effectiveness of the method especially with relation to the time and accuracy of the classification using generated rules. The method outperformed other approaches in M-of-N, Exactly, and LED datasets with achieving 100% accuracy.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages285-299
Number of pages15
Volume8237 LNCS
DOIs
Publication statusPublished - 2013
Event3rd International Visual Informatics Conference, IVIC 2013 - Selangor
Duration: 13 Nov 201315 Nov 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8237 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd International Visual Informatics Conference, IVIC 2013
CitySelangor
Period13/11/1315/11/13

Fingerprint

Attribute Reduction
Rough Set
Reduct
Attribute
Data mining
Visual Data Mining
User interfaces
Subset
Light emitting diodes
Learning systems
Information systems
Dimensionality Reduction
Repository
User Interface
Information Systems
Cardinality
Data Mining
Machine Learning
Experimental Results

Keywords

  • attribute reduction
  • classification
  • great deluge algorithm
  • interactive data mining
  • rough set theory

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Jaddi, N. S., & Abdullah, S. (2013). An interactive rough set attribute reduction using great deluge algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8237 LNCS, pp. 285-299). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8237 LNCS). https://doi.org/10.1007/978-3-319-02958-0_27

An interactive rough set attribute reduction using great deluge algorithm. / Jaddi, Najmeh Sadat; Abdullah, Salwani.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8237 LNCS 2013. p. 285-299 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8237 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jaddi, NS & Abdullah, S 2013, An interactive rough set attribute reduction using great deluge algorithm. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 8237 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8237 LNCS, pp. 285-299, 3rd International Visual Informatics Conference, IVIC 2013, Selangor, 13/11/13. https://doi.org/10.1007/978-3-319-02958-0_27
Jaddi NS, Abdullah S. An interactive rough set attribute reduction using great deluge algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8237 LNCS. 2013. p. 285-299. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-02958-0_27
Jaddi, Najmeh Sadat ; Abdullah, Salwani. / An interactive rough set attribute reduction using great deluge algorithm. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8237 LNCS 2013. pp. 285-299 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3e776815258a4dea98a7b16d6700420d,
title = "An interactive rough set attribute reduction using great deluge algorithm",
abstract = "Dimensionality reduction from an information system is a problem of eliminating unimportant attributes from the original set of attributes while avoiding loss of information in data mining process. In this process, a subset of attributes that is highly correlated with decision attributes is selected. In this paper, performance of the great deluge algorithm for rough set attribute reduction is investigated by comparing the method with other available approaches in the literature in terms of cardinality of obtained reducts (subsets), time required to obtain reducts, number of calculating dependency degree functions, number of rules generated by reducts, and the accuracy of the classification. An interactive interface is initially developed that user can easily select the parameters for reduction. This user interface is developed toward visual data mining.The carried out model has been tested on the standard datasets available in the UCI machine learning repository. Experimental results show the effectiveness of the method especially with relation to the time and accuracy of the classification using generated rules. The method outperformed other approaches in M-of-N, Exactly, and LED datasets with achieving 100{\%} accuracy.",
keywords = "attribute reduction, classification, great deluge algorithm, interactive data mining, rough set theory",
author = "Jaddi, {Najmeh Sadat} and Salwani Abdullah",
year = "2013",
doi = "10.1007/978-3-319-02958-0_27",
language = "English",
isbn = "9783319029573",
volume = "8237 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "285--299",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - An interactive rough set attribute reduction using great deluge algorithm

AU - Jaddi, Najmeh Sadat

AU - Abdullah, Salwani

PY - 2013

Y1 - 2013

N2 - Dimensionality reduction from an information system is a problem of eliminating unimportant attributes from the original set of attributes while avoiding loss of information in data mining process. In this process, a subset of attributes that is highly correlated with decision attributes is selected. In this paper, performance of the great deluge algorithm for rough set attribute reduction is investigated by comparing the method with other available approaches in the literature in terms of cardinality of obtained reducts (subsets), time required to obtain reducts, number of calculating dependency degree functions, number of rules generated by reducts, and the accuracy of the classification. An interactive interface is initially developed that user can easily select the parameters for reduction. This user interface is developed toward visual data mining.The carried out model has been tested on the standard datasets available in the UCI machine learning repository. Experimental results show the effectiveness of the method especially with relation to the time and accuracy of the classification using generated rules. The method outperformed other approaches in M-of-N, Exactly, and LED datasets with achieving 100% accuracy.

AB - Dimensionality reduction from an information system is a problem of eliminating unimportant attributes from the original set of attributes while avoiding loss of information in data mining process. In this process, a subset of attributes that is highly correlated with decision attributes is selected. In this paper, performance of the great deluge algorithm for rough set attribute reduction is investigated by comparing the method with other available approaches in the literature in terms of cardinality of obtained reducts (subsets), time required to obtain reducts, number of calculating dependency degree functions, number of rules generated by reducts, and the accuracy of the classification. An interactive interface is initially developed that user can easily select the parameters for reduction. This user interface is developed toward visual data mining.The carried out model has been tested on the standard datasets available in the UCI machine learning repository. Experimental results show the effectiveness of the method especially with relation to the time and accuracy of the classification using generated rules. The method outperformed other approaches in M-of-N, Exactly, and LED datasets with achieving 100% accuracy.

KW - attribute reduction

KW - classification

KW - great deluge algorithm

KW - interactive data mining

KW - rough set theory

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

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

U2 - 10.1007/978-3-319-02958-0_27

DO - 10.1007/978-3-319-02958-0_27

M3 - Conference contribution

AN - SCOPUS:84887027866

SN - 9783319029573

VL - 8237 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 285

EP - 299

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -