Intelligent Selection of New Data for Ranking Algorithms

Simple item page
dc.contributor.advisorLangville, Amy
dc.contributor.committeeMemberCox, Ben
dc.contributor.committeeMemberSmirnov, Oleg
dc.contributor.committeeMemberMitchener, Garrett
dc.creatorBoyer, Kirk A.
dc.date.accessioned2016-10-18T16:13:44Z
dc.date.available2016-10-18T16:13:44Z
dc.date.issued2014-08-27
dc.description.abstractAlgorithms that rank items using paired comparison data are becoming increasingly widely applicable. New data is always being gathered to try to improve their ability to make predictions. I demonstrate that it is possible to seek data in such a way that the predictive ability of algorithms will improve without attention to the particular content of the data, present two methods of doing so, and discuss the kinds of algorithms to which they are applicable. In addition, I introduce an alteration to the Colley Matrix [6] rating algorithm that allows it to include equally-matched comparisons (ties) in a meaningful way.en_US
dc.description.sponsorshipCollege of Charleston. Graduate School; College of Charleston. Department of Mathematics.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/3077
dc.subjectAlgorithms.en_US
dc.titleIntelligent Selection of New Data for Ranking Algorithmsen_US
dc.typeThesisen_US
Files
Collections
Electronic Theses