Preference relations based unsupervised rank aggregation for metasearch
Rank aggregation mechanisms have been used in solving problems from various domains
such as bioinformatics, natural language processing, information retrieval, etc. Metasearch …
such as bioinformatics, natural language processing, information retrieval, etc. Metasearch …
An efficient top-k ranking method for service selection based on ε-ADMOPSO algorithm
W Yu, S Li, X Tang, K Wang - Neural Computing and Applications, 2019 - Springer
One of the main concerns in rank aggregation tasks for metasearch service is how to retrieve
and aggregate the large-scale candidate search results efficiently. Much work has been …
and aggregate the large-scale candidate search results efficiently. Much work has been …
融合内容与矩阵分解的混合推荐算法.
王永贵， 陈玉伟 - Application Research of Computers …, 2020 - search.ebscohost.com
传统基于内容的推荐算法往往具有较低的准确性, 而协同过滤推荐算法中普遍存在数据稀缺性和
项目冷启动问题. 为解决上述问题, 提出了一种融合内容与协同矩阵分解技术的混合推荐算法 …
项目冷启动问题. 为解决上述问题, 提出了一种融合内容与协同矩阵分解技术的混合推荐算法 …
Effective Learning to Rank for the Persian Web Content
AH Keyhanipour - Journal of Information Technology Management, 2019 - jitm.ut.ac.ir
Persian language is one of the most widely used languages in the Web environment.
Hence, the Persian Web includes invaluable information that is required to be retrieved …
Hence, the Persian Web includes invaluable information that is required to be retrieved …