Probabilistic Models For Recommendation In Social Networks
Download Probabilistic Models For Recommendation In Social Networks full books in PDF, epub, and Kindle. Read online free Probabilistic Models For Recommendation In Social Networks ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
| Author | : SeyedMohsen Jamali |
| Publisher | : |
| Total Pages | : 324 |
| Release | : 2013 |
| Genre | : Online social networks |
| ISBN | : |
Recommender systems are becoming tools of choice to select the online information relevant to a given user. Collaborative filtering is the most popular approach to building recommender systems and has been successfully employed in many applications. However, collaborative filtering based approaches perform poorly for so-called cold start users. With the advent of online social networks, the social network based approach to recommendation has emerged. This approach assumes a social network among users and makes recommendations for a user based on the ratings of the users that have direct or indirect social relations with the given user. As one of their major benefits, social network based approaches have been shown to reduce the problems with cold start users. In this research we propose novel methods to address the recommendation problem in online social networks. To better understand the underlying mechanisms of user behavior in a social network, we first propose a model to capture the temporal dynamics of user behavior based on different effects influencing the behavior of users in rating items and creating social relations (e.g. social influence, social selection and transitivity of relations). Then we propose a memory based approach based on random walk models to perform recommendation in social networks. Matrix factorization is the most prominent model based approach for collaborative recommendation. We extend matrix factorization and propose a model that takes into account the social network as well as the rating matrix. Finally, we present a mixed membership community based model for recommendation in social networks based on stochastic block models. This model is capable of performing both rating and link prediction. All methods have been experimentally evaluated and compared against state-of-the-art methods on real life data sets from Epinions.com, Flixster.com and Flickr.com. The Flixster data set has been crawled and published as part of the research during this thesis. Experimental results show that our proposed models achieve substantial quality gains compared to the existing methods.
| Author | : Nicola Barbieri |
| Publisher | : Springer Nature |
| Total Pages | : 181 |
| Release | : 2022-05-31 |
| Genre | : Computers |
| ISBN | : 3031019067 |
The importance of accurate recommender systems has been widely recognized by academia and industry, and recommendation is rapidly becoming one of the most successful applications of data mining and machine learning. Understanding and predicting the choices and preferences of users is a challenging task: real-world scenarios involve users behaving in complex situations, where prior beliefs, specific tendencies, and reciprocal influences jointly contribute to determining the preferences of users toward huge amounts of information, services, and products. Probabilistic modeling represents a robust formal mathematical framework to model these assumptions and study their effects in the recommendation process. This book starts with a brief summary of the recommendation problem and its challenges and a review of some widely used techniques Next, we introduce and discuss probabilistic approaches for modeling preference data. We focus our attention on methods based on latent factors, such as mixture models, probabilistic matrix factorization, and topic models, for explicit and implicit preference data. These methods represent a significant advance in the research and technology of recommendation. The resulting models allow us to identify complex patterns in preference data, which can be exploited to predict future purchases effectively. The extreme sparsity of preference data poses serious challenges to the modeling of user preferences, especially in the cases where few observations are available. Bayesian inference techniques elegantly address the need for regularization, and their integration with latent factor modeling helps to boost the performances of the basic techniques. We summarize the strengths and weakness of several approaches by considering two different but related evaluation perspectives, namely, rating prediction and recommendation accuracy. Furthermore, we describe how probabilistic methods based on latent factors enable the exploitation of preference patterns in novel applications beyond rating prediction or recommendation accuracy. We finally discuss the application of probabilistic techniques in two additional scenarios, characterized by the availability of side information besides preference data. In summary, the book categorizes the myriad probabilistic approaches to recommendations and provides guidelines for their adoption in real-world situations.
| Author | : Arta Shayandeh |
| Publisher | : |
| Total Pages | : 40 |
| Release | : 2012 |
| Genre | : Online social networks |
| ISBN | : |
Online social networks such as Twitter, LinkedIn, and Facebook generate tremendous amount of text and social interaction data. On one hand, the increasing amount of available information has motivated computational research in social network analysis to understand social structures. On the other hand, annotating, retrieving, and analyzing textual information generated within the social network is also crucial for many applications such as content ranking, recommendation systems, spam detection, and viral marketing. In this thesis we propose a composite probabilistic topic model for social networks which automatically learns topic (of interest) distributions for each entity in the social network using a combination of the available content (text) in social network and the structural properties of the network. The utility of our proposed modeling is to reduce the dimensionality of the data, exploit the underlying social structure and linkage property of the network while generating a more accurate topic model for the end-users of the social network. We discuss in detail the results on both the NIPS data set (papers from the Neural Information Processing Conference) and Enron Email (emails from large corporation) corpus. We present perplexity score for test documents as a basis of our experiments to evaluate the generalization performance of our model and provide evidence that relevant topics are discovered.
| Author | : Nasrullah Memon |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 217 |
| Release | : 2010-06-10 |
| Genre | : Business & Economics |
| ISBN | : 1441962875 |
Driven by counter-terrorism efforts, marketing analysis and an explosion in online social networking in recent years, data mining has moved to the forefront of information science. This proposed Special Issue on Data Mining for Social Network Data will present a broad range of recent studies in social networking analysis. It will focus on emerging trends and needs in discovery and analysis of communities, solitary and social activities, activities in open for a and commercial sites as well. It will also look at network modeling, infrastructure construction, dynamic growth and evolution pattern discovery using machine learning approaches and multi-agent based simulations. Editors are three rising stars in world of data mining, knowledge discovery, social network analysis, and information infrastructures, and are anchored by Springer author/editor Hsinchun Chen (Terrorism Informatics; Medical Informatics; Digital Government), who is one of the most prominent intelligence analysis and data mining experts in the world.
| Author | : Daniel Schall |
| Publisher | : Springer |
| Total Pages | : 139 |
| Release | : 2015-09-23 |
| Genre | : Computers |
| ISBN | : 3319227351 |
This book introduces novel techniques and algorithms necessary to support the formation of social networks. Concepts such as link prediction, graph patterns, recommendation systems based on user reputation, strategic partner selection, collaborative systems and network formation based on ‘social brokers’ are presented. Chapters cover a wide range of models and algorithms, including graph models and a personalized PageRank model. Extensive experiments and scenarios using real world datasets from GitHub, Facebook, Twitter, Google Plus and the European Union ICT research collaborations serve to enhance reader understanding of the material with clear applications. Each chapter concludes with an analysis and detailed summary. Social Network-Based Recommender Systems is designed as a reference for professionals and researchers working in social network analysis and companies working on recommender systems. Advanced-level students studying computer science, statistics or mathematics will also find this books useful as a secondary text.
| Author | : Pablo Moscato |
| Publisher | : Springer |
| Total Pages | : 1005 |
| Release | : 2019-05-30 |
| Genre | : Computers |
| ISBN | : 3030062228 |
This two-volume handbook presents a collection of novel methodologies with applications and illustrative examples in the areas of data-driven computational social sciences. Throughout this handbook, the focus is kept specifically on business and consumer-oriented applications with interesting sections ranging from clustering and network analysis, meta-analytics, memetic algorithms, machine learning, recommender systems methodologies, parallel pattern mining and data mining to specific applications in market segmentation, travel, fashion or entertainment analytics. A must-read for anyone in data-analytics, marketing, behavior modelling and computational social science, interested in the latest applications of new computer science methodologies. The chapters are contributed by leading experts in the associated fields.The chapters cover technical aspects at different levels, some of which are introductory and could be used for teaching. Some chapters aim at building a common understanding of the methodologies and recent application areas including the introduction of new theoretical results in the complexity of core problems. Business and marketing professionals may use the book to familiarize themselves with some important foundations of data science. The work is a good starting point to establish an open dialogue of communication between professionals and researchers from different fields. Together, the two volumes present a number of different new directions in Business and Customer Analytics with an emphasis in personalization of services, the development of new mathematical models and new algorithms, heuristics and metaheuristics applied to the challenging problems in the field. Sections of the book have introductory material to more specific and advanced themes in some of the chapters, allowing the volumes to be used as an advanced textbook. Clustering, Proximity Graphs, Pattern Mining, Frequent Itemset Mining, Feature Engineering, Network and Community Detection, Network-based Recommending Systems and Visualization, are some of the topics in the first volume. Techniques on Memetic Algorithms and their applications to Business Analytics and Data Science are surveyed in the second volume; applications in Team Orienteering, Competitive Facility-location, and Visualization of Products and Consumers are also discussed. The second volume also includes an introduction to Meta-Analytics, and to the application areas of Fashion and Travel Analytics. Overall, the two-volume set helps to describe some fundamentals, acts as a bridge between different disciplines, and presents important results in a rapidly moving field combining powerful optimization techniques allied to new mathematical models critical for personalization of services. Academics and professionals working in the area of business anyalytics, data science, operations research and marketing will find this handbook valuable as a reference. Students studying these fields will find this handbook useful and helpful as a secondary textbook.
| Author | : Kun Yue |
| Publisher | : World Scientific |
| Total Pages | : 290 |
| Release | : 2020-02-24 |
| Genre | : Computers |
| ISBN | : 9811207399 |
This unique compendium focuses on the acquisition and analysis of social media data. The approaches concern both the data-intensive characteristics and graphical structures of social media. The book addresses the critical problems in social media analysis, which representatively cover its lifecycle.The must-have volume is an excellent reference text for professionals, researchers, academics and graduate students in AI and databases.
| Author | : Charu C. Aggarwal |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 508 |
| Release | : 2011-03-18 |
| Genre | : Computers |
| ISBN | : 1441984623 |
Social network analysis applications have experienced tremendous advances within the last few years due in part to increasing trends towards users interacting with each other on the internet. Social networks are organized as graphs, and the data on social networks takes on the form of massive streams, which are mined for a variety of purposes. Social Network Data Analytics covers an important niche in the social network analytics field. This edited volume, contributed by prominent researchers in this field, presents a wide selection of topics on social network data mining such as Structural Properties of Social Networks, Algorithms for Structural Discovery of Social Networks and Content Analysis in Social Networks. This book is also unique in focussing on the data analytical aspects of social networks in the internet scenario, rather than the traditional sociology-driven emphasis prevalent in the existing books, which do not focus on the unique data-intensive characteristics of online social networks. Emphasis is placed on simplifying the content so that students and practitioners benefit from this book. This book targets advanced level students and researchers concentrating on computer science as a secondary text or reference book. Data mining, database, information security, electronic commerce and machine learning professionals will find this book a valuable asset, as well as primary associations such as ACM, IEEE and Management Science.
| Author | : Shenglin Zhao |
| Publisher | : Springer |
| Total Pages | : 110 |
| Release | : 2018-07-13 |
| Genre | : Computers |
| ISBN | : 9811313490 |
This book systematically introduces Point-of-interest (POI) recommendations in Location-based Social Networks (LBSNs). Starting with a review of the advances in this area, the book then analyzes user mobility in LBSNs from geographical and temporal perspectives. Further, it demonstrates how to build a state-of-the-art POI recommendation system by incorporating the user behavior analysis. Lastly, the book discusses future research directions in this area. This book is intended for professionals involved in POI recommendation and graduate students working on problems related to location-based services. It is assumed that readers have a basic knowledge of mathematics, as well as some background in recommendation systems.
| Author | : Özgür Ulusoy |
| Publisher | : Springer |
| Total Pages | : 294 |
| Release | : 2015-02-12 |
| Genre | : Computers |
| ISBN | : 3319143794 |
This edited volume offers a clear in-depth overview of research covering a variety of issues in social search and recommendation systems. Within the broader context of social network analysis it focuses on important and up-coming topics such as real-time event data collection, frequent-sharing pattern mining, improvement of computer-mediated communication, social tagging information, search system personalization, new detection mechanisms for the identification of online user groups, and many more. The twelve contributed chapters are extended versions of conference papers as well as completely new invited chapters in the field of social search and recommendation systems. This first-of-its kind survey of current methods will be of interest to researchers from both academia and industry working in the field of social networks.
