学术报告
当前位置: 首页 >> 学院新闻 >> 学术报告 >> 正文
报告题目:Mining in Online Social Networks: Dynamic Sampling and Adaptive Learning
发布日期:2017-11-24  来源:杨继盛   查看次数:
 

报告人:My T. Thai

工作单位:美国佛罗里达大学

报告时间:2017年11月27日(星期一)9:00

报告地点:管理学院三楼 第三报告厅

 

报告人简介

Dr. My T. Thai is an UF Research Foundation Professor and Associate Chair for Research in the Department of Computer and Information Sciences and Engineering at the University of Florida. She received her PhD degree in Computer Science from the University of Minnesota in 2005. Her current research interests include algorithms, cybersecurity, and optimization on network science and engineering, including communication networks, smart grids, social networks, and their interdependency. The results of her work have led to 5 books and 120+ articles published in leading journals and conferences on networking and combinatorics.

报告简介

With billions of active users, Online Social Networks (OSNs) have become critical platforms for marketing and advertising. At the same time, OSNs are also a fruitful soil for criminals to harvest billions of users’ personal information. With such a big and incomplete data, it becomes very challenging to mine the OSNs. In this talk, I address the above problems via two primary approaches: 1) Develop novel dynamic sampling techniques with the performance bound guarantee to exactly perform the big data mining in large-scale networks with billions nodes; and 2) Develop active learning methods via adaptive stochastic optimization to best enhance the incomplete network within budget constraints. To confirm the practical uses of these mathematical techniques, we apply them to solving many real-world problems, mainly focused on the network security such as social-bot detection, misinformation spreading, and privacy leakage.

 

上一条:报告题目:政府网站——定位、评估与内容挖掘
下一条:报告题目:大规模组合优化的在航空运营管理中应用及研究

【关闭】