Browse

The Virtual University, Pakistan’s first University based completely on modern Information and Communication Technologies, was established by the Government as a public sector, not-for-profit institution with a clear mission: to provide extremely affordable world class education to aspiring students all over the country.

Using free-to-air satellite television broadcasts and the Internet, the Virtual University allows students to follow its rigorous programs regardless of their physical locations. It thus aims at alleviating the lack of capacity in the existing universities while simultaneously tackling the acute shortage of qualified professors in the country. By identifying the top Professors of the country, regardless of their institutional affiliations, and requesting them to develop and deliver hand-crafted courses, the Virtual University aims at providing the very best courses to not only its own students but also to students of all other universities in the country.

A NOVEL TECHNIQUE FOR FINDING ROUGH SET BASED DYNAMIC REDUCTS

Download

Author: ASMAT IQBAL


Citable URI : https://vspace.vu.edu.pk/detail.aspx?id=156

Publisher : Virtual University

Date Issued: 11/9/2018 12:00:00 AM


Abstract

Volumetric increase in data along with the curse of dimensionality has diverted the recent trends of computer science. Processing such a massive amount of data is a computationally expensive job. Feature selection is the process of selecting subset of data from the entire dataset that contains most of the information. The selected subset is called Reduct. Feature selection has materialized the idea of jumbling with attributes. Subset of attributes is favored which bounces the same information as the wide-ranging set of variables. Various dynamic reduct finding algorithms have been proposed. Dynamic reducts is an extension to the idea of reduct extraction based on rough set. Sub-tables are randomly drawn from the original decision table and reducts are extracted from these sub-tables. These reducts are considered to be the stable reducts for complete dataset. However, all the existing dynamic reduct finding algorithms are computationally too expensive to be used for datasets beyond smaller size. In this research, a novel dynamic reduct finding technique based on rough set theory is proposed, where dynamic reducts and relative dependency are the two key notions. Reducts are selected, optimized and further generalized through strenuous Parallel Feature Sampling (PFS) algorithm. In-depth analysis is performed using various benchmark datasets to justify the proposed approach. Results have shown that the proposed algorithm outperforms the existing state of the art approaches in terms of both efficiency and effectiveness.


URI : https://vspace.vu.edu.pk/details.aspx?id=156

Citation: Iqbal, A(2018), A NOVEL TECHNIQUE FOR FINDING ROUGH SET BASED DYNAMIC REDUCTS. Virtual University of Pakistan.(Lahore, Pakistan).

Version : Final Version

Terms of Use :

Detailed Terms :

Journal :

Files in this item

Name Size Format
Spring 2018_CS720_ms150400478.pdf 1233kb pdf


Copyright 2016 © Virtual University of Pakistan