Design And Analysis Of Entropy Based Ranking Measures For Knowledge Discovery

dc.contributor.guideGhose, Udayan
dc.coverage.spatial
dc.creator.researcherRashmi
dc.date.accessioned2023-01-13T06:30:25Z
dc.date.available2023-01-13T06:30:25Z
dc.date.awarded2022
dc.date.completed2021
dc.date.registered2014
dc.description.abstractWith the widespread use of digital data in this digital era, many features of data as knowledge are extensively stored for providing visual information. However, in large databases the storing of data exists in multiple forms like computational, statistical, and mathematical etc. Therefore, to provide information from the complete data requires ample storage space, high execution time and cost for pro cessing. Hence, there is a need to create a system that supports easy and quick finding new knowledge from databases. This process is known as knowledge dis covery. In this research work, the various novel designs and analysis of entropy based ranking measures are proposed and investigated for knowledge discovery. This research work is broadly classified in three parts, first to design feature se lection algorithms using entropy that select informative features, second to design data reduction algorithms using information and fuzzy approaches and third, to develop new algorithms with the use of evolutionary algorithms for knowledge discovery. The proposed feature selection algorithms based on fuzzy entropy for removal of redundant and irrelevant attributes results in reducing the dataset size and in turn takes lesser time for computation, more understandable and intel ligible. Thus, the attribute reduction proved to be an efficient tool for feature selection using fuzzy entropy with the proper choice of filter based on fuzzy uncer tainty, roughness, and decomposition as it helps in efficient transformation of data to knowledge. The feature selection of binary class data sets using hybrid entropy, rough entropy and SVD entropy are examined and evaluated on benchmark data sets of different fields. The presented algorithms provide non-dominated solutions to obtain a smaller number of features and superior classification performance on different classifiers such as k-Nearest Neighbours (KNN), Support Vector Machine (SVM), and Multi-Layer Perceptron - Artificial Neural Network (MLP-ANN). The performance of ...
dc.description.note
dc.format.accompanyingmaterialDVD
dc.format.dimensions29cm
dc.format.extentxiii,128
dc.identifier.urihttp://hdl.handle.net/10603/444980
dc.languageEnglish
dc.publisher.institutionUniversity School of Information and Communication Technology
dc.publisher.placeDelhi
dc.publisher.universityGuru Gobind Singh Indraprastha University
dc.relation
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordComputer Science
dc.subject.keywordComputer Science Theory and Methods
dc.subject.keywordEngineering and Technology
dc.titleDesign And Analysis Of Entropy Based Ranking Measures For Knowledge Discovery
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
80_recommendation.pdf
Size:
902.74 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
rashmi thesis.pdf
Size:
960.88 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: