Könyv Optimized Ranking-Based Techniques for Improving Aggregate Recommendation Diversity Saravana Kumar

Optimized Ranking-Based Techniques for Improving Aggregate Recommendation Diversity

Nyelv: Angol
Kötés: Puha kötésű
Kiadó: Grin Publishing
Elérhetőség: Beszállítói készleten
Küldés 8-11 napon belül
5 436 Ft
Master's Thesis from the year 2013 in the subject Computer Science - Miscellaneous, grade: 1, , cour...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
2013
oldal
20
EAN
9783656563242
ISBN
3656563241
Enbook ID
05284452
Súly
54
Méretek
178 x 254 x 1

Teljes leírás

Master's Thesis from the year 2013 in the subject Computer Science - Miscellaneous, grade: 1, , course: ME computer science, language: English, abstract: This paper investigates how demand-side factors contribute to the Internet s Long Tail phenomenon. It first models how a reduction in search costs will affect the concentration in product sales. Then, by analyzing data collected from a multi-channel retailing company, it provides empirical evidence that the Internet channel exhibits a significantly less concentrated sales distribution, when compared with traditional channels. The difference in the sales distribution is highly significant, even after controlling for consumer differences. Furthermore, the effect is particularly strong for individuals with more prior experience using the Internet channel. We find evidence that Internet purchases made by consumers with prior Internet experience are more skewed toward obscure products, compared with consumers who have no such experience. We observe the opposite outcome when comparing purchases by the same consumers through the catalog channel. If the relationships we uncover persist, the underlying trends in technology and search costs portend an ongoing shift in the distribution of product sales. Singular Value Decomposition (SVD), together with the Expectation-Maximization (EM) procedure, can be used to find a low-dimension model that maximizes the log likelihood of observed ratings in recommendation systems. However, the computational cost of this approach is a major concern, since each iteration of the EM algorithm requires a new SVD computation. We present a novel algorithm that incorporates SVD approximation into the EM procedure to reduce the overall computational cost while maintaining accurate predictions. Furthermore, we propose a new framework for collaborating filtering in distributed recommendation systems that allows users to maintain their own rating profiles for privacy. We conduct offline and online tests of our ranking algorithm. We use Yahoo! Search queries that resulted in a click on a Yahoo! Movies or Internet Movie Database (IMDB) movie URL. Our online test involved 44 Yahoo! Employees providing subjective assessments of results quality. In both tests, our ranking methods show significantly better recall and quality than IMDB search and Yahoo! Movies current search. Reduced rank approximation of matrices has hitherto been possible only by un-weighted least squares. This paper presents iterative techniques for obtaining such approximations when weights are introduced.

Érdekelheti

Hypnosis

James W. VanStone
86 668 Ft

Reconsiderations

Ernest Edward Kellett
12 456 Ft
12 083 Ft

Just a Girl

Charles Garvice
10 418 Ft

Modular Origami Kaleidoscope

Ekaterina Lukasheva
7 186 Ft
7 146 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

6 077 Ft

V temnotě

Cara Hunterová
4 542 Ft

Erdbeere und Azalee

Anne Kordasch
3 102 Ft
9 264 Ft
5 422 Ft