Fast Algorithms for Analyzing Partially Ranked Data

Fast Algorithms for Analyzing Partially Ranked Data

Imagine your local creamery administers a survey asking their patrons to choose their five favorite ice cream flavors. Any data collected by this survey would be an example of partially ranked data, as the set of all possible flavors is only ranked into subsets of the chosen flavors and the non-chos...

Full description

Bibliographic Details
Main Author: McDermott, Matthew
Format: Others
Published: Scholarship @ Claremont 2014
Subjects:
20C30
Representations of finite symmetric groups
43-04
(Abstract Harmonic Analysis) Explicit machine computation and programs (not the theory of computation or programming)
43A30
Fourier and Fourier-Stieltjes transforms on nonabelian groups and on semigroups
Algebra
Harmonic Analysis and Representation
Other Applied Mathematics
Theory and Algorithms
Online Access:http://scholarship.claremont.edu/hmc_theses/58
http://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1061&context=hmc_theses

Internet

http://scholarship.claremont.edu/hmc_theses/58
http://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1061&context=hmc_theses

Similar Items