A current problem in diet recommendation systems is the matching of food preferences with nutritional requirements,taking into account individual characteristics,such as body weight with individual health conditions,s...A current problem in diet recommendation systems is the matching of food preferences with nutritional requirements,taking into account individual characteristics,such as body weight with individual health conditions,such as diabetes.Current dietary recommendations employ association rules,content-based collaborative filtering,and constraint-based methods,which have several limitations.These limitations are due to the existence of a special user group and an imbalance of non-simple attributes.Making use of traditional dietary recommendation algorithm researches,we combine the Adaboost classifier with probabilistic matrix factorization.We present a personalized diet recommendation algorithm by taking advantage of probabilistic matrix factorization via Adaboost.A probabilistic matrix factorization method extracts the implicit factors between individual food preferences and nutritional characteristics.From this,we can make use of those features with strong influence while discarding those with little influence.After incorporating these changes into our approach,we evaluated our algorithm’s performance.Our results show that our method performed better than others at matching preferred foods with dietary requirements,benefiting user health as a result.The algorithm fully considers the constraint relationship between users’attributes and nutritional characteristics of foods.Considering many complex factors in our algorithm,the recommended food result set meets both health standards and users’dietary preferences.A comparison of our algorithm with others demonstrated that our method offers high accuracy and interpretability.展开更多
Rank determination issue is one of the most significant issues in non-negative matrix factorization (NMF) research. However, rank determination problem has not received so much emphasis as sparseness regularization pr...Rank determination issue is one of the most significant issues in non-negative matrix factorization (NMF) research. However, rank determination problem has not received so much emphasis as sparseness regularization problem. Usually, the rank of base matrix needs to be assumed. In this paper, we propose an unsupervised multi-level non-negative matrix factorization model to extract the hidden data structure and seek the rank of base matrix. From machine learning point of view, the learning result depends on its prior knowledge. In our unsupervised multi-level model, we construct a three-level data structure for non-negative matrix factorization algorithm. Such a construction could apply more prior knowledge to the algorithm and obtain a better approximation of real data structure. The final bases selection is achieved through L2-norm optimization. We implement our experiment via binary datasets. The results demonstrate that our approach is able to retrieve the hidden structure of data, thus determine the correct rank of base matrix.展开更多
基金This work was supported in part by the National Natural Science Foundation of China(51679105,51809112,51939003,61872160)“Thirteenth Five Plan”Science and Technology Project of Education Department,Jilin Province(JJKH20200990KJ).
文摘A current problem in diet recommendation systems is the matching of food preferences with nutritional requirements,taking into account individual characteristics,such as body weight with individual health conditions,such as diabetes.Current dietary recommendations employ association rules,content-based collaborative filtering,and constraint-based methods,which have several limitations.These limitations are due to the existence of a special user group and an imbalance of non-simple attributes.Making use of traditional dietary recommendation algorithm researches,we combine the Adaboost classifier with probabilistic matrix factorization.We present a personalized diet recommendation algorithm by taking advantage of probabilistic matrix factorization via Adaboost.A probabilistic matrix factorization method extracts the implicit factors between individual food preferences and nutritional characteristics.From this,we can make use of those features with strong influence while discarding those with little influence.After incorporating these changes into our approach,we evaluated our algorithm’s performance.Our results show that our method performed better than others at matching preferred foods with dietary requirements,benefiting user health as a result.The algorithm fully considers the constraint relationship between users’attributes and nutritional characteristics of foods.Considering many complex factors in our algorithm,the recommended food result set meets both health standards and users’dietary preferences.A comparison of our algorithm with others demonstrated that our method offers high accuracy and interpretability.
文摘Rank determination issue is one of the most significant issues in non-negative matrix factorization (NMF) research. However, rank determination problem has not received so much emphasis as sparseness regularization problem. Usually, the rank of base matrix needs to be assumed. In this paper, we propose an unsupervised multi-level non-negative matrix factorization model to extract the hidden data structure and seek the rank of base matrix. From machine learning point of view, the learning result depends on its prior knowledge. In our unsupervised multi-level model, we construct a three-level data structure for non-negative matrix factorization algorithm. Such a construction could apply more prior knowledge to the algorithm and obtain a better approximation of real data structure. The final bases selection is achieved through L2-norm optimization. We implement our experiment via binary datasets. The results demonstrate that our approach is able to retrieve the hidden structure of data, thus determine the correct rank of base matrix.
