( en | de | ru )

 

Disambiguation of "Ignatov, Dmitry I."

Author of the publication

copydeleteadd this publication to your clipboard
Time-Dependent Next-Basket Recommendations.

, , , , and . ECIR (2), volume 13981 of Lecture Notes in Computer Science, page 502-511. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Atanas Ignatov

Tanja Ignatov

Dmitry Sveshnikov

Dmitry Varentsov

Dmitry Lobaskin

 

Other publications of authors with the same name

A One-pass Triclustering Approach: Is There any Room for Big Data?, , , and . CLA, volume 1252 of CEUR Workshop Proceedings, page 231-242. CEUR-WS.org, (2014)Understanding Collaborative Filtering with Galois Connections., and . FCA4AI@IJCAI, volume 2149 of CEUR Workshop Proceedings, page 127-143. CEUR-WS.org, (2018)On the Cryptomorphism between Davis' Subset Lattices, Atomic Lattices, and Closure Systems under T1 Separation Axiom.. CoRR, (2022)How University Entrants are Choosing Their Department? Mining of University Admission Process with FCA Taxonomies., , and . EDM, page 229-234. www.educationaldatamining.org, (2011)Semi-automated knowledge discovery: identifying and profiling human trafficking., , , and . Int. J. General Systems, 41 (8): 774-804 (2012)A Note on the Number of (Maximal) Antichains in the Lattice of Set Partitions.. ICCS, volume 14133 of Lecture Notes in Computer Science, page 56-69. Springer, (2023)Towards Interaction-based User Embeddings in Sequential Recommender Models., , , , and . ORSUM@RecSys, volume 3303 of CEUR Workshop Proceedings, CEUR-WS.org, (2022)Formal concept analysis 10th International Conference, ICFCA 2012, Leuven, Belgium, May 7-10, 2012. Proceedings, , , and . Berlin; New York, Springer, (2012)Interpretable Concept-Based Classification with Shapley Values., and . ICCS, volume 12277 of Lecture Notes in Computer Science, page 90-102. Springer, (2020)On the Maximal Independence Polynomial of the Covering Graph of the Hypercube up to n=6.. ICFCA, volume 13934 of Lecture Notes in Computer Science, page 152-165. Springer, (2023)