scholarly journals A Location-Based Business Information Recommendation Algorithm

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Shudong Liu ◽  
Xiangwu Meng
Keyword(s):  
Collaborative Filtering ◽  
Large Scale ◽  
Empirical Studies ◽  
Real World Data ◽  
Network Ties ◽  
Long Distance ◽  
Recommendation Algorithm ◽  
Business Information ◽  
Information Recommendation ◽  
Social Network Ties

Recently, many researches on information (e.g., POI, ADs) recommendation based on location have been done in both research and industry. In this paper, we firstly construct a region-based location graph (RLG), in which region node respectively connects with user node and business information node, and then we propose a location-based recommendation algorithm based on RLG, which can combine with user short-ranged mobility formed by daily activity and long-distance mobility formed by social network ties and sequentially can recommend local business information and long-distance business information to users. Moreover, it can combine user-based collaborative filtering with item-based collaborative filtering, and it can alleviate cold start problem which traditional recommender systems often suffer from. Empirical studies from large-scale real-world data from Yelp demonstrate that our method outperforms other methods on the aspect of recommendation accuracy.

scholarly journals A music recommendation algorithm based on clustering and latent factor model

2020 ◽  
Vol 309 ◽  
pp. 03009
Author(s):  
Yingjie Jin ◽  
Chunyan Han
Keyword(s):  
Collaborative Filtering ◽  
Large Scale ◽  
User Preference ◽  
Implicit Feedback ◽  
Music Recommendation ◽  
Recommendation Algorithm ◽  
Latent Factor ◽  
Latent Factor Models ◽  
Feedback Data ◽  
Preference Matrix

The collaborative filtering recommendation algorithm is a technique for predicting items that a user may be interested in based on user history preferences. In the recommendation process of music data, it is often difficult to score music and the display score data for music is less, resulting in data sparseness. Meanwhile, implicit feedback data is more widely distributed than display score data, and relatively easy to collect, but implicit feedback data training efficiency is relatively low, usually lacking negative feedback. In order to effectively solve the above problems, we propose a music recommendation algorithm combining clustering and latent factor models. First, the user-music play record data is processed to generate a user-music matrix. The data is then analyzed using a latent factor probability model on the resulting matrix to obtain a user preference matrix U and a musical feature matrix V. On this basis, we use two K- means algorithms to perform user clustering and music clustering on two matrices. Finally, for the user preference matrix and the commodity feature matrix that complete the clustering, a user-based collaborative filtering algorithm is used for prediction. The experimental results show that the algorithm can reduce the running cost of large-scale data and improve the recommendation effect.

Going the Distance

2020 ◽  
Author(s):  
Ron Harris
Keyword(s):  
Large Scale ◽  
Western Europe ◽  
Family Firms ◽  
Global Trade ◽  
Long Distance ◽  
Business Corporation ◽  
Modern Economy ◽  
Key Factor ◽  
Silk Route ◽  
Passive Investors

Before the seventeenth century, trade across Eurasia was mostly conducted in short segments along the Silk Route and Indian Ocean. Business was organized in family firms, merchant networks, and state-owned enterprises, and dominated by Chinese, Indian, and Arabic traders. However, around 1600 the first two joint-stock corporations, the English and Dutch East India Companies, were established. This book tells the story of overland and maritime trade without Europeans, of European Cape Route trade without corporations, and of how new, large-scale, and impersonal organizations arose in Europe to control long-distance trade for more than three centuries. It shows that by 1700, the scene and methods for global trade had dramatically changed: Dutch and English merchants shepherded goods directly from China and India to northwestern Europe. To understand this transformation, the book compares the organizational forms used in four major regions: China, India, the Middle East, and Western Europe. The English and Dutch were the last to leap into Eurasian trade, and they innovated in order to compete. They raised capital from passive investors through impersonal stock markets and their joint-stock corporations deployed more capital, ships, and agents to deliver goods from their origins to consumers. The book explores the history behind a cornerstone of the modern economy, and how this organizational revolution contributed to the formation of global trade and the creation of the business corporation as a key factor in Europe's economic rise.

TrustSVD: A Novel Trust-Based Matrix Factorization Model with User Trust and Item Ratings

2017 ◽  
Vol 7 (11) ◽  
pp. 7 ◽  
Author(s):  
K Sobha Rani
Keyword(s):  
Matrix Factorization ◽  
Social Trust ◽  
State Of The Art ◽  
Data Sets ◽  
Real World Data ◽  
Recommendation Algorithm ◽  
Active User ◽  
Factorization Model ◽  
The Social ◽  
Matrix Factorization Technique

Collaborative filtering suffers from the problems of data sparsity and cold start, which dramatically degrade recommendation performance. To help resolve these issues, we propose TrustSVD, a trust-based matrix factorization technique. By analyzing the social trust data from four real-world data sets, we conclude that not only the explicit but also the implicit influence of both ratings and trust should be taken into consideration in a recommendation model. Hence, we build on top of a state-of-the-art recommendation algorithm SVD++ which inherently involves the explicit and implicit influence of rated items, by further incorporating both the explicit and implicit influence of trusted users on the prediction of items for an active user. To our knowledge, the work reported is the first to extend SVD++ with social trust information. Experimental results on the four data sets demonstrate that our approach TrustSVD achieves better accuracy than other ten counterparts, and can better handle the concerned issues.

Identifying Attack Models for Securing Cluster-Based Recommendation System

2020 ◽  
Vol 14 ◽  
Author(s):  
Amreen Ahmad ◽  
Tanvir Ahmad ◽  
Ishita Tripathi
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
Recommendation System ◽  
Relevant Information ◽  
System Function ◽  
Recommendation Algorithm ◽  
Underlying Network ◽  
Entire Dataset ◽  
Attack Models ◽  
Wide Usage

: The immense growth of information has led to the wide usage of recommender systems for retrieving relevant information. One of the widely used methods for recommendation is collaborative filtering. However, such methods suffer from two problems, scalability and sparsity. In the proposed research, the two issues of collaborative filtering are addressed and a cluster-based recommender system is proposed. For the identification of potential clusters from the underlying network, Shapley value concept is used, which divides users into different clusters. After that, the recommendation algorithm is performed in every respective cluster. The proposed system recommends an item to a specific user based on the ratings of the item’s different attributes. Thus, it reduces the running time of the overall algorithm, since it avoids the overhead of computation involved when the algorithm is executed over the entire dataset. Besides, the security of the recommender system is one of the major concerns nowadays. Attackers can come in the form of ordinary users and introduce bias in the system to force the system function that is advantageous for them. In this paper, we identify different attack models that could hamper the security of the proposed cluster-based recommender system. The efficiency of the proposed research is validated by conducting experiments on student dataset.

Bullying, School Violence, and Climate in Evolving Contexts

2018 ◽  
Author(s):  
Ron Avi Astor ◽  
Rami Benbenisthty
Keyword(s):  
School Violence ◽  
School Safety ◽  
Media Coverage ◽  
Large Scale ◽  
Ecological Model ◽  
Empirical Studies ◽  
Practical Applications ◽  
Teacher Student ◽  
Area Of Interest ◽  
New Research

Since 2005, the bullying, school violence, and school safety literatures have expanded dramatically in content, disciplines, and empirical studies. However, with this massive expansion of research, there is also a surprising lack of theoretical and empirical direction to guide efforts on how to advance our basic science and practical applications of this growing scientific area of interest. Parallel to this surge in interest, cultural norms, media coverage, and policies to address school safety and bullying have evolved at a remarkably quick pace over the past 13 years. For example, behaviors and populations that just a decade ago were not included in the school violence, bullying, and school safety discourse are now accepted areas of inquiry. These include, for instance, cyberbullying, sexting, social media shaming, teacher–student and student–teacher bullying, sexual harassment and assault, homicide, and suicide. Populations in schools not previously explored, such as lesbian, gay, bisexual, transgender, and queer students and educators and military- and veteran-connected students, become the foci of new research, policies, and programs. As a result, all US states and most industrialized countries now have a complex quilt of new school safety and bullying legislation and policies. Large-scale research and intervention funding programs are often linked to these policies. This book suggests an empirically driven unifying model that brings together these previously distinct literatures. This book presents an ecological model of school violence, bullying, and safety in evolving contexts that integrates all we have learned in the 13 years, and suggests ways to move forward.

Sign in / Sign up

Export Citation Format

Share Document