default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOleg Lashinin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Conference and Workshop Papers
- 2024
[c11]Aleksandr Milogradskii
, Oleg Lashinin, Alexander P, Marina Ananyeva, Sergey Kolesnikov:
Revisiting BPR: A Replicability Study of a Common Recommender System Baseline. RecSys 2024: 267-277- 2023
- [c10]Veronika Ivanova, Oleg Lashinin, Marina Ananyeva, Sergey Kolesnikov:
RecBaselines2023: a new dataset for choosing baselines for recommender models. BIR@ECIR 2023: 52-65 - [c9]Denis Krasilnikov, Oleg Lashinin, Maksim Tsygankov, Marina Ananyeva, Sergey Kolesnikov:
Utilising Crowdsourcing to Assess the Effectiveness of Item-based Explanations of Merchant Recommendations. CSW@WSDM 2023: 77-86 - [c8]Sergey Naumov, Marina Ananyeva, Oleg Lashinin, Sergey Kolesnikov, Dmitry I. Ignatov:
Time-Dependent Next-Basket Recommendations. ECIR (2) 2023: 502-511 - [c7]Oleg Lashinin, Kirill Bykov, Marina Ananyeva, Sergey Kolesnikov:
GPT3RecBot: a universal chatbot recommender of movies, books and music in Telegram. KaRS@RecSys 2023: 35-43 - [c6]Denis Krasilnikov, Oleg Lashinin, Marina Ananyeva, Sergey Kolesnikov:
Next-basket Recommendation Constrained by Total Cost. ORSUM@RecSys 2023 - [c5]Aleksey Romanov, Oleg Lashinin, Marina Ananyeva, Sergey Kolesnikov:
Time-Aware Item Weighting for the Next Basket Recommendations. RecSys 2023: 985-992 - [c4]Elizaveta Makhneva, Anna Sverkunova, Oleg Lashinin, Marina Ananyeva, Sergey Kolesnikov:
Make your next item recommendation model time sensitive. UMAP (Adjunct Publication) 2023: 191-195 - 2022
- [c3]Marina Ananyeva, Oleg Lashinin, Veronika Ivanova, Sergey Kolesnikov, Dmitry I. Ignatov:
Towards Interaction-based User Embeddings in Sequential Recommender Models. ORSUM@RecSys 2022 - [c2]Marina Ananyeva, Oleg Lashinin, Maria Kuznetsova:
Revisiting the performance evaluation of knowledge-aware recommender systems: are we making progress? KaRS@RecSys 2022: 22-28 - [c1]Oleg Lashinin, Marina Ananyeva:
Next-basket Recommendation Constrained by Total Cost. ORSUM@RecSys 2022
Informal and Other Publications
- 2024
- [i4]Aleksandr Milogradskii, Oleg Lashinin, Alexander P, Marina Ananyeva, Sergey Kolesnikov:
Revisiting BPR: A Replicability Study of a Common Recommender System Baseline. CoRR abs/2409.14217 (2024) - 2023
- [i3]Veronika Ivanova, Oleg Lashinin, Marina Ananyeva, Sergey Kolesnikov:
RecBaselines2023: a new dataset for choosing baselines for recommender models. CoRR abs/2306.14292 (2023) - [i2]Aleksey Romanov, Oleg Lashinin, Marina Ananyeva, Sergey Kolesnikov:
Time-Aware Item Weighting for the Next Basket Recommendations. CoRR abs/2307.16297 (2023) - 2021
- [i1]Sergey Kolesnikov, Oleg Lashinin, Michail Pechatov, Alexander Kosov:
TTRS: Tinkoff Transactions Recommender System benchmark. CoRR abs/2110.05589 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
