جامعة المعرفة
المصدر المعتمد للمعلومات البحثية والمخرجات هو قاعدة بيانات سكوبس (Elsevier Scopus) مع تدقيق بيانات الباحثين من عمادة البحث العلمي.

Research outputs

المخرجات البحثية

مقالات ومراجعات وأوراق مؤتمرات وفصول كتب، مفهرسة برقم DOI ومربوطة بباحثي الجامعة.

2 مُخرَج نتائج البحث عن «sparsity»

مقالوصول مغلق202311استشهاد· Semantic Scholar

Self-Attention Mechanism-Based Federated Learning Model for Cross Context Recommendation System

IEEE Transactions on Consumer Electronics · مجلد 70 (1) · 2687-2695

The traditional single-context recommendation algorithm is constrained by the sparse connection between users and items and a user/item cold start problem. Based on the review, the text-based cross-context recommendation algorithm extracts user/item comment information in the auxiliary context to alleviate the target context’s data sparsity problem and improve recommendation accuracy. A cross-context recommendation strategy based on self-attention-based federated learning (SAFL) is suggested in this work. In contrast to current algorithms, SAFL fully mixes the target and auxiliary background information. Federated learning addresses crucial challenges including data privacy, data security, data access rights, and access to heterogeneous data by allowing several players to develop a single, strong machine learning model without sharing data. To begin, self-attention mechanism is introduced to model the user’s preference information; then, the information from one field is used to improve the recommendation accuracy of another area; and finally, the information from the two contexts is integrated into the knowledge fusion module and the score prediction module to predict the score. Experiments on the Amazon dataset indicate that MAE and MSE values of SAFL are higher when compared to the current cross-context recommendation model, MAE values rose by 8.4%, 13.2%, and 19.4% across three cross-context datasets.

federated learningself-attentioncold startdata sparsity
مقالوصول مفتوح202220استشهاد· Semantic Scholar

Multi-View Clustering Based on Multiple Manifold Regularized Non-Negative Sparse Matrix Factorization

IEEE Access · مجلد 10 · 113249-113259

Clustering of multi-view data has got broad consideration of the researchers. Multi-view data is composed through different domain which shows the consistent and complementary behavior. The existing studies did not draw attention of over-fitting and sparsity among the diverse view, which is the considerable issue for getting the unique consensus knowledge from these complementary data. Herein article, a multi-view clustering approach is recommended to provide the consensus solution from the multi-view data. To accomplish this task, we exploit non-negative matrix factorized method to generate a cost function. Further, manifold learning model is used to build the graph through the nearest neighbor strategy, which is effective to save the geometrical design for data and feature matrix. Furthermore, the over-fitting problem, sparsity is handled through adaption of frobenious norm, and$L_{1}$-norm on basis and coefficient matrices. The whole formulation is done through the mathematical function, which is optimized through the iterative updating strategy to get the optimal solution. The computational experiment is carried on the available datasets to exhibits that the proposed strategy beats the current methodologies in terms of clustering execution.

multi-view clusteringmanifold regularizationconsensus clusteringoverfitting