<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T14:32:57Z</responseDate><request verb="GetRecord" identifier="oai:mountainscholar.org:10217/244101" metadataPrefix="dim">https://api.mountainscholar.org/server/oai/request</request><GetRecord><record><header><identifier>oai:mountainscholar.org:10217/244101</identifier><datestamp>2026-04-23T11:02:49Z</datestamp><setSpec>com_10217_100532</setSpec><setSpec>com_10217_100000</setSpec><setSpec>com_10217_100388</setSpec><setSpec>com_10217_100303</setSpec><setSpec>col_10217_100538</setSpec><setSpec>col_10217_100389</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Bins Filho, José Carlos, author</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Draper, Bruce A., advisor</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Kirby, Michael, committee member</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Beveridge, J. Ross, committee member</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Anderson, Charles W., committee member</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2026-04-22T18:19:07Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2000</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/10217/244101</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.25675/3.026725</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Most learning systems use hand-picked sets of features as input data for their learning algorithms. This is particularly true of computer vision systems, where the number of features that can be computed over an image is, for practical purposes, limitless. Unfortunately, most of these features are irrelevant or redundant to a given task, and no feature selection algorithm to date can handle such large feature sets. Moreover, many standard feature selection algorithms perform poorly when faced with many irrelevant and redundant features. This work addresses the feature selection problem by proposing a three-step algorithm. The first step uses an algorithm based on the well known algorithm called Relief [54] to remove irrelevance: the second step clusters features using K-means to remove redundancy: and the third step is a standard feature selection algorithm. This three-step algorithm is shown to be more effective than standard feature selection algorithms for data with lots of irrelevance and redundancy. In other experiment a data set with 4096 features was reduced to 5% of its original size with very little information loss. In addition, we modify Relief to remove its bias against non-monotonic features and use correlation as the distance measure for K-means.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="medium">doctoral dissertations</dim:field>
   <dim:field mdschema="dc" element="language">English</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">eng</dim:field>
   <dim:field mdschema="dc" element="publisher">Colorado State University. Libraries</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="ispartof">2000-2019</dim:field>
   <dim:field mdschema="dc" element="rights">Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="license">Per the terms of a contractual agreement, all use of this item is limited to the non-commercial use of Colorado State University and its authorized users.</dim:field>
   <dim:field mdschema="dc" element="subject">computer science</dim:field>
   <dim:field mdschema="dc" element="title">Feature selection from huge feature sets in the context of computer vision</dim:field>
   <dim:field mdschema="dc" element="type">Text</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Doctor of Philosophy (Ph.D.)</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctoral</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Computer Science</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Colorado State University</dim:field>
   <dim:field mdschema="dcterms" element="rights" qualifier="dpla">This Item is protected by copyright and/or related rights (https://rightsstatements.org/vocab/InC/1.0/). You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>