scholarly journals Evaluating Vector Representations from User's Reviews in a Recommendation Task

2019 ◽  
Author(s):  
Vitor Tonon ◽  
Tiago Silva ◽  
Vínicius Silva ◽  
Gean Pereira ◽  
Solange Rezende
Keyword(s):  
Recommendation Systems ◽  
Relevant Information ◽  
Unstructured Data ◽  
Recommendation Algorithm ◽  
Rating Data ◽  
User Reviews ◽  
The Past ◽  
Structured Information ◽  
Mining Methods ◽  
Vector Representations

The recommendation task is a prominent and challenging area of study in Machine Learning. It aims to recommend items such as products, movies, and services to users according to what they have liked in the past. In general, most of the recommendation systems only consider structured information. For instance, in recommending movies to users they might use features such as genre, actors, and directors. However, unstructured data such as users' reviews may also be considered, since they can aggregate important information to the recommendation process, improving the performance of recommendation systems. Thus, in this work, we evaluate the use of text mining methods to extract and represent relevant information about user reviews, which were used alongside with rating data, as input of a content-based recommendation algorithm. We considered three different strategies for this purpose, which were: Topics, Embeddings and Relevant Embeddings. We hypothesized that using the considered strategies, it is possible to create more meaningful and concise representations than the traditional bag-of-words model, and yet, increase the performance of recommendation systems. In our experimental evaluation, we confirmed such a hypothesis, showing that the considered representations strategies are indeed very promising for representing user reviews in the recommendation process.

Disaster Management during Pandemic: A Big Data-Centric Approach

2021 ◽  
pp. 2140003
Author(s):  
Mohamed Elsotouhy ◽  
Geetika Jain ◽  
Archana Shrivastava
Keyword(s):  
Big Data ◽  
Disaster Management ◽  
Crisis Response ◽  
Unstructured Data ◽  
Management Theory ◽  
Management Approach ◽  
Text Analytics ◽  
The Past ◽  
Structured Information ◽  
Data Files

The concept of big data (BD) has been coupled with disaster management to improve the crisis response during pandemic and epidemic. BD has transformed every aspect and approach of handling the unorganized set of data files and converting the same into a piece of more structured information. The constant inflow of unstructured data shows the research lacuna, especially during a pandemic. This study is an effort to develop a pandemic disaster management approach based on BD. BD text analytics potential is immense in effective pandemic disaster management via visualization, explanation, and data analysis. To seize the understanding of using BD toward disaster management, we have taken a comprehensive approach in place of fragmented view by using BD text analytics approach to comprehend the various relationships about disaster management theory. The study’s findings indicate that it is essential to understand all the pandemic disaster management performed in the past and improve the future crisis response using BD. Though worldwide, all the communities face big chaos and have little help reaching a potential solution.

scholarly journals Sentiment Digitization Modeling for Recommendation System

2020 ◽  
Vol 12 (12) ◽  
pp. 5191
Author(s):  
Tae-Yeun Kim ◽  
Sung Bum Pan ◽  
Sung-Hwan Kim
Keyword(s):  
Collaborative Filtering ◽  
Sentiment Analysis ◽  
Recommendation System ◽  
Recommendation Systems ◽  
Quantitative Information ◽  
Personalized Recommendation ◽  
Rating Data ◽  
User Reviews ◽  
Lower Accuracy ◽  
Types Of Information

As the importance of providing personalized services increases, various studies on personalized recommendation systems are actively being conducted. Among the many methods used for recommendation systems, the most widely used is collaborative filtering. However, this method has lower accuracy because recommendations are limited to using quantitative information, such as user ratings or amount of use. To address this issue, many studies have been conducted to improve the accuracy of the recommendation system by using other types of information, in addition to quantitative information. Although conducting sentiment analysis using reviews is popular, previous studies show the limitation that results of sentiment analysis cannot be directly reflected in recommendation systems. Therefore, this study aims to quantify the sentiments presented in the reviews and reflect the results to the ratings; that is, this study proposes a new algorithm that quantifies the sentiments of user-written reviews and converts them into quantitative information, which can be directly reflected in recommendation systems. To achieve this, the user reviews, which are qualitative information, must first be quantified. Thus, in this study, sentiment scores are calculated through sentiment analysis by using a text mining technique. The data used herein are from movie reviews. A domain-specific sentiment dictionary was constructed, and then based on the dictionary, sentiment scores of the reviews were calculated. The collaborative filtering of this study, which reflected the sentiment scores of user reviews, was verified to demonstrate its higher accuracy than the collaborative filtering using the traditional method, which reflects only user rating data. To overcome the limitations of the previous studies that examined the sentiments of users based only on user rating data, the method proposed in this study successfully enhanced the accuracy of the recommendation system by precisely reflecting user opinions through quantified user reviews. Based on the findings of this study, the recommendation system accuracy is expected to improve further if additional analysis can be performed.

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.

scholarly journals An Information Recommendation Technique Based on Influence and Activeness of Users in Social Networks

2021 ◽  
Vol 11 (6) ◽  
pp. 2530
Author(s):  
Minsoo Lee ◽  
Soyeon Oh
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Recommendation Systems ◽  
Network Services ◽  
The Past ◽  
User Behaviors ◽  
User Influence ◽  
User Activity ◽  
Information Recommendation ◽  
Social Network Services

Over the past few years, the number of users of social network services has been exponentially increasing and it is now a natural source of data that can be used by recommendation systems to provide important services to humans by analyzing applicable data and providing personalized information to users. In this paper, we propose an information recommendation technique that enables smart recommendations based on two specific types of analysis on user behaviors, such as the user influence and user activity. The components to measure the user influence and user activity are identified. The accuracy of the information recommendation is verified using Yelp data and shows significantly promising results that could create smarter information recommendation systems.

A Collaborative Filtering Recommendation Algorithm Incorporated with Life Cycle

2013 ◽  
Vol 765-767 ◽  
pp. 630-633 ◽  
Author(s):  
Chong Lin Zheng ◽  
Kuang Rong Hao ◽  
Yong Sheng Ding
Keyword(s):  
Life Cycle ◽  
Collaborative Filtering ◽  
Recommendation Systems ◽  
Experimental Results ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Time Information ◽  
Successful Technology

Collaborative filtering recommendation algorithm is the most successful technology for recommendation systems. However, traditional collaborative filtering recommendation algorithm does not consider the change of time information. For this problem,this paper improve the algorithm with two new methods:Predict score incorporated with time information in order to reflect the user interest change; Recommend according to scores by adding the weight information determined by the item life cycle. Experimental results show that the proposed algorithm outperforms the traditional item in accuracy.

scholarly journals Collaborative Filtering Recommendation Algorithm Based on TF-IDF and User Characteristics

2021 ◽  
Vol 11 (20) ◽  
pp. 9554
Author(s):  
Jianjun Ni ◽  
Yu Cai ◽  
Guangyi Tang ◽  
Yingjuan Xie
Keyword(s):  
Collaborative Filtering ◽  
User Characteristics ◽  
Recommendation Algorithm ◽  
Data Set ◽  
Rating Data ◽  
User Similarity ◽  
Public Data ◽  
Weighted Algorithm ◽  
Collaborative Filtering Algorithm ◽  
The Impact

The recommendation algorithm is a very important and challenging issue for a personal recommender system. The collaborative filtering recommendation algorithm is one of the most popular and effective recommendation algorithms. However, the traditional collaborative filtering recommendation algorithm does not fully consider the impact of popular items and user characteristics on the recommendation results. To solve these problems, an improved collaborative filtering algorithm is proposed, which is based on the Term Frequency-Inverse Document Frequency (TF-IDF) method and user characteristics. In the proposed algorithm, an improved TF-IDF method is used to calculate the user similarity on the basis of rating data first. Secondly, the multi-dimensional characteristics information of users is used to calculate the user similarity by a fuzzy membership method. Then, the above two user similarities are fused based on an adaptive weighted algorithm. Finally, some experiments are conducted on the movie public data set, and the experimental results show that the proposed method has better performance than that of the state of the art.

scholarly journals Extraction of Meaningful Information from the Web: a Brief Survey

2018 ◽  
Vol 7 (4.19) ◽  
pp. 1041
Author(s):  
Santosh V. Chobe ◽  
Dr. Shirish S. Sane
Keyword(s):  
Information Extraction ◽  
Relevant Information ◽  
Unstructured Data ◽  
Web Pages ◽  
Extraction Techniques ◽  
Web Documents ◽  
Meaningful Information ◽  
The Web

There is an explosive growth of information on Internet that makes extraction of relevant data from various sources, a difficult task for its users. Therefore, to transform the Web pages into databases, Information Extraction (IE) systems are needed. Relevant information in Web documents can be extracted using information extraction and presented in a structured format.By applying information extraction techniques, information can be extracted from structured, semi-structured, and unstructured data. This paper presents some of the major information extraction tools. Here, advantages and limitations of the tools are discussed from a user’s perspective.  

scholarly journals Poincaré-Type Inequalities for Compact Degenerate Pure Jump Markov Processes

Mathematics ◽  
2019 ◽  
Vol 7 (6) ◽  
pp. 518 ◽  
Author(s):  
Pierre Hodara ◽  
Ioannis Papageorgiou
Keyword(s):  
Membrane Potential ◽  
Point Process ◽  
Markov Processes ◽  
Relevant Information ◽  
Neural System ◽  
Brain Neurons ◽  
Actual Position ◽  
The Past ◽  
Poincaré Type Inequalities ◽  
Jump Markov Processes

We aim to prove Poincaré inequalities for a class of pure jump Markov processes inspired by the model introduced by Galves and Löcherbach to describe the behavior of interacting brain neurons. In particular, we consider neurons with degenerate jumps, i.e., which lose their memory when they spike, while the probability of a spike depends on the actual position and thus the past of the whole neural system. The process studied by Galves and Löcherbach is a point process counting the spike events of the system and is therefore non-Markovian. In this work, we consider a process describing the membrane potential of each neuron that contains the relevant information of the past. This allows us to work in a Markovian framework.

Robust Analysis on a Privacy Preserving Recommendation Algorithm under the KNN Attack

2014 ◽  
Vol 610 ◽  
pp. 717-721 ◽  
Author(s):  
Yan Gao ◽  
Jing Bo Xia ◽  
Jing Jing Ji ◽  
Ling Ma
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Privacy Preserving ◽  
Perturbation Techniques ◽  
Recommendation Algorithm ◽  
Rating Data ◽  
Robust Analysis ◽  
History Of

— Among algorithms in recommendation system, Collaborative Filtering (CF) is a popular one. However, the CF methods can’t guarantee the safety of the user rating data which cause private preserving issue. In general, there are four kinds of methods to solve private preserving: Perturbation, randomization, swapping and encryption. In this paper, we mimic algorithms which attack the privacy-preserving methods with randomized perturbation techniques. After leaking part of rating history of a customer, we can infer this customer’s other rating history. At the end, we propose an algorithm to enhance the system so as to avoid being attacked.

Research on a Theatre Recommendation System

2014 ◽  
Vol 989-994 ◽  
pp. 4775-4779
Author(s):  
Yu Long Li ◽  
Ying Li ◽  
Wei Jiang ◽  
Zhi Zhou
Keyword(s):  
Bipartite Graph ◽  
Recommendation System ◽  
Recommendation Systems ◽  
Recommendation Algorithm ◽  
Graph Data ◽  
Data Standardization ◽  
Similarity Calculation

Nowadays the recommendation system has been widely used, especially in the field of e-commerce, SNS, music, etc. On the basis of recommendation systems which are widely used, the paper puts forward a theatre recommendation algorithm which is more suitable in the field of theatre. In order to achieve the recommendation of theatre, the paper uses a series of steps, including weight, bipartite graph, data standardization, similarity calculation. After using this algorithm, some theatres will be recommended according to recommendation level. The results of recommendation are more reasonable, effective and satisfied.

Sign in / Sign up

Export Citation Format

Share Document