scholarly journals Recommendation System for Thesis Topics Using Content-based Filtering

2021 ◽  
Vol 15 (1) ◽  
pp. 65
Author(s):  
Hans Satria Kusuma ◽  
Aina Musdholifah
Keyword(s):  
Computer Science ◽  
Recommendation System ◽  
Bachelor Degree ◽  
Running Time ◽  
Recommendation Diversity ◽  
Content Based Filtering

 When pursuing their bachelor degree, every students are required to pursue a thesis in order to graduate from the major that they take. However, during the process, students got several difficulty regarding chosing their thesis topics. Therefore, a recommendation system is needed to classify thesis topics based on the students’ interest and abilities. This study developed a recommendation system for thesis topics using content-based filtering where the students will be asked to choose the course that they interested in along with their grades. After getting all the required data, the recommendation system will process the data and then it’ll show the title and the abstract of publication that fits the criteria.In this research, there are 2 datasets that is used, there are lecturer publication within 3 years and syllabus data of Computer Science UGM course. After running this research, it was found that the recommendation system has an average 7.46 seconds running time. It was also found that the recommendation system got an average 83% of the recommendation system objectives. The recommendation system objectives consist of relevance, novelty, serendipity, and increasing recommendation diversity.

User opinions driven social recommendation system

2021 ◽  
Vol 25 (1) ◽  
pp. 21-31
Author(s):  
Lakshmikanth Paleti ◽  
P. Radha Krishna ◽  
J.V.R. Murthy
Keyword(s):  
Social Networks ◽  
Collaborative Filtering ◽  
Recommendation System ◽  
Recommendation Systems ◽  
Social Recommendation ◽  
Novel Approach ◽  
Tripartite Graphs ◽  
Content Based Filtering

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.

A Particle Swarm Optimization based Hybrid Recommendation System

2016 ◽  
Vol 6 (2) ◽  
pp. 1-10
Author(s):  
Rabi Narayan Behera ◽  
Sujata Dash
Keyword(s):  
Recommendation System ◽  
Optimization Technique ◽  
User Profile ◽  
Matching Algorithm ◽  
Profile Matching ◽  
Machine Learning Approach ◽  
Movie Recommendation ◽  
Hybrid Recommendation ◽  
Content Based Filtering ◽  
Fine Tune

Due to rapid digital explosion user shows interest towards finding suggestions regarding a particular topic before taking any decision. Nowadays, a movie recommendation system is an upcoming area which suggests movies based on user profile. Many researchers working on supervised or semi-supervised ensemble based machine learning approach for matching more appropriate profiles and suggest related movies. In this paper a hybrid recommendation system is proposed which includes both collaborative and content based filtering to design a profile matching algorithm. A nature inspired Particle Swam Optimization technique is applied to fine tune the profile matching algorithm by assigning to multiple agents or particle with some initial random guess. The accuracy of the model will be judged comparing with Genetic algorithm.

scholarly journals A Probability-Based Hybrid User Model for Recommendation System

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Jia Hao ◽  
Yan Yan ◽  
Guoxin Wang ◽  
Lin Gong ◽  
Bo Zhao
Keyword(s):  
Product Design ◽  
Recommendation System ◽  
Information Overload ◽  
Rapid Development ◽  
User Model ◽  
Information Communication ◽  
Design Cycle ◽  
Available Information ◽  
User Ratings ◽  
Content Based Filtering

With the rapid development of information communication technology, the available information or knowledge is exponentially increased, and this causes the well-known information overload phenomenon. This problem is more serious in product design corporations because over half of the valuable design time is consumed in knowledge acquisition, which highly extends the design cycle and weakens the competitiveness. Therefore, the recommender systems become very important in the domain of product domain. This research presents a probability-based hybrid user model, which is a combination of collaborative filtering and content-based filtering. This hybrid model utilizes user ratings and item topics or classes, which are available in the domain of product design, to predict the knowledge requirement. The comprehensive analysis of the experimental results shows that the proposed method gains better performance in most of the parameter settings. This work contributes a probability-based method to the community for implement recommender system when only user ratings and item topics are available.

scholarly journals A Hybrid Adaptive Educational eLearning Project based on Ontologies Matching and Recommendation System

2020 ◽  
Author(s):  
Vasiliki Demertzi ◽  
Konstantinos Demertzis
Keyword(s):  
Recommendation System ◽  
Learning System ◽  
Educational Systems ◽  
Learning Needs ◽  
Pedagogical Strategies ◽  
Substantive Content ◽  
Teaching Content ◽  
Adaptive Educational Systems ◽  
Educational Conditions ◽  
Content Based Filtering

The implementation of teaching interventions in learning needs has received considerable attention, as the provision of the same educational conditions to all students, is pedagogically ineffective. In contrast, more effectively considered the pedagogical strategies that adapt to the real individual skills of the students. An important innovation in this direction is the Adaptive Educational Systems (AES) that support automatic modeling study and adjust the teaching content on educational needs and students' skills. Effective utilization of these educational approaches can be enhanced with Artificial Intelligence (AI) technologies in order to the substantive content of the web acquires structure and the published information is perceived by the search engines. This study proposes a novel Adaptive Educational eLearning System (AEeLS) that has the capacity to gather and analyze data from learning repositories and to adapt these to the educational curriculum according to the student skills and experience. It is a novel hybrid machine learning system that combines a Semi-Supervised Classification method for ontology matching and a Recommendation Mechanism that uses a hybrid method from neighborhood-based collaborative and content-based filtering techniques, in order to provide a personalized educational environment for each student.

scholarly journals P vs NP: P is Equal to NP: Desired Proof

2021 ◽  
pp. 1-11
Author(s):  
Zulfia A. Chotchaeva
Keyword(s):  
Artificial Intelligence ◽  
Computer Science ◽  
Structure Prediction ◽  
Complexity Classes ◽  
Open Problems ◽  
Exponential Time ◽  
Running Time ◽  
Algorithmic Problems ◽  
Np Problems ◽  
Np Problem

Computations and computational complexity are fundamental for mathematics and all computer science, including web load time, cryptography (cryptocurrency mining), cybersecurity, artificial intelligence, game theory, multimedia processing, computational physics, biology (for instance, in protein structure prediction), chemistry, and the P vs. NP problem that has been singled out as one of the most challenging open problems in computer science and has great importance as this would essentially solve all the algorithmic problems that we have today if the problem is solved, but the existing complexity is deprecated and does not solve complex computations of tasks that appear in the new digital age as efficiently as it needs. Therefore, we need to realize a new complexity to solve these tasks more rapidly and easily. This paper presents proof of the equality of P and NP complexity classes when the NP problem is not harder to compute than to verify in polynomial time if we forget recursion that takes exponential running time and goes to regress only (every problem in NP can be solved in exponential time, and so it is recursive, this is a key concept that exists, but recursion does not solve the NP problems efficiently). The paper’s goal is to prove the existence of an algorithm solving the NP task in polynomial running time. We get the desired reduction of the exponential problem to the polynomial problem that takes O(log n) complexity.

Sign in / Sign up

Export Citation Format

Share Document