scholarly journals User Curiosity Factor in Determining Serendipity of Recommender System

Author(s):  
Arseto Satriyo Nugroho ◽  
Igi Ardiyanto ◽  
Teguh Bharata Adji

Recommender rystem (RS) is created to solve the problem by recommending some items among a huge selection of items that will be useful for the e-commerce users. RS prevents the users from being flooded by information that is irrelevant for them.Unlike information retrieval (IR) systems, the RS system's goal is to present information to the users that is accurate and preferably useful to them. Too much focus on accuracy in RS may lead to an overspecialization problem, which will decrease its effectiveness. Therefore, the trend in RS research is focusing beyond accuracy methods, such as serendipity. Serendipity can be described as an unexpected discovery that is useful. Since the concept of a recommendation system is still evolving today, formalizing the definition of serendipity in a recommendation system is very challenging.One known subjective factor of serendipity is curiosity. While some researchers already addressed curiosity factor, it is found that the relationships between various serendipity component as perceived by the users and their curiosity levels is still yet to be researched. In this paper, the method to determine user curiosity model by considering the variation of rated items was presented, then relation to serendipity components using existing user feedback data was validated. The finding showed that the curiosity model was related to some user-perceived values of serendipity, but not all. Moreover, it also had positive effect on broadening the user preference. 

2022 ◽  
Vol 2022 ◽  
pp. 1-12
Author(s):  
Huazhen Liu ◽  
Wei Wang ◽  
Yihan Zhang ◽  
Renqian Gu ◽  
Yaqi Hao

Explicit feedback and implicit feedback are two important types of heterogeneous data for constructing a recommendation system. The combination of the two can effectively improve the performance of the recommendation system. However, most of the current deep learning recommendation models fail to fully exploit the complementary advantages of two types of data combined and usually only use binary implicit feedback data. Thus, this paper proposes a neural matrix factorization recommendation algorithm (EINMF) based on explicit-implicit feedback. First, neural network is used to learn nonlinear feature of explicit-implicit feedback of user-item interaction. Second, combined with the traditional matrix factorization, explicit feedback is used to accurately reflect the explicit preference and the potential preferences of users to build a recommendation model; a new loss function is designed based on explicit-implicit feedback to obtain the best parameters through the neural network training to predict the preference of users for items; finally, according to prediction results, personalized recommendation list is pushed to the user. The feasibility, validity, and robustness are fully demonstrated in comparison with multiple baseline models on two real datasets.


Author(s):  
Widhi Hartanto ◽  
Noor Akhmad Setiawan ◽  
Teguh Bharata Adji

The recommendation system is a method for helping consumers to find products that fit their preferences. However, recommendations that are merely based on user preference are no longer satisfactory. Consumers expect recommendations that are novel, unexpected, and relevant. It requires the development of a serendipity recommendation system that matches the serendipity data character. However, there are still debates among researchers about the available common definition of serendipity. Therefore, our study proposes a work to identify serendipity data's character by directly using serendipity data ground truth from the famous Movielens dataset. The serendipity data identification is based on a distance-based approach using collaborative filtering and k-means clustering algorithms. Collaborative filtering is used to calculate the similarity value between data, while k-means is used to cluster the collaborative filtering data. The resulting clusters are used to determine the position of the serendipity cluster. The result of this study shows that the average distance between the recommended movie cluster and the serendipity movie cluster is 0.85 units, which is neither the closest cluster nor the farthest cluster from the recommended movie cluster.


Author(s):  
P. M. Lowrie ◽  
W. S. Tyler

The importance of examining stained 1 to 2μ plastic sections by light microscopy has long been recognized, both for increased definition of many histologic features and for selection of specimen samples to be used in ultrastructural studies. Selection of specimens with specific orien ation relative to anatomical structures becomes of critical importance in ultrastructural investigations of organs such as the lung. The uantity of blocks necessary to locate special areas of interest by random sampling is large, however, and the method is lacking in precision. Several methods have been described for selection of specific areas for electron microscopy using light microscopic evaluation of paraffin, epoxy-infiltrated, or epoxy-embedded large blocks from which thick sections were cut. Selected areas from these thick sections were subsequently removed and re-embedded or attached to blank precasted blocks and resectioned for transmission electron microscopy (TEM).


Author(s):  
Maria Ciaramella ◽  
Nadia Monacelli ◽  
Livia Concetta Eugenia Cocimano

AbstractThis systematic review aimed to contribute to a better and more focused understanding of the link between the concept of resilience and psychosocial interventions in the migrant population. The research questions concerned the type of population involved, definition of resilience, methodological choices and which intervention programmes were targeted at migrants. In the 90 articles included, an heterogeneity in defining resilience or not well specified definition resulted. Different migratory experiences were not adequately considered in the selection of participants. Few resilience interventions on migrants were resulted. A lack of procedure’s descriptions that keep in account specific migrants’ life-experiences and efficacy’s measures were highlighted.


2020 ◽  
pp. 102986492097216
Author(s):  
Gaelen Thomas Dickson ◽  
Emery Schubert

Background: Music is thought to be beneficial as a sleep aid. However, little research has explicitly investigated the specific characteristics of music that aid sleep and some researchers assume that music described as generically sedative (slow, with low rhythmic activity) is necessarily conducive to sleep, without directly interrogating this assumption. This study aimed to ascertain the features of music that aid sleep. Method: As part of an online survey, 161 students reported the pieces of music they had used to aid sleep, successfully or unsuccessfully. The participants reported 167 pieces, some more often than others. Nine features of the pieces were analyzed using a combination of music information retrieval methods and aural analysis. Results: Of the pieces reported by participants, 78% were successful in aiding sleep. The features they had in common were that (a) their main frequency register was middle range frequencies; (b) their tempo was medium; (c) their articulation was legato; (d) they were in the major mode, and (e) lyrics were present. They differed from pieces that were unsuccessful in aiding sleep in that (a) their main frequency register was lower; (b) their articulation was legato, and (c) they excluded high rhythmic activity. Conclusion: Music that aids sleep is not necessarily sedative music, as defined in the literature, but some features of sedative music are associated with aiding sleep. In the present study, we identified the specific features of music that were reported to have been successful and unsuccessful in aiding sleep. The identification of these features has important implications for the selection of pieces of music used in research on sleep.


Children ◽  
2021 ◽  
Vol 8 (6) ◽  
pp. 525
Author(s):  
Emily von Scheven ◽  
Bhupinder K. Nahal ◽  
Rosa Kelekian ◽  
Christina Frenzel ◽  
Victoria Vanderpoel ◽  
...  

Promoting hope was identified in our prior work as the top priority research question among patients and caregivers with diverse childhood-onset chronic conditions. Here, we aimed to construct a conceptual model to guide future research studies of interventions to improve hope. We conducted eight monthly virtual focus groups and one virtual workshop with patients, caregivers, and researchers to explore key constructs to inform the model. Discussions were facilitated by Patient Co-Investigators. Participants developed a definition of hope and identified promotors and inhibitors that influence the experience of hope. We utilized qualitative methods to analyze findings and organize the promotors and inhibitors of hope within three strata of the socio-ecologic framework: structural, interpersonal, and intrapersonal. Participants identified three types of interventions to promote hope: resources, navigation, and activities to promote social connection. The hope conceptual model can be used to inform the selection of interventions to assess in future research studies aimed at improving hope and the specification of outcome measures to include in hope research studies. Inclusion of the health care system in the model provides direction for identifying strategies for improving the system and places responsibility on the system to do better to promote hope among young patients with chronic illness and their caregivers.


Libri ◽  
2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Zongda Wu ◽  
Chenglang Lu ◽  
Youlin Zhao ◽  
Jian Xie ◽  
Dongdong Zou ◽  
...  

Abstract This paper reviews a large number of research achievements relevant to user privacy protection in an untrusted network environment, and then analyzes and evaluates their application limitations in personalized information retrieval, to establish the conditional constraints that an effective approach for user preference privacy protection in personalized information retrieval should meet, thus providing a basic reference for the solution of this problem. First, based on the basic framework of a personalized information retrieval platform, we establish a complete set of constraints for user preference privacy protection in terms of security, usability, efficiency, and accuracy. Then, we comprehensively review the technical features for all kinds of popular methods for user privacy protection, and analyze their application limitations in personalized information retrieval, according to the constraints of preference privacy protection. The results show that personalized information retrieval has higher requirements for users’ privacy protection, i.e., it is required to comprehensively improve the security of users’ preference privacy on the untrusted server-side, under the precondition of not changing the platform, algorithm, efficiency, and accuracy of personalized information retrieval. However, all kinds of existing privacy methods still cannot meet the above requirements. This paper is an important study attempt to the problem of user preference privacy protection of personalized information retrieval, which can provide a basic reference and direction for the further study of the problem.


2020 ◽  
Vol 19 (10) ◽  
pp. 1602-1618 ◽  
Author(s):  
Thibault Robin ◽  
Julien Mariethoz ◽  
Frédérique Lisacek

A key point in achieving accurate intact glycopeptide identification is the definition of the glycan composition file that is used to match experimental with theoretical masses by a glycoproteomics search engine. At present, these files are mainly built from searching the literature and/or querying data sources focused on posttranslational modifications. Most glycoproteomics search engines include a default composition file that is readily used when processing MS data. We introduce here a glycan composition visualizing and comparative tool associated with the GlyConnect database and called GlyConnect Compozitor. It offers a web interface through which the database can be queried to bring out contextual information relative to a set of glycan compositions. The tool takes advantage of compositions being related to one another through shared monosaccharide counts and outputs interactive graphs summarizing information searched in the database. These results provide a guide for selecting or deselecting compositions in a file in order to reflect the context of a study as closely as possible. They also confirm the consistency of a set of compositions based on the content of the GlyConnect database. As part of the tool collection of the Glycomics@ExPASy initiative, Compozitor is hosted at https://glyconnect.expasy.org/compozitor/ where it can be run as a web application. It is also directly accessible from the GlyConnect database.


2003 ◽  
Vol 11 (2) ◽  
pp. 169-206 ◽  
Author(s):  
Riccardo Poli ◽  
Nicholas Freitag McPhee

This paper is the second part of a two-part paper which introduces a general schema theory for genetic programming (GP) with subtree-swapping crossover (Part I (Poli and McPhee, 2003)). Like other recent GP schema theory results, the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Cartesian node reference system, introduced in Part I, and on the notion of a variable-arity hyperschema, introduced here, which generalises previous definitions of a schema. The theory includes two main theorems describing the propagation of GP schemata: a microscopic and a macroscopic schema theorem. The microscopic version is applicable to crossover operators which replace a subtree in one parent with a subtree from the other parent to produce the offspring. Therefore, this theorem is applicable to Koza's GP crossover with and without uniform selection of the crossover points, as well as one-point crossover, size-fair crossover, strongly-typed GP crossover, context-preserving crossover and many others. The macroscopic version is applicable to crossover operators in which the probability of selecting any two crossover points in the parents depends only on the parents' size and shape. In the paper we provide examples, we show how the theory can be specialised to specific crossover operators and we illustrate how it can be used to derive other general results. These include an exact definition of effective fitness and a size-evolution equation for GP with subtree-swapping crossover.


Sign in / Sign up

Export Citation Format

Share Document