Yury Maximov

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Aleksandra Burashnikova

> Home > Persons > Yury Maximov

Publications

2022
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/ecir/BurashnikovaCAM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ecir/BurashnikovaCAM22
Aleksandra Burashnikova, Marianne Clausel, Massih-Reza Amini, Yury Maximov, Nicolas Dante:
Recommender Systems: When Memory Matters. ECIR (2) 2022: 56-63
[i21]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2202-13240
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2202-13240
Aleksandra Burashnikova, Yury Maximov, Marianne Clausel, Charlotte Laclau, Franck Iutzeler, Massih-Reza Amini:
Learning over No-Preferred and Preferred Sequence of Items for Robust Recommendation (Extended Abstract). CoRR abs/2202.13240 (2022)
[i17]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2209-01021
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2209-01021
Aleksandra Burashnikova, Wenting Li, Massih Amini, Deepjyoti Deka, Yury Maximov:
Ranking-Based Physics-Informed Line Failure Detection in Power Grids. CoRR abs/2209.01021 (2022)
2021
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jair/BurashnikovaMCL21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jair/BurashnikovaMCL21
Aleksandra Burashnikova, Yury Maximov, Marianne Clausel, Charlotte Laclau, Franck Iutzeler, Massih-Reza Amini:
Learning over No-Preferred and Preferred Sequence of Items for Robust Recommendation. J. Artif. Intell. Res. 71: 121-142 (2021)
[i15]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2112-02242
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2112-02242
Aleksandra Burashnikova, Marianne Clausel, Massih-Reza Amini, Yury Maximov, Nicolas Dante:
Recommender systems: when memory matters. CoRR abs/2112.02242 (2021)
2020
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2012-06910
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2012-06910
Aleksandra Burashnikova, Marianne Clausel, Charlotte Laclau, Frack Iutzeller, Yury Maximov, Massih-Reza Amini:
Learning over no-Preferred and Preferred Sequence of items for Robust Recommendation. CoRR abs/2012.06910 (2020)
2019
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/pkdd/BurashnikovaMA19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pkdd/BurashnikovaMA19
Aleksandra Burashnikova, Yury Maximov, Massih-Reza Amini:
Sequential Learning over Implicit Feedback for Robust Large-Scale Recommender Systems. ECML/PKDD (3) 2019: 253-269
[i12]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1902-08495
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1902-08495
Alexandra Burashnikova, Yury Maximov, Massih-Reza Amini:
Sequential Learning over Implicit Feedback for Robust Large-Scale Recommender Systems. CoRR abs/1902.08495 (2019)

a service of

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.