Đang chuẩn bị liên kết để tải về tài liệu:
A highly scalable algorithm for weak rankings aggregation
Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
The proposed methods are experimentally compared with the state-of-the-art greedy algorithms for solving the OBOP by using a large benchmark of real-world databases. Furthermore, we provide a complete statistical analysis of the experimental study, which shows that several of the proposed algorithms outperform the current state-of-the-art greedy algorithms. |