Web-based adaptive audio-therapy recommender system

Author(s):  
Muhammad Khidhir Salleh ◽  
Norliza Mohamad Zaini
Keyword(s):  
Author(s):  
Mohammad Belghis-Zadeh ◽  
Hazra Imran ◽  
Maiga Chang ◽  
Sabine Graf
Keyword(s):  

Author(s):  
Vala Ali Rohani ◽  
Sedigheh Moghavvemi ◽  
Tiago Pinho ◽  
Paulo Caldas

Due to the COVID‐19 pandemic, most countries are exposed to unprecedented social problems in the current global situation. According to the official reports, it caused a dramatic increase of 44% in graduates' unemployment rate in Portugal. Moreover, from the human resource point of view, the whole of Europe is expected to face a shortage of 925,000 data professionals by 2025. Given the existing situations, the DataPro aims to propose a national-level reskilling solution in big data to mitigate both social problems of unemployability and the shortage of data professionals in Portugal. DataPro project consists of four dimensions, including an online portal for the hiring companies and unemployed graduates, along with a web-based analytics talent upskilling (ATU) platform empowered by an artificial intelligence recommender system to match the reskilled data professionals and the hiring companies.


2021 ◽  
Author(s):  
Simen Eide ◽  
David Leslie ◽  
Arnoldo Frigessi

Abstract We consider the problem of recommending relevant content to users of an internet platform in the form of lists of items, called slates. We introduce a variational Bayesian Recurrent Neural Net recommender system that acts on time series of interactions between the internet platform and the user, and which scales to real world industrial situations. The recommender system is tested both online on real users, and on an offline dataset collected from a Norwegian web-based marketplace, FINN.no, that is made public for research. This is one of the first publicly available datasets which includes all the slates that are presented to users as well as which items (if any) in the slates were clicked on. Such a data set allows us to move beyond the common assumption that implicitly assumes that users are considering all possible items at each interaction. Instead we build our likelihood using the items that are actually in the slate, and evaluate the strengths and weaknesses of both approaches theoretically and in experiments. We also introduce a hierarchical prior for the item parameters based on group memberships. Both item parameters and user preferences are learned probabilistically. Furthermore, we combine our model with bandit strategies to ensure learning, and introduce `in-slate Thompson Sampling' which makes use of the slates to maximise explorative opportunities. We show experimentally that explorative recommender strategies perform on par or above their greedy counterparts. Even without making use of exploration to learn more effectively, click rates increase simply because of improved diversity in the recommended slates.


Author(s):  
Angelika I. Kokkinaki ◽  
Rommert Dekker ◽  
Nikos Karacapilidis ◽  
Costas Pappis
Keyword(s):  

Author(s):  
Omisore M. O. ◽  
Samuel O. W.

The huge amount of information available online has given rise to personalization and filtering systems. Recommender systems (RS) constitute a specific type of information filtering technique that present items according to user's interests. In this research, a web-based personalized recommender system capable of providing learners with books that suit their reading abilities was developed. Content-based filtering (CBF) was used to analyze learners' reading abilities while books that are found suitable to learners are recommended with fuzzy matching techniques. The yokefellow cold-start problem inherent to CBF is assuaged by cold start engine. An experimental study was carried out on a database of 10000 books from different categories of computing studies. The outcome tracked over a period of eight months shows that the proposed system induces greater user satisfaction and this attests users' desirability of the system.


2013 ◽  
Vol 811 ◽  
pp. 564-568
Author(s):  
Chung C. Chang

This paper is to present one of the techniques of data mining called the nearest neighbor algorithm to build a web-based recommender system for house trading and matching. The nearest neighbor algorithm is a pragmatic and highly accurate algorithm and can be used in the recommender system. Its use could enhance the systems matching ability so that users can easily obtain the information they need. This system offers a better way to get beyond the disadvantages of the traditional conditional or Boolean method that real estate agencies use to search for appropriate houses. Through improving the traditional but inefficient approach to searching, users will not waste much time without getting useful information or good offers of real estate.


Sign in / Sign up

Export Citation Format

Share Document