课题基金 / 基金详情

CAREER: Timely Insights: Interpretable, Multi-scale Summarization of Networks over Time

CAREER: Timely Insights: Interpretable, Multi-scale Summarization of Networks over Time
职业:及时的见解:随时间推移对网络进行可解释、多尺度的总结
批准号:
1845491
负责人:
Danai Koutra
金额:
$55.54万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2019
资助国家:
美国
项目状态:
未结题
起止时间:
2019-05-01 至 2025-04-30

项目摘要

项目成果

Danai Koutra的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
Evolving network data occur in almost all disciplines. For example, knowledge or facts are often structured into knowledge graphs, brain activity is represented via functional networks, and neural networks can be seen as evolving graph structures. This project aims to develop computational methods and models to summarize, explain, and provide insights into massive data (and their underlying dynamic processes) at multiple scales in a broad range of domains. Focusing on knowledge graphs makes it possible to achieve on-device and privacy-preserving analytics (e.g., on intelligent assistants). Modeling neural networks is expected to give insights into their interpretability and reduce their massive training computational cost. Through collaborations with experts in neuroscience, this research will contribute to decoding the brain, with a potential impact on mental development and disease detection. A significant part of this project is a plan for integrating research with education. Its overarching theme is to increase diversity in computer and data science, and engage students in graph mining research and its real-life applications via: introducing undergraduate and graduate data mining classes; mentoring students on data science projects for social good; organizing a workshop to attract undergraduates from diverse backgrounds to graduate school; and organizing a high-school data science summer camp centered around social media and networks, a theme that is a successful introduction to network science.Network summarization, which identifies structure and meaning in large-scale data, so far has mostly focused on non-complex, static data. This project aims to bridge the gap between network summarization research and real-world problems by introducing novel problem formulations in summarization (including for tasks that have not been previously viewed as graph problems) as well as theoretical analyses, unifying theories, and a suite of new, interpretable methods and scalable algorithms. It pursues three research tasks related to network evolution at different scales. At the network scale, the first task focuses on efficient, supervised or semi-supervised summarization of evolving and semantically-rich graph data (e.g., heterogeneous). At the multi-network scale, the second task introduces interpretable methods for modeling and understanding collections of evolving networks and their joint underlying physical processes, which is an under-studied problem in data mining. Via academic and industrial collaborations, the third task explores new applications in knowledge graphs, neuroscience, deep neural networks, and social sciences. The project is expected to advance the foundations of exploratory analysis of evolving data. Its outcomes will be disseminated through publications, tutorials, workshops, as well as open-source tools, code and datasets.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(43)
专著(0)
科研奖励(0)
会议论文
DOI: --
发表时间: 2023
期刊: IEEE Data Eng. Bull.
影响因子: --
作者: [Jiong Zhu;Yujun Yan;Mark Heimann;Lingxiao Zhao;L. Akoglu;Danai Koutra]
通讯作者: Jiong Zhu;Yujun Yan;Mark Heimann;Lingxiao Zhao;L. Akoglu;Danai Koutra
DOI: 10.1609/aaai.v37i4.25621
发表时间: 2023-06
期刊:
影响因子: --
作者: [Houquan Zhou;Shenghua Liu;Danai Koutra;Huawei Shen;Xueqi Cheng]
通讯作者: Houquan Zhou;Shenghua Liu;Danai Koutra;Huawei Shen;Xueqi Cheng
DOI: 10.1145/3397191
发表时间: 2020-08-01
期刊: ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA
影响因子: 3.6
作者: [Rossi, Ryan A., Jin, Di, Lee, John Boaz]
通讯作者: Lee, John Boaz
SpecGreedy: Unified Dense Subgraph Detection
SpecGreedy:统一密集子图检测
DOI: 10.1007/978-3-030-67658-2
发表时间: 2020
期刊: Machine Learning and Knowledge Discovery in Databases - European Conference (ECML/PKDD
影响因子: --
作者: [Feng, Wenjie, Liu, Shenghua, Koutra, Danai, Shen, Huawei, Cheng, Xueqi]
通讯作者: Cheng, Xueqi
37
    Collaborative Research: III: Medium: Graph Neural Networks for Heterophilous Data: Advancing the Theory, Models, and Applications
    EAGER: Collaborative Research: Correspondence Discovery in Disparate Networks
    海外基金