A model of a trust-based recommendation system on a social network

In this paper, we present a model of a trust-based recommendation system on a social network. The idea of the model is that agents use their social network to reach information and their trust relationships to filter it. We investigate how the dynamics of trust among agents affect the performance of the system by comparing it to a frequency-based recommendation system. Furthermore, we identify the impact of network density, preference heterogeneity among agents, and knowledge sparseness to be crucial factors for the performance of the system. The system self-organises in a state with performance near to the optimum; the performance on the global level is an emergent property of the system, achieved without explicit coordination from the local interactions of agent

A Dynamic Trust Relations-Based Friend Recommendation Algorithm in Social Network Systems

A discovered algorithm based on the dynamic trust relations of users in a social network system (SNS) was proposed aiming at getting useful information more efficiently in an SNS. The proposed dynamic model combined the interests and trust relations of users to explore their good friends for recommendations. First, the network based on the interests and trust relations of users was set up. Second, the temporal factor was added to the model, then a dynamic model of the degree of the interest and trust relations of the users was calculated. Lastly, the similarities among the users were measured via this dynamic model, and the recommendation list of good friends was achieved. Results showed that the proposed algorithm effectively described the changes in the interest similarities and trust relations of users with time, and the recommended result was more accurate and effective than the traditional ones

A Synthetical Approach for Blog Recommendation Mechanism: Trust, Social Relation, and Semantic Analysis

Weblog is a good paradigm of online social network which constitutes web-based regularly updated journals with reverse chronological sequences of dated entries, usually with blogrolls on the sidebars, allowing bloggers link to favorite site which they are frequently visited. In this study we propose an elaborate blog recommendation mechanism that combines trust model, social relation and semantic analysis and illustrate how it can be applied to a prestigious online blogging system – Wretch in Taiwan. By preliminary results of experimental study, we found some implications and empirically prove some theories in domain of social networking, and the example reveals that the proposed recommendation mechanism is quite feasible and promising

CFMT: a collaborative filtering approach based on the nonnegative matrix factorization technique and trust relationships

peer reviewedAs a method of information filtering, the Recommender System (RS) has gained considerable popularity because of its efficiency and provision of the most superior numbers of useful items. A recommender system is a proposed solution to the information overload problem in social media and algorithms. Collaborative Filtering (CF) is a practical approach to the recommendation; however, it is characterized by cold start and data sparsity, the most severe barriers against providing accurate recommendations. Rating matrices are finely represented by Nonnegative Matrix Factorization (NMF) models, fundamental models in CF-based RSs. However, most NMF methods do not provide reasonable accuracy due to the dispersion of the rating matrix. As a result of the sparsity of data and problems concerning the cold start, information on the trust network among users is further utilized to elevate RS performance. Therefore, this study suggests a novel trust-based matrix factorization technique referred to as CFMT, which uses the social network data in the recommendation process by modeling user’s roles as trustees and trusters, given the trust network’s structural information. The proposed method seeks to lower the sparsity of the data and the cold start problem by integrating information sources including ratings and trust statements into the recommendation model, an attempt by which significant superiority over state-of-the-art approaches is demonstrated an empirical examination of real-world datasets

Collaborative filtering and deep learning based recommendation system for cold start items

Recommender system is a specific type of intelligent systems, which exploits historical user ratings on items and/or auxiliary information to make recommendations on items to the users. It plays a critical role in a wide range of online shopping, e-commercial services and social networking applications. Collaborative filtering (CF) is the most popular approaches used for recommender systems, but it suffers from complete cold start (CCS) problem where no rating record are available and incomplete cold start (ICS) problem where only a small number of rating records are available for some new items or users in the system. In this paper, we propose two recommendation models to solve the CCS and ICS problems for new items, which are based on a framework of tightly coupled CF approach and deep learning neural network. A specific deep neural network SADE is used to extract the content features of the items. The state of the art CF model, timeSVD++, which models and utilizes temporal dynamics of user preferences and item features, is modified to take the content features into prediction of ratings for cold start items. Extensive experiments on a large Netflix rating dataset of movies are performed, which show that our proposed recommendation models largely outperform the baseline models for rating prediction of cold start items. The two proposed recommendation models are also evaluated and compared on ICS items, and a flexible scheme of model retraining and switching is proposed to deal with the transition of items from cold start to non-cold start status. The experiment results on Netflix movie recommendation show the tight coupling of CF approach and deep learning neural network is feasible and very effective for cold start item recommendation. The design is general and can be applied to many other recommender systems for online shopping and social networking applications. The solution of cold start item problem can largely improve user experience and trust of recommender systems, and effectively promote cold start items

A Collaborative Location Based Travel Recommendation System through Enhanced Rating Prediction for the Group of Users

Rapid growth of web and its applications has created a colossal importance for recommender systems. Being applied in various domains, recommender systems were designed to generate suggestions such as items or services based on user interests. Basically, recommender systems experience many issues which reflects dwindled effectiveness. Integrating powerful data management techniques to recommender systems can address such issues and the recommendations quality can be increased significantly. Recent research on recommender systems reveals an idea of utilizing social network data to enhance traditional recommender system with better prediction and improved accuracy. This paper expresses views on social network data based recommender systems by considering usage of various recommendation algorithms, functionalities of systems, different types of interfaces, filtering techniques, and artificial intelligence techniques. After examining the depths of objectives, methodologies, and data sources of the existing models, the paper helps anyone interested in the development of travel recommendation systems and facilitates future research direction. We have also proposed a location recommendation system based on social pertinent trust walker (SPTW) and compared the results with the existing baseline random walk models. Later, we have enhanced the SPTW model for group of users recommendations. The results obtained from the experiments have been presented

Improving accuracy of recommender systems through triadic closure

The exponential growth of social media services led to the information overload problem which information filtering and recommender systems deal by exploiting various techniques. One popular technique for making recommendations is based on trust statements between users in a social network. Yet explicit trust statements are usually very sparse leading to the need for expanding the trust networks by inferring new trust relationships. Existing methods exploit the propagation property of trust to expand the existing trust networks; however, their performance is strongly affected by the density of the trust network. Nevertheless, the utilisation of existing trust networks can model the users’ relationships, enabling the inference of new connections. The current study advances the existing methods and techniques on developing a trust-based recommender system proposing a novel method to infer trust relationships and to achieve a fully-expanded trust network. In other words, the current study proposes a novel, effective and efficient approach to deal with the information overload by expanding existing trust networks so as to increase accuracy in recommendation systems. More specifically, this study proposes a novel method to infer trust relationships, called TriadicClosure. The method is based on the homophily phenomenon of social networks and, more specifically, on the triadic closure mechanism, which is a fundamental mechanism of link formation in social networks via which communities emerge naturally, especially when the network is very sparse. Additionally, a method called JaccardCoefficient is proposed to calculate the trust weight of the inferred relationships based on the Jaccard Cofficient similarity measure. Both the proposed methods exploit structural information of the trust graph to infer and calculate the trust value. Experimental results on real-world datasets demonstrate that the TriadicClosure method outperforms the existing state-of-the-art methods by substantially improving prediction accuracy and coverage of recommendations. Moreover, the method improves the performance of the examined state-of-the-art methods in terms of accuracy and coverage when combined with them. On the other hand, the JaccardCoefficient method for calculating the weight of the inferred trust relationships did not produce stable results, with the majority showing negative impact on the performance, for both accuracy and coverage

Research opportunities for argumentation in social networks

Nowadays, many websites allow social networking between their users in an explicit or implicit way. In this work, we show how argumentation schemes theory can provide a valuable help to formalize and structure on-line discussions and user opinions in decision support and business oriented websites that held social networks between their users. Two real case studies are studied and analysed. Then, guidelines to enhance social decision support and recommendations with argumentation are provided.This work summarises results of the authors joint research, funded by an STMS of the Agreement Technologies COST Action 0801, by the Spanish government grants [CONSOLIDER-INGENIO 2010 CSD2007-00022, and TIN2012-36586-C03-01] and by the GVA project [PROMETEO 2008/051].Heras Barberá, SM.; Atkinson, KM.; Botti Navarro, VJ.; Grasso, F.; Julian Inglada, VJ.; Mcburney, PJ. (2013). Research opportunities for argumentation in social networks. Artificial Intelligence Review. 39(1):39-62. doi:10.1007/s10462-012-9389-0S3962391Amgoud L (2009) Argumentation for decision making. Argumentation in artificial intelligence. Springer, BerlinAnderson P (2007) What is Web 2.0? Ideas, technologies and implications for education. JISC Iechnology and Standards Watch reportBentahar J, Meyer CJJ, Moulin B (2007) Securing agent-oriented systems: an argumentation and reputation-based approach. In: Proceedings of the 4th international conference on information technology: new generations (ITNG 2007), IEEE Computer Society, pp 507–515Buckingham Shum S (2008) Cohere: towards Web 2.0 argumentation. In: Proceedings of the 2nd international conference on computational models of argument, COMMA, pp 28–30Burke R (2002) Hybrid recommender systems: survey and experiments. User Model User-Adapt Interact 12:331–370Cartwright D, Atkinson K (2008) Political engagement through tools for argumentation. In: Proceedings of the second international conference on computational models of argument (COMMA 2008), pp 116–127Chesñevar C, McGinnis J, Modgil S, Rahwan I, Reed C, Simari G, South M, Vreeswijk G, Willmott S (2006) Towards an argument interchange format. Knowl Eng Rev 21(4):293–316Chesñevar CI, Maguitman AG, Gonzàlez MP (2009) Empowering recommendation technologies through argumentation. Argumentation in artificial intelligence. Springer, Berlin, pp 403–422García AJ, Dix J, Simari GR (2009) Argument-based logic programming. Argumentation in artificial intelligence. Springer, BerlinGolbeck J (2006) Generating predictive movie recommendations from trust in social networks. In: Proceedings of the fourth international conference on trust management, LNCS, vol 3986, 93–104Gordon T, Prakken H, Walton D (2007) The Carneades model of argument and burden of proof. Artif Intell 171(10–15):875–896Guha R, Kumar R, Raghavan P, Tomkins A (2004) Propagating trust and distrust. In: Proceedings of the 13th international conference on, World Wide Web, pp 403–412Heras S, Navarro M, Botti V, Julián V (2009) Applying dialogue games to manage recommendation in social networks. In: Proceedings of the 6th international workshop on argumentation in multi-agent aystems, ArgMASHeras S, Atkinson K, Botti V, Grasso F, Julián V, McBurney P (2010a) How argumentation can enhance dialogues in social networks. In: Proceedings of the 3rd international conference on computational models of argument, COMMA, vol 216, pp 267–274Heras S, Atkinson K, Botti V, Grasso F, Julián V, McBurney P (2010b) Applying argumentation to enhance dialogues in social networks. In: ECAI 2010 workshop on computational models of natural argument, CMNA, pp 10–17Karacapilidis N, Tzagarakis M (2007) Web-based collaboration and decision making support: a multi-disciplinary approach. Web-Based Learn Teach Technol 2(4):12–23Kim D, Benbasat I (2003) Trust-related arguments in internet stores: a framework for evaluation. J Electron Commer Res 4(2):49–64Kim D, Benbasat I (2006) The effects of trust-assuring arguments on consumer trust in internet stores: application of Toulmin’s model of argumentation. Inf Syst Rese 17(3):286–300Laera L, Tamma V, Euzenat J, Bench-Capon T, Payne T (2006) Reaching agreement over ontology alignments. In: Proceedings of the 5th international semantic web conference (ISWC 2006)Lange C, Bojãrs U, Groza T, Breslin J, Handschuh S (2008) Expressing argumentative discussions in social media sites. In: Social data on the web (SDoW2008) workshop at the 7th international semantic web conferenceLinden G, Smith B, York J (2003) Amazon.com recommendations: item-to-item collaborative filtering. IEEE Internet Comput 7(1):76–80Linden G, Hong J, Stonebraker M, Guzdial M (2009) Recommendation algorithms, online privacy and more. Commun ACM, 52(5)Mika P (2007) Ontologies are us: a unified model of social networks and semantics. J Web Semant 5(1):5–15Montaner M, López B, de la Rosa JL (2002) Opinion-based filtering through trust. In: Cooperative information agents VI, LNCS, vol 2446, pp 127–144Ontañón S, Plaza E (2008) Argumentation-based information exchange in prediction markets. In: Proceedings of the 5th international workshop on argumentation in multi-agent systems, ArgMASPazzani MJ, Billsus D (2007) Content-based recommendation systems. In: The adaptive web, LNCS, vol 4321, pp 325–341Rahwan I, Zablith F, Reed C (2007) Laying the foundations for a world wide argument web. Artif Intell 171(10–15):897–921Rahwan I, Banihashemi B (2008) Arguments in OWL: a progress report. In: Proceedings of the 2nd international conference on computational models of argument (COMMA), pp 297–310Reed C, Walton D (2007) Argumentation schemes in dialogue. In: Dissensus and the search for common ground, OSSA-07, volume CD-ROM, pp 1–11Sabater J, Sierra C (2002) Reputation and social network analysis in multi-agent systems. In: Proceedings of the 1st international joint conference on autonomous agents and multiagent systems, vol 1, pp 475–482Schafer JB, Konstan JA, Riedl J (2001) E-commerce recommendation applications. Data Min Knowl Discov 5:115–153Schafer JB, Frankowski D, Herlocker J, Sen S (2007) Collaborative filtering recommender systems. In: The adaptive web, LNCS, vol 4321, pp 291–324Schneider J, Groza T, Passant A (2012) A review of argumentation for the aocial semantic web. Semantic web-interoperability, usability, applicability. IOS Press, Washington, DCTempich C, Pinto HS, Sure Y, Staab S (2005) An argumentation ontology for distributed, loosely-controlled and evolvInG Engineering processes of oNTologies (DILIGENT). In: Proceedings of the 2nd European semantic web conference, ESWC, pp 241–256Toulmin SE (1958) The uses of argument. Cambridge University Press, Cambridge, UKTrojahn C, Quaresma P, Vieira R, Isaac A (2009) Comparing argumentation frameworks for composite ontology matching. in: Proceedings of the 6th international workshop on argumentation in multi-agent systems, ArgMASTruthMapping. http://truthmapping.com/Walter FE, Battiston S, Schweitzer F (2007) A model of a trust-based recommendation system on a social network. J Auton Agents Multi-Agent Syst 16(1):57–74Walton D, Krabbe E (1995) Commitment in dialogue: basic concepts of interpersonal reasoning. State University of New York Press, New York, NYWalton D, Reed C, Macagno F (2008) Argumentation schemes. Cambridge University Press, CambridgeWells S, Gourlay C, Reed C (2009) Argument blogging. Computational models of natural argument, CMNAWyner A, Schneider J (2012) Arguing from a point of view. In: Proceedings of the first international conference on agreement technologie