Performance Analysis of Quickreduct, Quick Relative Reduct Algorithm and a New Proposed Algorithm

α
Ashima Gawar
Ashima Gawar
σ
Prerna Mahajan
Prerna Mahajan
α Guru Gobind Singh Indraprastha University Guru Gobind Singh Indraprastha University

Send Message

To: Author

Performance Analysis of Quickreduct, Quick Relative Reduct Algorithm	and a New Proposed Algorithm

Article Fingerprint

ReserarchID

CSTSDE553BW

Performance Analysis of Quickreduct, Quick Relative Reduct Algorithm	and a New Proposed Algorithm Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

Feature Selection is a process of selecting a subset of relevant features from a huge dataset that satisfy method dependent criteria and thus minimize the cardinality and ensure that the accuracy and precision is not affected ,hence approximating the original class distribution of data from a given set of selected features. Feature selection and feature extraction are the two problems that we face when we want to select the best and important attributes from a given dataset Feature selection is a step in data mining that is done prior to other steps and is found to be very useful and effective in removing unimportant attributes so that the storage efficiency and accuracy of the dataset can be increased. From a huge pool of data available we want to extract useful and relevant information. The problem is not the unavailability of data , it is the quality of data that we lack in.. We have Rough Sets Theory which is very useful in extracting relevant attributes and help to increase the importance of the information system we have. Rough set theory works on the principle of classifying similar objects into classes with respect to some features and those features may collectively and shortly be termed as reducts.

References

10 Cites in Article
  1. G Jothi.,H Hannah Inbarani. (2012). Soft set based quick reduct approach for unsupervised feature selection.
  2. Z Pawlak (1982). Rough sets.
  3. C Velayutham,K Thangavel (2011). Unsupervised Quick Reduct Algorithm Using Rough Set Theory.
  4. calculating discernibility functions which can be.
  5. Jing Zhang,Jianmin Wang,Deyi Li,Huacan He,Jiaguang Sun (2003). A New Heuristic Reduct Algorithm Base on Rough Sets Theory.
  6. N Suguna,Dr,K Thanushkodi (2010). A Novel Rough Set Reduct Algorithm for Medical Domain Based on Bee Colony Optimization.
  7. T Chandrasekhar,K Thangavel,E Elayaraja,E Sathishkumar (2012). Unsupervised gene expression data using enhanced clustering method.
  8. R Slowinski,D Vanderpooten (2000). A generalized definition of rough approximations based on similarity.
  9. Y Yiyu,Yan (2009). Discernibility Matrix Simpli_cation for Constructing Attribute Reducts Discernibility matrix simplication for constructing attribute reducts.
  10. Y Yao,S Wong,T Lin (1997). A Review of Rough Set Models.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Ashima Gawar. 2014. \u201cPerformance Analysis of Quickreduct, Quick Relative Reduct Algorithm and a New Proposed Algorithm\u201d. Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 14 (GJCST Volume 14 Issue C4): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Version of record

v1.2

Issue date

July 5, 2014

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 8689
Total Downloads: 2133
2026 Trends
Related Research

Published Article

Feature Selection is a process of selecting a subset of relevant features from a huge dataset that satisfy method dependent criteria and thus minimize the cardinality and ensure that the accuracy and precision is not affected ,hence approximating the original class distribution of data from a given set of selected features. Feature selection and feature extraction are the two problems that we face when we want to select the best and important attributes from a given dataset Feature selection is a step in data mining that is done prior to other steps and is found to be very useful and effective in removing unimportant attributes so that the storage efficiency and accuracy of the dataset can be increased. From a huge pool of data available we want to extract useful and relevant information. The problem is not the unavailability of data , it is the quality of data that we lack in.. We have Rough Sets Theory which is very useful in extracting relevant attributes and help to increase the importance of the information system we have. Rough set theory works on the principle of classifying similar objects into classes with respect to some features and those features may collectively and shortly be termed as reducts.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Performance Analysis of Quickreduct, Quick Relative Reduct Algorithm and a New Proposed Algorithm

Ashima Gawar
Ashima Gawar Guru Gobind Singh Indraprastha University
Prerna Mahajan
Prerna Mahajan

Research Journals