课题基金 / 基金详情

BIGDATA: F: Collaborative Research: Taming Big Networks via Embedding

BIGDATA: F: Collaborative Research: Taming Big Networks via Embedding
BIGDATA:F:协作研究:通过嵌入驯服大网络
批准号:
1855099
负责人:
Quanquan Gu
金额:
$49.99万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2018
资助国家:
美国
项目状态:
已结题
起止时间:
2018-07-01 至 2022-12-31

项目摘要

项目成果

Quanquan Gu的其他基金

相似基金

相关文献

中文摘要
翻译
在互联网时代,信息实体和信息对象相互联系,形成了巨大的信息网络。最近,网络嵌入方法创建低维特征表示,保留原始空间中数据点的结构,已被证明对网络上的许多数据挖掘和机器学习问题非常有益。尽管研究取得了重大进展,但我们仍然缺乏强大的网络嵌入技术和理论保证来有效地处理海量、异构、复杂和动态的网络。pi的目标是开发新一代的网络嵌入方法来分析海量网络。该研究项目具有显著改变图挖掘和网络分析的潜力。pi还计划开发集成信息网络分析和机器学习的开放课程材料和开源软件工具。该项目由四个协同研究重点组成。首先,它开发了基于模型的网络嵌入,以利用网络的一阶和二阶接近性。其次,它设计了一系列能够利用链接信息和侧信息的归纳网络嵌入方法。第三,开发了基于局部聚类和深度学习的网络嵌入方法,以解决局部性和非线性等复杂网络结构问题。第四,针对不同的网络嵌入方法,开发了在线和随机优化算法,以应对现代海量网络的快速增长和演变。在这个项目中开发的新方法在优化方面具有更快的收敛速度,更低的计算复杂性和统计学习保证。目标应用包括但不限于社会/信息网络分析中的语义搜索和信息检索、书目数据库中的专家查找和推荐系统。
英文摘要
In the Internet Age, information entities and objects are interconnected, thereby forming gigantic information networks. Recently, network embedding methods, that create low-dimensional feature representations that preserve the structure of data points in their original space, have been shown to be greatly beneficial for many data mining and machine learning problems over networks. Despite significant research progress, we are still lacking powerful network embedding techniques with theoretical guarantees to effectively deal with massive, heterogeneous, complex and dynamic networks. The PIs aim to develop a new generation of network embedding methods for analyzing massive networks. The research project has the potential to significantly transform graph mining and network analysis. The PIs also plan to develop open course materials and open source software tools that integrate information network analysis and machine learning. This project consists of four synergistic research thrusts. First, it develops model-based network embedding to leverage the first-order and second-order proximity of networks. Second, it devises a family of inductive network embedding methods that are able to leverage both linkage information and side information. Third, it develops both local clustering and deep learning based network embedding methods to attack the complex structure of networks such as locality and non-linearity. Fourth, it develops online and stochastic optimization algorithms for different network embedding methods to tackle the fast growth and evolution of modern massive networks. The new methods developed in this project enjoy faster rates of convergence in optimization, lower computational complexities, and statistical learning guarantees. The targeted applications include but are not limited to semantic search and information retrieval in social/information network analysis, expert finding in bibliographical database, and recommendation systems.
期刊论文(23)
专著(0)
科研奖励(0)
会议论文
DOI: --
发表时间: 2020-03
期刊: ArXiv
影响因子: --
作者: [Difan Zou;Philip M. Long;Quanquan Gu]
通讯作者: Difan Zou;Philip M. Long;Quanquan Gu
Nearly Minimax Optimal Reinforcement Learning for Discounted MDPs
贴现 MDP 的近极小极大最优强化学习
DOI: --
发表时间: 2021
期刊: Advances in neural information processing systems
影响因子: --
作者: [He, Jiafan, Zhou, Dongruo, Gu, Quanquan]
通讯作者: Gu, Quanquan
DOI: 10.1007/s10994-019-05839-6
发表时间: 2019-10-23
期刊: MACHINE LEARNING
影响因子: 7.5
作者: [Zou, Difan, Cao, Yuan, Gu, Quanquan]
通讯作者: Gu, Quanquan
Self-training Converts Weak Learners to Strong Learners in Mixture Models
自我训练将混合模型中的弱学习者转变为强学习者
DOI: --
发表时间: 2022
期刊: International Conference on Artificial Intelligence and Statistics
影响因子: --
作者: [Frei, Spencer, Zou, Difan, Chen, Zixiang, Gu, Quanquan]
通讯作者: Gu, Quanquan
22
    Collaborative Research: Towards the Foundation of Approximate Sampling-Based Exploration in Sequential Decision Making
    CPS: Medium: Collaborative Research: Provably Safe and Robust Multi-Agent Reinforcement Learning with Applications in Urban Air Mobility
    III: Small: Towards the Foundations of Training Deep Neural Networks: New Theory and Algorithms
    CIF: Small: Collaborative Research: Rank Aggregation with Heterogeneous Information Sources: Efficient Algorithms and Fundamental Limits
    海外基金