Search Result

1

Neural collaborative filtering recommendation model for de-exposure bias based on fused rewards

基于融合奖励的神经协同过滤去曝光偏差推荐模型

Li Peng

Li Xiaoshan

Zhu Xinru

neural collaborative filtering

linear upper confidence bound

exposure bias

personalized recommendation

No. 1, 2025 : 78-85 doi:10.19734/j.issn.1001-3695.2024.05.0184

2

User-sensitive top-k dominating query method based on upper bound pruning

一种基于上界值剪枝的用户敏感top-k dominating查询方法

Xu Chao

Wu Danqi

Chen Yong

Lei Jintao

incomplete data

top-k dominating query

user sensitivity

weight dominance grade

upper bound value pruning

No. 1, 2023 : 198-203,208 doi:10.19734/j.issn.1001-3695.2022.04.0232

3

Branch and bound algorithm for minimum cost charging station location problem

最小费用充电站选址问题的分支定界算法

Sun Zhiyong

Ning Aibing

Fu Tangyi

Yin Simiao

Zhang Huizhen

charging station location problem

exact algorithm

upper bound algorithm

lower bound algorithm

branch and bound algorithm

No. 1, 2022 : 80-83 doi:10.19734/j.issn.1001-3695.2021.07.0248

4

Backtracking algorithm with reduction for P-center location problem

P-中心选址问题的一种降阶回溯算法

Shang Chunjian

Ning Aibing

Peng Dajiang

Zhang Huizhen

facility location problem

P-center model

reduction algorithm

upper bound

lower bound

backtracking algorithm

No. 3, 2021 : 734-737,769 doi:10.19734/j.issn.1001-3695.2020.04.0057

5

Backtracking algorithm with reduction for node-weighted Steiner tree problem

节点加权的Steiner树问题的降阶回溯算法

Hu Qin

Ning Aibing

Gou Haiwen

Zhang Huizhen

node-weighted Steiner tree(NWST)

upper bound

lower bound

backtracking algorithm

No. 11, 2020 : 3307-3311 doi:10.19734/j.issn.1001-3695.2019.07.0262

Search 上界

Search上界returned 5 results

Neural collaborative filtering recommendation model for de-exposure bias based on fused rewards

User-sensitive top-k dominating query method based on upper bound pruning

Branch and bound algorithm for minimum cost charging station location problem

Backtracking algorithm with reduction for P-center location problem

Backtracking algorithm with reduction for node-weighted Steiner tree problem