scholarly journals Opinion based Memory Access Algorithms using Collaborative Filtering in Recommender Systems

In recent years, the online shopping and the online advertisement businesses is growing in a vast way. The reason behind this growth is, the peoples are not having sufficient time for go for a shop. Without seeing the quality of the product directly, the people are ready to buy the product by seeing the other user recommendation of the particular product. This leads an interest / the need to develop the researcher an innovative recommendation framework. Based on the opinion prediction rule, the huge size of words and the phrases which are presented in the unstructured data is modified as a numerical values. The sale of the particular product in an online shopping is depends on its description of the quality, the review of the customer. Based on the positive and negative polarity, an Inclusive Similarity-based Clustering (ISC) is proposed to cluster the extracted related keywords from the user reviews. To evaluate the strength, weakness of the product, estimate the respective features, as well as the opinions, the Improved Feature Specific Collaborative Filtering (IFSCF) model for the feature with aspect opinion is proposed. Finally the complete feedback of the product is estimated by propose the Novel Product Feature-based Opinion Score Estimation process. The main challenge in this recommendation system is the fault information estimation of the reviews and the unrelated recommendations of the bestselling or the better quality product. To neglect these issues, an Enhanced Feature Specific Collaborative Filtering Model based on temporal (EFCFM) is proposed in the recommendation system. Hence the developed EFCFM method is investigated by comparing along with the existing methods in terms of subsequent parameters, precision, recall, f-measure, MAE and the RMSE. The outcome shows that the developed EFCFM approach predicts the best product and produce the accurate recommendation to the customers.

Recommendation algorithms play a quintessential role in development of E-commerce recommendation system, Where in Collaborative filtering algorithm is a major contributor for most recommendation systems since they are a flavor of KNN algorithm specifically tailored for E-commerce Web Applications, the main advantages of using CF algorithms are they are efficient in capturing collective experiences and behavior of e-commerce customers in real time, But it is noted that , this results in the phenomenon of Mathew effect, Wherein only popular products are listed into the recommendation list and lesser popular items tend to become even more scarce. Hence this results in products which are already familiar to users being discovered redundantly, thus potential discovery of niche and new items in the e-commerce application is compromised. To address this issue , this paper throws light on user behavior on the online shopping platform , accordingly a novel selectivity based collaborative filtering algorithm is proposed with innovator products that can recommend niche items but less popular products to users by introducing the concept of collaborative filtering with consumer influencing capability. Specifically, innovator products are a special subset of products which are less popular/ have received less traction from users but are genuinely of higher quality, therefore, these aforementioned products can be captured in the recommendation list via innovator-recognition table, achieving the balance between popularity and practicability for the user


Author(s):  
Yuchi Kanzawa ◽  
Tadafumi Kondo

AbstractAlthough recommendation systems are the most powerful tool to help people choose items, a higher recommendation accuracy is required to satisfy the needs of the people. Motivated by this requirement, this study proposes a novel collaborative filtering (CF) algorithm, which is the underlying technology of a recommendation system. It filters items for a target user based on the reactions of similar users. Cluster analysis helps detect similar users by grouping a set of users such that users in the same group are more similar to each other than to those in other groups. However, in most representative CF algorithms such as GroupLens algorithm, users are considered as spherical data, and as categorical multivariate data in the clustering phase of a previous study. This study overcomes this logic gap by proposing a novel CF method using fuzzy clustering for spherical data based on q-divergence as both the clustering phase and the GroupLens algorithm consistently deal with users as spherical data. Experiments were conducted on six real datasets—BookCrossing, Epinions, Jester, LibimSeTi, MovieLens, and SUSHI, to compare the performance of the proposed method with GroupLens and the method using fuzzy clustering for categorical multivariate data based on q-divergence, which are conventional methods, where the performance is measured by the area under the receiver operating curve. The results of the experiments indicate that the proposed algorithm outperforms the others in terms of recommendation accuracy.


2020 ◽  
Vol 14 ◽  
Author(s):  
Amreen Ahmad ◽  
Tanvir Ahmad ◽  
Ishita Tripathi

: 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.


2020 ◽  
Vol 13 (5) ◽  
pp. 884-892
Author(s):  
Sartaj Ahmad ◽  
Ashutosh Gupta ◽  
Neeraj Kumar Gupta

Background: In recent time, people love online shopping but before any shopping feedbacks or reviews always required. These feedbacks help customers in decision making for buying any product or availing any service. In the country like India this trend of online shopping is increasing very rapidly because awareness and the use of internet which is increasing day by day. As result numbers of customers and their feedbacks are also increasing. It is creating a problem that how to read all reviews manually. So there should be some computerized mechanism that provides customers a summary without spending time in reading feedbacks. Besides big number of reviews another problem is that reviews are not structured. Objective: In this paper, we try to design, implement and compare two algorithms with manual approach for the crossed domain Product’s reviews. Methods: Lexicon based model is used and different types of reviews are tested and analyzed to check the performance of these algorithms. Results: Algorithm based on opinions and feature based opinions are designed, implemented, applied and compared with the manual results and it is found that algorithm # 2 is performing better than algorithm # 1 and near to manual results. Conclusion: Algorithm # 2 is found better on the different product’s reviews and still to be applied on other product’s reviews to enhance its scope. Finally, it will be helpful to automate existing manual process.


2021 ◽  
Vol 13 (13) ◽  
pp. 7156
Author(s):  
Kyoung Jun Lee ◽  
Yu Jeong Hwangbo ◽  
Baek Jeong ◽  
Ji Woong Yoo ◽  
Kyung Yang Park

Many small and medium enterprises (SMEs) want to introduce recommendation services to boost sales, but they need to have sufficient amounts of data to introduce these recommendation services. This study proposes an extrapolative collaborative filtering (ECF) system that does not directly share data among SMEs but improves recommendation performance for small and medium-sized companies that lack data through the extrapolation of data, which can provide a magical experience to users. Previously, recommendations were made utilizing only data generated by the merchant itself, so it was impossible to recommend goods to new users. However, our ECF system provides appropriate recommendations to new users as well as existing users based on privacy-preserved payment transaction data. To accomplish this, PP2Vec using Word2Vec was developed by utilizing purchase information only, excluding personal information from payment company data. We then compared the performances of single-merchant models and multi-merchant models. For the merchants with more data than SMEs, the performance of the single-merchant model was higher, while for the SME merchants with fewer data, the multi-merchant model’s performance was higher. The ECF System proposed in this study is more suitable for the real-world business environment because it does not directly share data among companies. Our study shows that AI (artificial intelligence) technology can contribute to the sustainability and viability of economic systems by providing high-performance recommendation capability, especially for small and medium-sized enterprises and start-ups.


2021 ◽  
Vol 25 (4) ◽  
pp. 1013-1029
Author(s):  
Zeeshan Zeeshan ◽  
Qurat ul Ain ◽  
Uzair Aslam Bhatti ◽  
Waqar Hussain Memon ◽  
Sajid Ali ◽  
...  

With the increase of online businesses, recommendation algorithms are being researched a lot to facilitate the process of using the existing information. Such multi-criteria recommendation (MCRS) helps a lot the end-users to attain the required results of interest having different selective criteria – such as combinations of implicit and explicit interest indicators in the form of ranking or rankings on different matched dimensions. Current approaches typically use label correlation, by assuming that the label correlations are shared by all objects. In real-world tasks, however, different sources of information have different features. Recommendation systems are more effective if being used for making a recommendation using multiple criteria of decisions by using the correlation between the features and items content (content-based approach) or finding a similar user rating to get targeted results (Collaborative filtering). To combine these two filterings in the multicriteria model, we proposed a features-based fb-knn multi-criteria hybrid recommendation algorithm approach for getting the recommendation of the items by using multicriteria features of items and integrating those with the correlated items found in similar datasets. Ranks were assigned to each decision and then weights were computed for each decision by using the standard deviation of items to get the nearest result. For evaluation, we tested the proposed algorithm on different datasets having multiple features of information. The results demonstrate that proposed fb-knn is efficient in different types of datasets.


2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Triyanna Widiyaningtyas ◽  
Indriana Hidayah ◽  
Teguh B. Adji

AbstractCollaborative filtering is one of the most widely used recommendation system approaches. One issue in collaborative filtering is how to use a similarity algorithm to increase the accuracy of the recommendation system. Most recently, a similarity algorithm that combines the user rating value and the user behavior value has been proposed. The user behavior value is obtained from the user score probability in assessing the genre data. The problem with the algorithm is it only considers genre data for capturing user behavior value. Therefore, this study proposes a new similarity algorithm – so-called User Profile Correlation-based Similarity (UPCSim) – that examines the genre data and the user profile data, namely age, gender, occupation, and location. All the user profile data are used to find the weights of the similarities of user rating value and user behavior value. The weights of both similarities are obtained by calculating the correlation coefficients between the user profile data and the user rating or behavior values. An experiment shows that the UPCSim algorithm outperforms the previous algorithm on recommendation accuracy, reducing MAE by 1.64% and RMSE by 1.4%.


Author(s):  
Lakshmikanth Paleti ◽  
P. Radha Krishna ◽  
J.V.R. Murthy

Recommendation systems provide reliable and relevant recommendations to users and also enable users’ trust on the website. This is achieved by the opinions derived from reviews, feedbacks and preferences provided by the users when the product is purchased or viewed through social networks. This integrates interactions of social networks with recommendation systems which results in the behavior of users and user’s friends. The techniques used so far for recommendation systems are traditional, based on collaborative filtering and content based filtering. This paper provides a novel approach called User-Opinion-Rating (UOR) for building recommendation systems by taking user generated opinions over social networks as a dimension. Two tripartite graphs namely User-Item-Rating and User-Item-Opinion are constructed based on users’ opinion on items along with their ratings. Proposed approach quantifies the opinions of users and results obtained reveal the feasibility.


2021 ◽  
Vol 1 (3) ◽  
pp. 58-60
Author(s):  
Katanakal Sarada ◽  
◽  
Dr. K. Nirmalamma ◽  
◽  

Mobile commerce is the buying and selling of goods and Services through wireless handled devices such as smart phones and tablets etc. Ecommerce Users to access M-commerce enables online shopping platforms without needing to use & a desktop computer. For example, purchase and sale of products. Online like banking and paying bills. (Virtual market place apps the Amazon mobile App, Android pay, Samsung pay etc...) The main idea behind M. commerce Is to enable various applications and services available on the internet to portable devices (mobiles, laptops, tables etc.) to overcome the constraints of a desktop computer. M commerce aims Serve all information and material needs of the people in a convenient and easy way.


Sign in / Sign up

Export Citation Format

Share Document