scholarly journals Personalized Scholar Recommendation Based on Multi-Dimensional Features

2021 ◽  
Vol 11 (18) ◽  
pp. 8664
Author(s):  
Huiying Jin ◽  
Pengcheng Zhang ◽  
Hai Dong ◽  
Mengqiao Shao ◽  
Yuelong Zhu

The rapid development of social networking platforms in recent years has made it possible for scholars to find partners who share similar research interests. Nevertheless, this task has become increasingly challenging with the dramatic increase in the number of scholar users over social networks. Scholar recommendation has recently become a hot topic. Thus, we propose a personalized scholar recommendation approach, Mul-RSR (Multi-dimensional features based Research Scholar Recommendation), which improves accuracy and interpretability. In this work, Mul-RSR aims to provide personalized recommendation for academic social platforms. Mul-RSR uses the Doc2Vec text model and the random walk algorithm to calculate textual similarity and social relevance to measure the correlation between scholars. It is able to recommend Top-N scholars for each scholar based on multi-layer perception and attention mechanism. To evaluate the proposed approach, we conduct a series of experiments based on public and self-collected ResearchGate datasets. The results demonstrate that our approach improves the recommendation hit rate, and the hit rate reaches 59.31% when the N value is 30. Through these evaluations, we show Mul-RSR can provide a more solid scientific decision-making basis and achieve a better recommendation effect.

2014 ◽  
Vol 38 (8) ◽  
pp. 753-763 ◽  
Author(s):  
D.P. Onoma ◽  
S. Ruan ◽  
S. Thureau ◽  
L. Nkhali ◽  
R. Modzelewski ◽  
...  

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Chaohua Fang ◽  
Qiuyun Lu

With the rapid development of information technology and data science, as well as the innovative concept of “Internet+” education, personalized e-learning has received widespread attention in school education and family education. The development of education informatization has led to a rapid increase in the number of online learning users and an explosion in the number of learning resources, which makes learners face the dilemma of “information overload” and “learning lost” in the learning process. In the personalized learning resource recommendation system, the most critical thing is the construction of the learner model. Currently, most learner models generally have a lack of scientific focus that they have a single method of obtaining dimensions, feature attributes, and low computational complexity. These problems may lead to disagreement between the learner’s learning ability and the difficulty of the recommended learning resources and may lead to the cognitive overload or disorientation of learners in the learning process. The purpose of this paper is to construct a learner model to support the above problems and to strongly support individual learning resources recommendation by learning the resource model which effectively reduces the problem of cold start and sparsity in the recommended process. In this paper, we analyze the behavioral data of learners in the learning process and extract three features of learner’s cognitive ability, knowledge level, and preference for learning of learner model analysis. Among them, the preference model of the learner is constructed using the ontology, and the semantic relation between the knowledge is better understood, and the interest of the student learning is discovered.


2013 ◽  
Vol 06 (06) ◽  
pp. 1350043 ◽  
Author(s):  
LI GUO ◽  
YUNTING ZHANG ◽  
ZEWEI ZHANG ◽  
DONGYUE LI ◽  
YING LI

In this paper, we proposed a semi-automatic technique with a marker indicating the target to locate and segment nodules. For the lung nodule detection, we develop a Gabor texture feature by FCM (Fuzzy C Means) segmentation. Given a marker indicating a rough location of the nodules, a decision process is followed by applying an ellipse fitting algorithm. From the ellipse mask, the foreground and background seeds for the random walk segmentation can be automatically obtained. Finally, the edge of the nodules is obtained by the random walk algorithm. The feasibility and effectiveness of the proposed method are evaluated with the various types of the nodules to identify the edges, so that it can be used to locate the nodule edge and its growth rate.


2010 ◽  
Vol 1 (3) ◽  
pp. 1-19 ◽  
Author(s):  
Noureddine Bouhmala ◽  
Ole-Christoffer Granmo

The graph coloring problem (GCP) is a widely studied combinatorial optimization problem due to its numerous applications in many areas, including time tabling, frequency assignment, and register allocation. The need for more efficient algorithms has led to the development of several GC solvers. In this paper, the authors introduce a team of Finite Learning Automata, combined with the random walk algorithm, using Boolean satisfiability encoding for the GCP. The authors present an experimental analysis of the new algorithm’s performance compared to the random walk technique, using a benchmark set containing SAT-encoding graph coloring test sets.


Sign in / Sign up

Export Citation Format

Share Document