职  称:副教授
研究方向:人工智能、算法设计及其应用
办公电话:
办公地点:信息科学与技术学院427
电子邮件:wangyy912@nenu.edu.cn

个人简历

●基本情况 王艺源,男,副教授,博士生导师,2017年于吉林大学计算机科学与技术学院获得工学博士学位。主要从事人工智能、算法设计及其应用、优化求解等方向研究。2020年获得吉林省青年人才托举计划。主持并参与多项国家自然基金,已发表学术论文30余篇,其中10篇计算机学会推荐A类论文。 现实世界中,优化问题无处不在,欢迎有志于研究海量数据下如何智能求解离散/连续优化问题的研究生加入我们的团队! GOOGLE: https://scholar.google.com/citations?user=NJeMv58AAAAJ DBLP: https://dblp.uni-trier.de/pid/122/9193.html ●教育经历 2007.09-2011.06,吉林大学软件学院,软件工程,学士 2011.09-2014.06,吉林大学计算机科学与技术学院,计算机软件与理论,硕士,导师:欧阳丹彤 2014.09-2017.06,吉林大学计算机科学与技术学院,计算机软件与理论,博士,导师:欧阳丹彤 2015.10-2016.04,德国德累斯顿工业大学,访问学者 ●工作经历 2017.11-2019.11,东北师范大学信息科学与技术学院,师资博士后,导师:殷明浩 2019.11-2020.06,东北师范大学信息科学与技术学院,讲师 2020.06至今,东北师范大学信息科学与技术学院,副教授 2021.09至今,东北师范大学信息科学与技术学院,博士生导师任职资格 ●社会兼职 [1] 201901至今,程序委员会委员(PC Member),IJCAI 2020-2021, AAAI 2020-2022; Senior PC, IJCAI2021 [2] 201907至今,中国计算机学会(CCF)人工智能与模式识别专委会通讯委员 [3] 202007至今,中国计算机学会长春分部委员 [4] 202010至今,中国人工智能学会智能服务专委会委员 ●主持项目 [1] 国家自然科学基金青年项目,“支配集问题的局部搜索算法研究”(61806050),2019/01-2021/12,25万 [2] 吉林省教育厅,“局部搜索算法在集合覆盖问题的研究”(JJKH20190289KJ),2019/01-2020/12,2.5万 [3] 吉林省科学技术协会, “第四批吉林省青年科技人才托举工程”(QT202005),2020/09-2023/12,10万 ●发表论文 [30] Wang Y, Cai S, Chen J, et al. SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem (Extended Abstract)// IJCAI. 2021, accepted. (CCF A类会议,第一作者) [29] Li H, Wang K, Wang Y, Cai S. Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-layer Local Search. CP, 2021, accepted. (CCF B类会议,共同作者) [28] Cai S, Lin J, Wang Y, Strash D. A Semi-exact Algorithm for Quickly Computing a Maximum Weight Clique in Large Sparse Graphs. Journal of Artificial Intelligence Research, 2021, 72: 39-67.(CCF B类, 中科院2区, 共同作者) [27] Zhang X, Li B, Cai S, Wang Y. Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set[J]. Journal of Artificial Intelligence Research, 2021, 71: 89-119.(CCF B类, 中科院2区, 通讯作者) [26] Wang Y, Pan S, Al-Shihabi S, Zhou P, et al. An Improved Configuration Checking-Based Algorithm for the Unicost Set Covering Problem[J]. European Journal of Operational Research, 2021, 294(2), 476-491. (中科院1区,第一作者) [25] Chen J, Cai S, Pan S, Wang Y, et al. NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem//AAAI. 2021, 35(14): 12258-12266. (CCF A类会议,通信作者) [24] Zhou Y, Zhao M, Fan M, Wang Y, et al. An efficient local search for large-scale set-union knapsack problem[J]. Data Technologies and Applications, 2021, 55(2), 233-250. (中科院4区,通信作者) [23] Wang Y, Cai S, Chen J, et al. SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem[J]. Artificial Intelligence, 2020: 103230. (CCF A类,中科院1区,第一作者) [22] Wang Y, Cai S, Pan S, et al. Reduction and Local Search for Weighted Graph Coloring Problem//AAAI. 2020: 218-224. (CCF A类会议,第一作者) [21] Bohan Li, Xindi Zhang, Shaowei Cai, Jinkun Lin, Yiyuan Wang*, Christian Blum: NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set// IJCAI 2020: 1503-1510. (CCF A类会议,通信作者) [20] Shaowei Cai, Wenying Hou, Yiyuan Wang, Chuan Luo, Qingwei Lin: Two-goal Local Search and Inference Rules for Minimum Dominating Set. IJCAI 2020: 1467-1473. (CCF A类会议,共同作者) [19] Wang Y, Pan S, Li C, et al. A Local Search Algorithm with Reinforcement Learning Based Repair Procedure for Minimum Weight Independent Dominating Set[J]. Information Sciences, 2020, 512, 533-548. (CCF B类,中科院1区,第一作者) [18] Wang Y, Li C, Yin M. A two phase removing algorithm for minimum independent dominating set problem[J]. Applied Soft Computing, 2020, 88: 105949. (中科院1区,第一作者) [17] Wang Y, Li C, Sun H, et al. MLQCC: an improved local search algorithm for the set k‐covering problem[J]. International Transactions in Operational Research, 2019, 26(3): 856-887. (SSCI期刊,中科院3区,第一作者) [16] Yuan F, Li C, Gao X, Wang Y*, Yin M. A Novel Hybrid Algorithm for Minimum Total Dominating Set Problem[J]. Mathematics, 2019, 7(3): 222. (中科院2区,通信作者) [15] Jian Gao, Jiejiang Chen, Minghao Yin, Rong Chen, Yiyuan Wang: An Exact Algorithm for Maximum k-Plexes in Massive Graphs. IJCAI 2018: 1449-1455. (CCF A类会议,共同作者) [14] Wang Y, Cai S, Chen J, et al. A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs//IJCAI. 2018: 1514-1522. (CCF A类会议,第一作者) [13] Wang Y, Cai S, Yin M. Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function (Extended Abstract)// IJCAI. 2017: 5090-5094. (CCF A类会议,第一作者) [12]Wang Y, Chen J, Sun H, et al. A memetic algorithm for minimum independent dominating set problem[J]. Neural Computing and Applications, 2018, 30(8): 2519-2529. (CCF C类,中科院2区,第一作者) [11] Wang Y, Cai S, Yin M. New Heuristic Approaches for Maximum Balanced Biclique Problem[J]. Information Sciences, 2018, 432: 362-375. (CCF B类,中科院1区,第一作者) [10] Wang Y, Ouyang D, Yin M, et al. A restart local search algorithm for solving maximum set k-covering problem[J]. Neural Computing and Applications, 2018, 29(10): 755-765. (CCF C类,中科院2区,第一作者) [9] Wang Y, Li R, Zhou Y, et al. A path cost-based GRASP for minimum independent dominating set problem[J]. Neural Computing and Applications, 2017, 28(1): 143-151. (CCF C类,中科院2区,第一作者) [8] Wang Y, Cai S, Yin M. Local Search for Minimum Weight Dominating Set with Two-level Configuration Checking and Frequency based Scoring Function. Journal of Artificial Intelligence Research, 2017, 58: 267-295. (CCF B类,中科院2区,第一作者) [7] Wang Y, Ouyang D, Zhang L, et al. A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity[J]. Science China Information Sciences, 2017, 60(6): 062103. (CCF B类,中科院2区,第一作者) [6] Wang Y, Yin M, Ouyang D, et al. A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem. International Transactions in Operational Research, 2017, 24(6): 1463-1485. (SSCI期刊,中科院3区,第一作者) [5] 王艺源, 欧阳丹彤, 张立明. 结合部件动态变化度求解最小碰集的 GRASP 算法[J]. 吉林大学学报: 工学版, 2017, 47(3): 930-936. (EI期刊,第一作者) [4] Wang Y, Cai S, Yin M. Two Efficient Local Search Algorithms for Maximum Weight Clique Problem//AAAI. 2016: 805-811. (CCF A类会议,第一作者) [3] Wang Y, Ouyang D, Zhang L. Variable quality checking for backbone computation[J]. Electronics Letters, 2016, 52(21): 1769-1771. (中科院4区,第一作者) [2] Wang Y, Ouyang D, Zhang L. Improved Algorithm of Unsatisfiability-based Maximum Satisfiability[C]//IWOST-1. 2015: 93-103. (EI会议,第一作者) [1] 王艺源, 欧阳丹彤, 张立明, 等. 利用 CSP 求解极小碰集的方法[J]. 计算机研究与发展, 2015, 52(3): 588-595. (CCF中文 A类,一级学报,第一作者) ●讲授课程 [1] 运筹学 [2] 离散数学 [3] 平面数字图像设计 [4] 可计算性与计算复杂性 [5] 自动推理与智能规划 [6] 计算机理论 [7] 智能规划与规划识别

社会兼职

获奖情况 (数据来源:科学技术处、社会科学处)

教学信息 (数据来源:教务处)

科研信息 (数据来源:科学技术处、社会科学处)

  • 项目:
  • 1. 第四批吉林省青年科技人才托举工程(QT202005),2020年
  • 2. 局部搜索算法在集合覆盖问题的研究,2018年
  • 3. 支配集问题的局部搜索算法研究,2018年
  • 论文:
  • 1. NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem,The Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI-21),2021年
  • 2. Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set,J ARTIF INTELL RES,2021年
  • 3. An efficient local search for large-scale set-union knapsack problem,DATA TECHNOLOGIES AND APPLICATIONS,2021年
  • 4. NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set,Proceeding of the Twenty-Ninth International Joint Conference on Artificial Intelligence(IJCAI-20),2020年
  • 5. NuMWVC: A novel local search for minimum weighted vertex cover problem(SSCI),JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY,2020年
  • 6. A two phase removing algorithm for minimum independent dominating set problem,APPL SOFT COMPUT,2020年
  • 7. SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem,ARTIF INTELL,2020年
  • 8. A local search algorithm with reinforcement learning based repair procedure for minimum weight independent dominating set,INFORM SCIENCES,2020年
  • 9. Reduction and Local Search for Weighted Graph Coloring Problem,The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20),2020年
  • 10. Multi-Objective Neighborhood Search Algorithm Based on Decomposition for Multi-Objective Minimum Weighted Vertex Cover Problem(SSCI),SUSTAINABILITY,2019年
  • 11. MLQCC: an improved local search algorithm for the set k-covering problem(SSCI),International Transactions in Operational Research,2019年
  • 12. MLQCC:an improved local search algorithm for the set k-covering problem,INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH,2019年
  • 13. A Novel Hybrid Algorithm for Minimum Total Dominating Set Problem,MATHEMATICS,2019年
  • 14. An improved memetic algorithm for the partial vertex cover problem,IEEE ACCESS,2019年
  • 15. A memetic algorithm for minimum independent dominating set problem,NEURAL COMPUT APPL,2018年
  • 16. An Exact Algorithm for Maximum k-Plexes in Massive Graphs,Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-18),2018年
  • 17. A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs,Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-18),2018年
  • 18. New heuristic approaches for maximum balanced biclique problem,INFORM SCIENCES,2018年
  • 19. A restart local search algorithm for solving maximum set k-covering problem,NEURAL COMPUT APPL,2018年
  • 20. A path cost-based GRASP for minimum independent dominating set problem,NEURAL COMPUT APPL,2017年
  • 21. A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem(SSCI),INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH,2017年
  • 22. A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem,INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH,2017年
信息维护