<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Feature selection by combining feature importance and redundancy estimates</dc:title><dc:creator>Najdova,	Elena	(Avtor)
	</dc:creator><dc:creator>Džeroski,	Sašo	(Mentor)
	</dc:creator><dc:subject>feature selection</dc:subject><dc:subject>machine learning</dc:subject><dc:subject>maximum relevance minimum redundancy</dc:subject><dc:subject>classification</dc:subject><dc:subject>predictive model</dc:subject><dc:description>Feature selection is a crucial task in the process of building predictive models in machine learning. Understanding which data is relevant for our problem and what feature selection method is most compatible with our data is of vital importance to achieve good results. 

The goal of this thesis was to develop and implement software for feature selection in the machine learning task of classification, based on the maximum relevance minimum redundancy (MRMR) approach. We aimed to create a software which can be used with different measures of relevance and redundancy. 

This software is then used to compare the performance of the developed approach (choosing k features with the MRMR approach) to the performance of the classical filtering approach, where the top k features with highest relevance are selected (and their redundancy is ignored). We analyze the results and draw conclusions from them. With appropriate relevance and redundancy measures, the MRMR approach can perform much better than the filtering approach.</dc:description><dc:date>2023</dc:date><dc:date>2023-08-21 17:23:43</dc:date><dc:type>Diplomsko delo/naloga</dc:type><dc:identifier>148393</dc:identifier><dc:identifier>VisID: 36692</dc:identifier><dc:identifier>COBISS_ID: 158150403</dc:identifier><dc:language>sl</dc:language></metadata>
