Search results1 – 2 of 2
Imen Gmach, Nadia Abaoub, Rubina Khan, Naoufel Mahfoudh and Amira Kaddour
In this article the authors will focus on the state of the art on information filtering and recommender systems based on trust. Then the authors will represent a variety…
In this article the authors will focus on the state of the art on information filtering and recommender systems based on trust. Then the authors will represent a variety of filtering and recommendation techniques studied in different literature, like basic content filtering, collaborative filtering and hybrid filtering. The authors will also examine different trust-based recommendation algorithms. It will ends with a summary of the different existing approaches and it develops the link between trust, sustainability and recommender systems.
Methodology of this study will begin with a general introduction to the different approaches of recommendation systems; then define trust and its relationship with recommender systems. At the end the authors will present their approach to “trust-based recommendation systems”.
The purpose of this study is to understand how groups of users could improve trust in a recommendation system. The authors will examine how to evaluate the performance of recommender systems to ensure their ability to meet the needs that led to its creation and to make the system sustainable with respect to the information. The authors know very well that selecting a measure must depend on the type of data to be processed and user interests. Since the recommendation domain is derived from information search paradigms, it is obvious to use the evaluation measures of information systems.
The authors presented a list of recommendations systems. They examined and compared several recommendation approaches. The authors then analyzed the dominance of collaborative filtering in the field and the emergence of Recommender Systems in social web. Then the authors presented and analyzed different trust algorithms. Finally, their proposal was to measure the impact of trust in recommendation systems.
Jamel Dammak, Gerard Lopez and Hamza Si Kaddour
Let be a graph. The complement of is the graph where is the set of pairs of distinct elements of . If is a subset of , the restriction of to is the graph . We prove that if is a graph and is an integer, , then there is a -element subset of such that , moreover the condition is optimal. We also study the case where is a prime number. Following a question from M.Pouzet, we show this: Let be a graph with vertices. If (resp. ) then there is an increasing family (resp. ) of -element subsets of such that for all . Similarly if where is a prime number, , then there is an increasing family of -element subsets of such that for all integer .