Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Predicting Session Length in Media Streaming
RISE SICS, Stockholm, Sweden.
Pandora.
Pandora.
Pandora.
2017 (English)In: SIGIR 2017 - Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, Association for Computing Machinery (ACM), 2017, p. 977-980Conference paper, Published paper (Refereed)
Abstract [en]

Session length is a very important aspect in determining a user's satisfaction with a media streaming service. Being able to predict how long a session will last can be of great use for various downstream tasks, such as recommendations and ad scheduling. Most of the related literature on user interaction duration has focused on dwell time for websites, usually in the context of approximating post-click satisfaction either in search results, or display ads.

In this work we present the first analysis of session length in a mobile-focused online service, using a real world data-set from a major music streaming service. We use survival analysis techniques to show that the characteristics of the length distributions can differ significantly between users, and use gradient boosted trees with appropriate objectives to predict the length of a session using only information available at its beginning. Our evaluation on real world data illustrates that our proposed technique outperforms the considered baseline.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2017. p. 977-980
Keywords [en]
User Behavior, Survival Analysis, Dwell Time, Session Length
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-250037DOI: 10.1145/3077136.3080695ISI: 000454711900127Scopus ID: 2-s2.0-85029395373ISBN: 978-1-4503-5022-8 (print)OAI: oai:DiVA.org:kth-250037DiVA, id: diva2:1307118
Conference
40th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2017; Tokyo, Shinjuku; Japan; 7 August 2017 through 11 August 2017
Funder
Swedish Foundation for Strategic Research , RIT10-0043
Note

QC 20190426

Available from: 2019-04-25 Created: 2019-04-25 Last updated: 2019-09-18Bibliographically approved
In thesis
1. Scalable Machine Learning through Approximation and Distributed Computing
Open this publication in new window or tab >>Scalable Machine Learning through Approximation and Distributed Computing
2019 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Machine learning algorithms are now being deployed in practically all areas of our lives. Part of this success can be attributed to the ability to learn complex representations from massive datasets. However, computational speed increases have not kept up with the increase in the sizes of data we want to learn from, leading naturally to algorithms that need to be resource-efficient and parallel. As the proliferation of machine learning continues, the ability for algorithms to adapt to a changing environment and deal with uncertainty becomes increasingly important.

In this thesis we develop scalable machine learning algorithms, with a focus on efficient, online, and distributed computation. We make use of approximations to dramatically reduce the computational cost of exact algorithms, and develop online learning algorithms to deal with a constantly changing environment under a tight computational budget. We design parallel and distributed algorithms to ensure that our methods can scale to massive datasets.

We first propose a scalable algorithm for graph vertex similarity calculation and concept discovery. We demonstrate its applicability to multiple domains, including text, music, and images, and demonstrate its scalability by training on one of the largest text corpora available. Then, motivated by a real-world use case of predicting the session length in media streaming, we propose improvements to several aspects of learning with decision trees. We propose two algorithms to estimate the uncertainty in the predictions of online random forests. We show that our approach can achieve better accuracy than the state of the art while being an order of magnitude faster. We then propose a parallel and distributed online tree boosting algorithm that maintains the correctness guarantees of serial algorithms while providing an order of magnitude speedup on average. Finally, we propose an algorithm that allows for gradient boosted trees training to be distributed across both the data point and feature dimensions. We show that we can achieve communication savings of several orders of magnitude for sparse datasets, compared to existing approaches that can only distribute the computation across the data point dimension and use dense communication.

Place, publisher, year, edition, pages
KTH Royal Institute of Technology, 2019. p. 120
Series
TRITA-EECS-AVL ; 2019:43
Keywords
Online Learning, Distributed Computing, Graph Similarity, Decision Trees, Gradient Boosting
National Category
Computer Sciences
Identifiers
urn:nbn:se:kth:diva-250038 (URN)978-91-7873-181-7 (ISBN)
Public defence
2019-05-28, Sal B, Kistagången 16, våningsplan 2, Electrum 1, KTH Kista, Kista, 14:00 (English)
Opponent
Supervisors
Funder
Swedish Foundation for Strategic Research , RIT10-0043Swedish Foundation for Strategic Research , BD15-0006
Note

QC 20190426

Available from: 2019-04-26 Created: 2019-04-25 Last updated: 2019-04-30Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Vasiloudis, Theodore

Search in DiVA

By author/editor
Vasiloudis, Theodore
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 10 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf