A survey of serendipity in recommender systems

D Kotkov, S Wang, J Veijalainen - Knowledge-Based Systems, 2016 - Elsevier
Recommender systems use past behaviors of users to suggest items. Most tend to offer
items similar to the items that a target user has indicated as interesting. As a result, users …

Context neighbor recommender: Integrating contexts via neighbors for recommendations

L Zheng, F Zhu, S Huang, J **e - Information Sciences, 2017 - Elsevier
Abstract In Recommender Systems, the techniques used for modeling implicit feedback such
as search, click or purchase actions have been well studied. As additional information …

An evolutionary clustering approach based on temporal aspects for context-aware service recommendation

H Mezni, S Ait Arab, D Benslimane… - Journal of Ambient …, 2020 - Springer
Over the last years, recommendation techniques have emerged to cope with the challenging
task of optimal service selection, and to help consumers satisfy their needs and preferences …

Multimodal clustering for community detection

DI Ignatov, A Semenov, D Komissarova… - … Concept Analysis of …, 2017 - Springer
Multimodal clustering is an unsupervised technique for mining interesting patterns in n-adic
binary relations or n-mode networks. Among different types of such generalised patterns one …

Like-tasted user groups to predict ratings in recommender systems

S Jaffali, S Jamoussi, K Smaili… - Social Network Analysis …, 2020 - Springer
Recommendation systems have gained the intention of many researchers due to the growth
of the business of personalizing, sorting and suggesting products to customers. Most of the …

Approximate Density Computation for OA-Biclustering

DI Ignatov, D Komissarova, K Usmanova… - … Conference on Analysis …, 2023 - Springer
In this paper, we introduce an approach for approximate density computation of object-
attribute biclusters (OA-biclusters) given in the form (m′, g′), where (.)′ stands for Galois …

[HTML][HTML] On closure operators related to maximal tricliques in tripartite hypergraphs

DI Ignatov - Discrete Applied Mathematics, 2018 - Elsevier
Abstract Triadic Formal Concept Analysis (3FCA) was introduced by Lehman and Wille
almost two decades ago. Many researchers work in Data Mining and Formal Concept …

On containment of triclusters collections generated by quantified box operators

D Egurnov, DI Ignatov, E Mephu Nguifo - Foundations of Intelligent …, 2017 - Springer
Abstract Analysis of polyadic data (for example n-ary relations) becomes a popular task
nowadays. While several data mining techniques exist for dyadic contexts, their extensions …

Proposition d'approches de d\'eploiement des unit\'es de bord de route dans les r\'eseaux v\'ehiculaires

SB Chaabene - arxiv preprint arxiv:2110.11868, 2021 - arxiv.org
Road Side Units (RSUs) have a crucial role in maintaining Vehicular Ad-hoc Networks
(VANETs) connectivity and coverage, especially, for applications gathering or disseminating …

[PDF][PDF] Understanding Collaborative Filtering with Galois Connections

DI Ignatov, V Kursitys - Workshop Notes of the Sixth International …, 2018 - academia.edu
In this paper, we explain how Galois connection and related operators between sets of users
and items naturally arise in user-item data for forming neighbourhoods of a target user or …