Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Theodore Vasiloudis"'
Publikováno v:
Proceedings of the 2023 SIAM International Conference on Data Mining (SDM) ISBN: 9781611977653
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f119d41cf15bce59bfe1e9ab6f92dc5
https://doi.org/10.1137/1.9781611977653.ch99
https://doi.org/10.1137/1.9781611977653.ch99
Publikováno v:
SIGIR
The Gradient Boosted Tree (GBT) algorithm is one of the most popular machine learning algorithms used in production, for tasks that include Click-Through Rate (CTR) prediction and learning-to-rank. To deal with the massive datasets available today, m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef6a9bfecdd9372c07570e1145f734e2
http://arxiv.org/abs/1904.10522
http://arxiv.org/abs/1904.10522
Publikováno v:
Knowledge and Information Systems. 51:531-560
Appropriately defining and efficiently calculating similarities from large data sets are often essential in data mining, both for gaining understanding of data and generating processes and for building tractable representations. Given a set of object
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16f8d79c3bc83a119b3c14eec88e70c7
https://doi.org/10.1007/s10115-016-0984-2
https://doi.org/10.1007/s10115-016-0984-2
Publikováno v:
CIKM
Online boosting improves the accuracy of classifiers for unbounded streams of data by chaining them into an ensemble. Due to its sequential nature, boosting has proven hard to parallelize, even more so in the online setting. This paper introduces Boo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a585bf0558dc3a7d39a2cd57b8a5b03
https://doi.org/10.1145/3132847.3132974
https://doi.org/10.1145/3132847.3132974
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 schedul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::524e9d7a5290017a9dec8fb42daef79b
http://arxiv.org/abs/1708.00130
http://arxiv.org/abs/1708.00130
Publikováno v:
ICDM
Appropriately defining and then efficiently calculating similarities from large data sets are often essential in data mining, both for building tractable representations and for gaining understanding of data and generating processes. Here we rely on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f719e0d917072a20f43caca5be53408d
http://soda.swedishict.se/5901/
http://soda.swedishict.se/5901/