Award Abstract # 2217104
Collaborative Research: PPoSS: Planning: Efficient and Scalable Learning and Management of Distributed Probabilistic Graphs

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: KENT STATE UNIVERSITY
Initial Amendment Date: July 12, 2022
Latest Amendment Date: July 12, 2022
Award Number: 2217104
Award Instrument: Standard Grant
Program Manager: Anindya Banerjee
abanerje@nsf.gov
 (703)292-7885
CCF
 Division of Computing and Communication Foundations
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: October 1, 2022
End Date: September 30, 2025 (Estimated)
Total Intended Award Amount: $101,020.00
Total Awarded Amount to Date: $101,020.00
Funds Obligated to Date: FY 2022 = $101,020.00
History of Investigator:
  • Xiang Lian (Principal Investigator)
    xlian@kent.edu
  • Qiang Guan (Co-Principal Investigator)
Recipient Sponsored Research Office: Kent State University
1500 HORNING RD
KENT
OH  US  44242-0001
(330)672-2070
Sponsor Congressional District: 14
Primary Place of Performance: Kent State University
1300 Lefton Esplanade
Kent
OH  US  44242-0001
Primary Place of Performance
Congressional District:
14
Unique Entity Identifier (UEI): KXNVA7JCC5K6
Parent UEI:
NSF Program(s): PPoSS-PP of Scalable Systems
Primary Program Source: 01002223DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 026Z
Program Element Code(s): 042Y00
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

The advancement of cloud-computing infrastructure and machine-learning algorithms have enabled transformative techniques that push the boundaries of various domains, ranging from automated drug design to natural-language understanding. However, understanding the full software/hardware stack remains a grand challenge for domain experts in developing scalable domain-specific machine-learning models, especially when the application data is of inherently non-relational representations. The project?s novelties are to explore, design, and implement an end-to-end system that delivers efficient and effective management of probabilistic graphs, which can serve as a general data abstraction in a variety of domains (e.g., social network, bioinformatics, sensing and communication, to name a few). The probabilistic graph model not only captures complicated correlations among real-world entities but also quantifies the intensities of correlations or influences among them. The project?s impacts are that it addresses important missing pieces from both theory and system practices to support probabilistic graph management in a systematic, inductive, and verifiable way.

This planning-grant project investigates an end-to-end probabilistic graph management system that promises efficient probabilistic graph learning, representation, aggregation, and analysis with quality guarantees in a scalable distributed setting. The exploration focuses on the full software/hardware stack of probabilistic-graph management, including designing formal probabilistic-graph definition/manipulation abstractions, and the provable compiling process of inductive constraints with guaranteed correctness and efficiency of pipelining execution in a distributed setting. This computing framework can serve as a general-purpose probabilistic-graph analysis tool that benefits different research domains by discovering and understanding the complex correlations among real-world entities in a more comprehensive and transformative way. Besides this advantage, the outcomes of this project, such as open-source software, publications, and workshop tutorials, could benefit data-management research, decision-making processing in general for the industry (sensing-based automatic operations, e.g., auto-piloting, self-driving), and the government (data-driven policymaking, e.g., public health/global trading monitoring). Furthermore, products from this project can be integrated to enrich the curriculum development of undergraduate/graduate-level courses (with course projects related to cloud computing, data management, and machine learning) and therefore train/benefit a rich body of underrepresented students (including minority/female students) at the investigators' institutions.

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.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

Hu, Ming and Zhou, Peiheng and Yue, Zhihao and Ling, Zhiwei and Huang, Yihao and Li, Anran and Liu, Yang and Lian, Xiang and Chen, Mingsong "FedCross: Towards Accurate Federated Learning via Multi-Model Cross-Aggregation" , 2024 https://doi.org/10.1109/ICDE60146.2024.00170 Citation Details
Hu, Zheng and Zheng, Weiguo and Lian, Xiang "Triangular Stability Maximization by Influence Spread over Social Networks" Proceedings of the VLDB Endowment , v.16 , 2023 https://doi.org/10.14778/3611479.3611490 Citation Details
Ye, Y and Lian, X and Chen, M "Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding" Proceedings of the International Conference on Very Large Data Bases , v.17 , 2024 Citation Details
Ye, Yutong and Zhou, Yingbo and Ding, Jiepin and Wang, Ting and Chen, Mingsong and Lian, Xiang "InitLight: Initial Model Generation for Traffic Signal Control Using Adversarial Inverse Reinforcement Learning" IJCAI , 2023 Citation Details

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page