<yioi class="qbzxcr"></yioi><lvwyn class="ehqcsa"></lvwyn><cuvir class="otvezckq"></cuvir><jvq class="jrpgcwzh"></jvq>

德克薩斯大學達拉斯分校伍偉莉教授學術報告

發布者:陳貝西發布時間:2023-11-01瀏覽次數:231

報告題目:The Art of Big Data: Accomplishments and Research Needs

報告人:伍偉莉教授

報告時間2023114 10:50

報告地點:卓越樓810

報告摘要Online social platforms have become more and more popular, and the dissemination of information on social networks has attracted wide attention of the industries and academia. Aiming at selecting a small subset of nodes with maximum influence on networks, the Influence Maximization (IM) problem has been extensively studied. Since it is #P-hard to compute the influence spread given a seed set, the state-of-art methods, including heuristic and approximation algorithms, faced with great difficulties such as theoretical guarantee, time efficiency, generalization, etc. This makes it unable to adapt to large-scale networks and more complex applications. With the latest achievements of Deep Reinforcement Learning (DRL) in artificial intelligence and other fields, a lot of works has focused on exploiting DRL to solve the combinatorial optimization problems. Inspired by this, we propose a novel end-to-end DRL framework, ToupleGDD, to address the IM problem which incorporates three coupled graph neural networks for network embedding and double deep Q-networks for parameters learning. Previous efforts to solve the IM problem with DRL trained their models on the subgraph of the whole network, and then tested their performance on the whole graph, which makes the performance of their models unstable among different networks. However, our model is trained on several small randomly generated graphs and tested on completely different networks,  and can obtain results that are very close to the state-of-the-art methods. In addition, our model is trained with a small budget, and it can perform well under various large budgets in the test, showing strong generalization ability. Finally, we conduct extensive experiments on synthetic and realistic datasets, and the experimental results prove the effectiveness and superiority of our model.

 

報告人簡介:Dr. Weili (Lily) Wu received her MS and PhD degrees in computer science both from University of Minnesota, in 1998 and 2002 respectively. She is currently a full professor and a lab director of the Data Communication and Data Management (DCDM) Laboratory at the Department of Computer Science and Engineering, the University of Texas at Dallas. Her research interest is mainly in Big Data, Social Network, Blockchain Technology, wireless sensor network, IoT, Data Mining.  She has published more than 230 journal papers and 102 conference papers in various prestigious journals and conferences such as IEEE/ACM Transactions on Networking, IEEE Trans. Netw. Sci. Eng., Comput. Social Systems, IoT Journal, ACM Transactions on Knowledge Discovery in Data, IEEE Trans. Reliability, IEEE TKDE, Multimedia, ACM Transaction on Sensor Networks (TOSN), IEEE Trans. Netw. Serv. Manag., Wirel. Commun., Mob. Comput., Parallel Distrib. Syst., IEEE ICDCS, INFOCOM, ACM SIGKDD, etc. I’m an associate editor of IJBRA, Computational Social Networks (CSN), SOP Transactions on Wireless Communications (STOWC), DMAA, Journal of Combinatorial Optimization (JOCO), and Journal of Global Optimization (JOGO). 


返回原圖
/

 

必一体育专业提供:必一体育必一必一体育平台等服务,提供最新官网平台、地址、注册、登陆、登录、入口、全站、网站、网页、网址、娱乐、手机版、app、下载、欧洲杯、欧冠、nba、世界杯、英超等,界面美观优质完美,安全稳定,服务一流,必一体育欢迎您。 必一体育官網xml地圖