A Recommendation Method for Highly Sparse Dataset Based on Teaching Recommendation Factorization Machines

There is no reasonable scientific basis for selecting the excellent teachers of the school’s courses.To solve the practical problem,we firstly give a series of normalization models for defining the key attributes of teachers’professional foundation,course difficulty coefficient,and comprehensive evaluation of teaching.Then,we define a partial weight function to calculate the key attributes,and obtain the partial recommendation values.Next,we construct a highly sparse Teaching Recommendation Factorization Machines(TRFMs)model,which takes the 5-tuples relation including teacher,course,teachers’professional foundation,course difficulty,teaching evaluation as the feature vector,and take partial recommendation value as the recommendation label.Finally,we design a novel Top-N excellent teacher recommendation algorithm based on TRFMs by course classification on the highly sparse dataset.Experimental results show that the proposed TRFMs and recommendation algorithm can accurately realize the recommendation of excellent teachers on a highly sparse historical teaching dataset.The recommendation accuracy is superior to that of the three-dimensional tensor decomposition model algorithm which also solves sparse datasets.The proposed method can be used as a new recommendation method applied to the teaching arrangements in all kinds of schools,which can effectively improve the teaching quality.

A novel hybrid estimation of distribution algorithm for solving hybrid flowshop scheduling problem with unrelated parallel machine

The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.