Ad-hoc Holistic Ranking Aggregation
| dc.contributor.author | Saleeb, Mina | |
| dc.date.accessioned | 2012-12-06T18:38:03Z | |
| dc.date.available | 2012-12-06T18:38:03Z | |
| dc.date.issued | 2012-12-06T18:38:03Z | |
| dc.date.submitted | 2012 | |
| dc.description.abstract | Data exploration is considered one of the major processes that enables the user to analyze massive amount of data in order to find the most important and relevant informa- tion needed. Aggregation and Ranking are two of the most frequently used tools in data exploration. The interaction between ranking and aggregation has been studied widely from different perspectives. In this thesis, a comprehensive survey about this interaction is studied. Holistic Ranking Aggregation which is a new interaction is introduced. Finally, various algorithms are proposed to efficiently process ad-hoc holistic ranking aggregation for both monotone and generic scoring functions. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/7141 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.subject | Ranking | en |
| dc.subject | Aggregation | en |
| dc.subject.program | Computer Science | en |
| dc.title | Ad-hoc Holistic Ranking Aggregation | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | School of Computer Science | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |