scholarly journals An Effective e-Commerce Recommender System Based on Trust and Semantic Information

2021 ◽  
Vol 21 (1) ◽  
pp. 103-118
Author(s):  
Qusai Y. Shambour ◽  
Nidal M. Turab ◽  
Omar Y. Adwan
Keyword(s):  
Electronic Commerce ◽  
Recommender Systems ◽  
Recommender System ◽  
Semantic Information ◽  
Significant Rise ◽  
Experimental Results ◽  
Semantic Relations ◽  
The Internet ◽  
Rating Data ◽  
Recommendation Accuracy

Abstract Electronic commerce has been growing gradually over the last decade as a new driver of the retail industry. In fact, the growth of e-Commerce has caused a significant rise in the number of choices of products and services offered on the Internet. This is where recommender systems come into play by providing meaningful recommendations to consumers based on their needs and interests effectively. However, recommender systems are still vulnerable to the scenarios of sparse rating data and cold start users and items. To develop an effective e-Commerce recommender system that addresses these limitations, we propose a Trust-Semantic enhanced Multi-Criteria CF (TSeMCCF) approach that exploits the trust relations and multi-criteria ratings of users, and the semantic relations of items within the CF framework to achieve effective results when sufficient rating data are not available. The experimental results have shown that the proposed approach outperforms other benchmark recommendation approaches with regard to recommendation accuracy and coverage.

A Recommendation Model for Energy-Efficient Data Mining Services Based on Data Properties

2021 ◽  
Author(s):  
Zainab Al-Zanbouri
Keyword(s):  
Data Mining ◽  
Energy Consumption ◽  
Web Services ◽  
Recommender System ◽  
Energy Efficient ◽  
Contextual Information ◽  
Three Dimensions ◽  
Context Aware ◽  
Rating Data ◽  
Recommendation Accuracy

Currently, there is a big increase in the usage of data analytics applications and services because of the growth in the data produced from different sources. The QoS properties such as response time and latency of these services are important factors to decide which services to select. As a result of IT expansion, energy consumption has become a big issue. Therefore, establishing a QoS-based web service recommender system that considers energy consumption as one of the essential QoS properties represents a significant step towards selecting the energy efficient web services. This dissertation presents an experimental study on energy consumption levels and latency behavior collected from a set of data mining web services running on different datasets. Our study shows that there is a strong relation between the dataset properties and the QoS properties. Based on the findings from this study, a recommender system is built which considers three dimensions (user, service, dataset). The energy consumption values of candidate services invoked by specific users can be predicted for a given dataset. Afterwards, these services can be ranked according to their predicted energy values and presented to users. We propose three approaches to build our recommender system and we treat it as a context-aware recommendation problem. The dataset is considered as contextual information and we use a context-aware matrix factorization model to predict energy values. In the first approach, we adopt the pre-filtering model where the contextual information serves as a query for filtering relevant rating data. In the second approach, we propose a new method for the pre-filtering implementation. Finally, in the last approach, we adopt the contextual modeling method and we explore different ways of representing dataset information as contextual factors to investigate their impacts on the recommendation accuracy. We compare the proposed approaches with the baseline approaches and the results show the effectiveness of the proposed ones. Also, we compare the performance of the three approaches to discover the best-fit approach when being measured using different metrics. Both prediction and recommendation accuracy of the proposed approaches are significantly better than the baseline models.

scholarly journals Keywords-Driven and Popularity-Aware Paper Recommendation Based on Undirected Paper Citation Graph

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-15 ◽  
Author(s):  
Hanwen Liu ◽  
Huaizhen Kou ◽  
Chao Yan ◽  
Lianyong Qi
Keyword(s):  
Recommender Systems ◽  
Recommender System ◽  
Large Scale ◽  
Real Life ◽  
Research Field ◽  
Experimental Results ◽  
The Real ◽  
Matching Technique ◽  
Paper Citation ◽  
Citation Graph

Nowadays, scholar recommender systems often recommend academic papers based on users’ personalized retrieval demands. Typically, a recommender system analyzes the keywords typed by a user and then returns his or her preferred papers, in an efficient and economic manner. In practice, one paper often contains partial keywords that a user is interested in. Therefore, the recommender system needs to return the user a set of papers that collectively covers all the queried keywords. However, existing recommender systems only use the exact keyword matching technique for recommendation decisions, while neglecting the correlation relationships among different papers. As a consequence, it may output a set of papers from multiple disciplines that are different from the user’s real research field. In view of this shortcoming, we propose a keyword-driven and popularity-aware paper recommendation approach based on an undirected paper citation graph, named PRkeyword+pop. At last, we conduct large-scale experiments on the real-life Hep-Th dataset to further demonstrate the usefulness and feasibility of PRkeyword+pop. Experimental results prove the advantages of PRkeyword+pop in searching for a set of satisfactory papers compared with other competitive approaches.

Two Phase Recommendation Algorithm Based on Clustering User Interest and Trust

2014 ◽  
Vol 543-547 ◽  
pp. 1856-1859
Author(s):  
Xiang Cui ◽  
Gui Sheng Yin
Keyword(s):  
Social Networks ◽  
Electronic Commerce ◽  
Recommender Systems ◽  
Information Overload ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Two Phase ◽  
Rating Data ◽  
User Interests ◽  
The Future

Recommender systems have been proven to be valuable means for Web online users to cope with the information overload and have become one of the most powerful and popular tools in electronic commerce. We need a method to solve such as what items to buy, what music to listen, or what news to read. The diversification of user interests and untruthfulness of rating data are the important problems of recommendation. In this article, we propose to use two phase recommendation based on user interest and trust ratings that have been given by actors to items. In the paper, we deal with the uncertain user interests by clustering firstly. In the algorithm, we compute the between-class entropy of any two clusters and get the stable classes. Secondly, we construct trust based social networks, and work out the trust scoring, in the class. At last, we provide some evaluation of the algorithms and propose the more improve ideas in the future.

scholarly journals Text Matching and Categorization: Mining Implicit Semantic Knowledge from Tree-Shape Structures

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Lin Guo ◽  
Wanli Zuo ◽  
Tao Peng ◽  
Lin Yue
Keyword(s):  
Text Categorization ◽  
Large Scale ◽  
Semantic Information ◽  
Semantic Knowledge ◽  
Semistructured Data ◽  
Experimental Results ◽  
Semantic Relations ◽  
Lexical Analysis ◽  
Tree Shape ◽  
Implicit Information

The diversities of large-scale semistructured data make the extraction of implicit semantic information have enormous difficulties. This paper proposes an automatic and unsupervised method of text categorization, in which tree-shape structures are used to represent semantic knowledge and to explore implicit information by mining hidden structures without cumbersome lexical analysis. Mining implicit frequent structures in trees can discover both direct and indirect semantic relations, which largely enhances the accuracy of matching and classifying texts. The experimental results show that the proposed algorithm remarkably reduces the time and effort spent in training and classifying, which outperforms established competitors in correctness and effectiveness.

scholarly journals Session-Based Recommender System for Sustainable Digital Marketing

2019 ◽  
Vol 11 (12) ◽  
pp. 3336 ◽  
Author(s):  
Hyunwoo Hwangbo ◽  
Yangsok Kim
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Recommender System ◽  
High Performance ◽  
Marketing Strategies ◽  
Feature Weighting ◽  
Experimental Results ◽  
Digital Marketing ◽  
Chi Square ◽  
Fashion Products

Many companies operate e-commerce websites to sell fashion products. Some customers want to buy products with intention of sustainability and therefore the companies need to suggest appropriate fashion products to those customers. Recommender systems are key applications in these sustainable digital marketing strategies and high performance is the most necessary factor. This research aims to improve recommendation systems’ performance by considering item session and attribute session information. We suggest the Item Session-Based Recommender (ISBR) and the Attribute Session-Based Recommenders (ASBRs) that use item and attribute session data independently, and then we suggest the Feature-Weighted Session-Based Recommenders (FWSBRs) that combine multiple ASBRs with various feature weighting schemes. Our experimental results show that FWSBR with chi-square feature weighting scheme outperforms ISBR, ASBRs, and Collaborative Filtering Recommender (CFR). In addition, it is notable that FWSBRs overcome the cold-start item problem, one significant limitation of CFR and ISBR, without losing performance.

Research on the Mechanism of Web Data Mining in Electronic Commerce Application

2014 ◽  
Vol 687-691 ◽  
pp. 3003-3006
Author(s):  
Pu Wang
Keyword(s):  
Data Mining ◽  
Electronic Commerce ◽  
Recommender Systems ◽  
Social Process ◽  
The Internet ◽  
Web Data ◽  
Process Data ◽  
Web Data Mining ◽  
Amount Of Information ◽  
The Web

At present, the growth of the Internet has brought us a vast amount of information that we can hardly deal with. To solve the flood of information, various data mining systems have been created to assist and augment this natural social process. Data minig recommender systems have been developed to automate the recommendation process. Data mining recommender systems can be found at many electronic commerce applications. In this paper, a recommendation mechanism of web data mining in electronic commerce application is given. Then, presents the workflow of the web data mining in electronic commcer. Lastly, the usage of the tools of web data mining is described.

scholarly journals Re-Enrichment Learning: Metadata Saliency for the Evolutive Personalization of a Recommender System

2021 ◽  
Vol 11 (4) ◽  
pp. 1733
Author(s):  
Yuseok Ban ◽  
Kyungjae Lee
Keyword(s):  
Recommender Systems ◽  
Recommender System ◽  
Experimental Results ◽  
Implicit Feedback ◽  
Digital Platforms ◽  
Novel Approach ◽  
Domain Transfer ◽  
Explicit Feedback

Many studies have been conducted on recommender systems in both the academic and industrial fields, as they are currently broadly used in various digital platforms to make personalized suggestions. Despite the improvement in the accuracy of recommenders, the diversity of interest areas recommended to a user tends to be reduced, and the sparsity of explicit feedback from users has been an important issue for making progress in recommender systems. In this paper, we introduce a novel approach, namely re-enrichment learning, which effectively leverages the implicit logged feedback from users to enhance user retention in a platform by enriching their interest areas. The approach consists of (i) graph-based domain transfer and (ii) metadata saliency, which (i) find an adaptive and collaborative domain representing the relations among many users’ metadata and (ii) extract attentional features from a user’s implicit logged feedback, respectively. The experimental results show that our proposed approach has a better capacity to enrich the diversity of interests of a user by means of implicit feedback and to help recommender systems achieve more balanced personalization. Our approach, finally, helps recommenders improve user retention, i.e., encouraging users to click more items or dwell longer on the platform.

scholarly journals A Research on Similarity Measure to Identify Effective Similar Users in Recommender Systems

2019 ◽  
Vol 8 (9S2) ◽  
pp. 834-840
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Similarity Measure ◽  
Recommender System ◽  
The Internet ◽  
Internet Users ◽  
Drastic Increase ◽  
Measure Model ◽  
Filtering Technique ◽  
Selection Of

In recent years there is a drastic increase in information over the internet. Users get confused to find out best product on the internet of one’s interest. Here the recommender system helps to filter the information and gives relevant recommendations to users so that the user community can find the item(s) of their interest from huge collection of available data. But filtering information from the users reviews given for various items seems to be a challenging task for recommending the user interested things. In general similarities between the users are considered for recommendations in collaborative filtering techniques. This paper describes a new collaborative filtering technique called Adaptive Similarity Measure Model [ASMM] to identify similarity between users for the selection of unseen items. Out of all the available items most similarities would be sorted out by ASMM for recommendation which varies from user to user

scholarly journals Modeling Source Syntax and Semantics for Neural AMR Parsing

2019 ◽  
Author(s):  
DongLai Ge ◽  
Junhui Li ◽  
Muhua Zhu ◽  
Shoushan Li
Keyword(s):  
Semantic Information ◽  
Benchmark Dataset ◽  
Experimental Results ◽  
Semantic Relations ◽  
Semantic Structure ◽  
Encoding Scheme ◽  
Word Sequence ◽  
Mixed Sequence ◽  
Source Sentence ◽  
Meaning Representation

Sequence-to-sequence (seq2seq) approaches formalize Abstract Meaning Representation (AMR) parsing as a translation task from a source sentence to a target AMR graph. However, previous studies generally model a source sentence as a word sequence but ignore the inherent syntactic and semantic information in the sentence. In this paper, we propose two effective approaches to explicitly modeling source syntax and semantics into neural seq2seq AMR parsing. The first approach linearizes source syntactic and semantic structure into a mixed sequence of words, syntactic labels, and semantic labels, while in the second approach we propose a syntactic and semantic structure-aware encoding scheme through a self-attentive model to explicitly capture syntactic and semantic relations between words. Experimental results on an English benchmark dataset show that our two approaches achieve significant improvement of 3.1% and 3.4% F1 scores over a strong seq2seq baseline.

scholarly journals An Innovative Recommender System for E-Commerce Websites using Natural Language Processing

2020 ◽  
Vol 8 (6) ◽  
pp. 4085-4089
Keyword(s):  
Natural Language Processing ◽  
Natural Language ◽  
Sentiment Analysis ◽  
Recommender Systems ◽  
Language Processing ◽  
Recommender System ◽  
Opinion Mining ◽  
The Internet

A Recommender System has become the go-to application for the internet generation these days. Mono-variate, bi-variate and multi-variate Recommender Systems are available to consumers of various products and services for the last 10 years or so only. In this paper, opinion mining dependent sentiment analysis using NLP tools will be used to recommend products to their purchasers on e-commerce websites. The application can be developed on the Python platform can be commercially used and will be precisely used to people who have to spend money without traditionally touching or feeling the item

Sign in / Sign up

Export Citation Format

Share Document