The electronic primaries: predicting the U.S. Presidency using feature selection with safe data reduction

Pablo Moscato*, Luke Mathieson, Alexandre Mendes, Regina Berretta

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

5 Citations (Scopus)

Abstract

The data mining inspired problem of finding the critical, and most useful features to be used to classify a data set, and construct rules to predict the class of future examples is an interesting and important problem. It is also one of the most useful problems with applications in many areas such as microarray analysis, genomics, proteomics, pattern recognition, data compression and knowledge discovery. Expressed as κ-Feature Set it is also a formally hard problem. In this paper we present a method for coping with this hardness using the combinatorial optimisation and parameterized complexity inspired technique of sound reduction rules. We apply our method to an interesting data set which is used to predict the winner of the popular vote in the U.S. presidential elections. We demonstrate the power and exibility of the reductions, especially when used in the context of the (α β)κ-Feature Set variant problem.

Original languageEnglish
Title of host publicationComputer Science 2005 - 28th Australasian Computer Science Conference, ACSC 2005
EditorsVladimir Estivill-Castro
Pages371-380
Number of pages10
Volume38
Publication statusPublished - 2005
Event28th Australasian Computer Science Conference, ACSC - 2005 - Newcastle, Australia
Duration: 31 Jan 20053 Feb 2005

Other

Other28th Australasian Computer Science Conference, ACSC - 2005
CountryAustralia
CityNewcastle
Period31/01/053/02/05

Fingerprint Dive into the research topics of 'The electronic primaries: predicting the U.S. Presidency using feature selection with safe data reduction'. Together they form a unique fingerprint.

Cite this