Show simple item record

dc.contributor.advisorUlusoy, Özgür
dc.contributor.authorUsta, Arif
dc.date.accessioned2016-05-05T11:32:02Z
dc.date.available2016-05-05T11:32:02Z
dc.date.copyright2015-09
dc.date.issued2015-09
dc.date.submitted2015-09-03
dc.identifier.urihttp://hdl.handle.net/11693/29079
dc.descriptionCataloged from PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (leaves 80-87).en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2015.en_US
dc.description.abstractWeb search is one of the most popular internet activities among users. Due to high usage of search engines, there are huge data available about history of user search issues. Using query logs as a source of implicit feedback, researchers can learn useful patterns about general search behaviors. We employ a detailed query log analysis provided by a commercial educational vertical search engine. We compare the results of our query log analysis with the general web search characteristics. Due to di erence in terms of search behavior between web users and students, we propose an educational ranking model using learning to rank algorithms to better re ect the search habits of the students in the educational domain to further enhance the search engine performance. We introduce novel features best suited to the educational domain. We show that our model including educational features outperforms two baseline models which are the original ranking of the commercial educational vertical search engine and the model constructed using the state of the art ranking functions, up to 14% and 11%, respectively. We also employ di erent learning to rank models for di erent clusters of queries and the results indicate that having models for each cluster of queries further enhances the performance of our proposed model. Speci cally, the course of the query and the grade of the user issuing the query are good sources of feedback to have a better model in the educational domain. We propose a novel Propagation Algorithm to be used for queries having lower frequencies where information derived from query logs is not enough to exploit. We report that our model constructed using the features generated by our proposed algorithm performs better for singleton queries compared to both the educational learning to rank model we introduce and models learned with common features introduced in the literature.en_US
dc.description.statementofresponsibilityby Arif Usta.en_US
dc.format.extentxiv, 87 leaves.en_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectInformation retrievalen_US
dc.subjectWeb searchen_US
dc.subjectVertical search engineen_US
dc.subjectLearning to rank algorithmsen_US
dc.subjectEducational domainen_US
dc.titleOptimization of an educational search engine using learning to rank algorithmsen_US
dc.title.alternativeSıralama amaçlı öğrenme algoritmaları kullanarak eğitim tabanlı arama motoru optimizasyonuen_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidB151169


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record