Several `edge-discovery' applications over graph-based data models are known to have worst-case quadratic time complexity in the nodes, even if the discovered edges are sparse. One example is the generic link discovery problem between two graphs, which has invited research interest in several communities. Specific versions of this problem include link prediction in social networks, ontology alignment between metadata-rich RDF data, approximate joins, and entity resolution between instance-rich data. As large datasets continue to proliferate, reducing quadratic complexity to make the task practical is an important research problem. Within the entity resolution community, the problem is commonly referred to as blocking. A particular class of learnable blocking schemes is known as Disjunctive Normal Form (DNF) blocking schemes, and has emerged as state-of-the art for homogeneous (i.e. same-schema) tabular data. Despite the promise of these schemes, a formalism or learning framework has not been developed for them when input data instances are generic, attributed graphs possessing both node and edge heterogeneity. With such a development, the complexity-reducing scope of DNF schemes becomes applicable to a variety of problems, including entity resolution and type alignment between heterogeneous graphs, and link prediction in networks represented as attributed graphs. This paper presents a graph-theoretic formalism for DNF schemes, and investigates their learnability in an optimization framework. We also briefly describe an empirical case study encapsulating some of the principles in this paper.
A Scalable Trust Discovery Architecture for the Internet of Agents
China Internet Network Information Center(中国互联网络信息中心);Alibaba Cloud Intelligence Group(阿里云智能集团);National Engineering Laboratory of Internet Domain Name Management Technology(互联网域名管理技术国家工程实验室);Computer Network Information Center, Chinese Academy of Sciences(中国科学院计算机网络信息中心)
Scalable Causal Discovery from Recursive Nonlinear Data via Truncated Basis Function Scores and Tests
Department of Philosophy(哲学系);Carnegie Mellon University(卡内基梅隆大学);Department of Psychiatry & Behavioral Sciences(精神病学与行为科学系);University of Minnesota(明尼苏达大学)
ARCADIA: Scalable Causal Discovery for Corporate Bankruptcy Analysis Using Agentic AI
Department of Economics, Statistics and Business, Universitas Mercatorum, Rome, Italy(经济学、统计学与商业系,墨菲大学,罗马,意大利);Department of Engineering and Science, Universitas Mercatorum, Rome, Italy(工程与科学系,墨菲大学,罗马,意大利);Independent Researcher, Bucharest, Romania(独立研究者,布加勒斯特,罗马尼亚)
CausaLab: A Scalable Environment for Interactive Causal Discovery Toward AI Scientists
Tsinghua University(清华大学);University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Carnegie Mellon University(卡内基梅隆大学);University of Chicago(芝加哥大学);Adobe
Scalable Quantum State Preparation via Large-Language-Model-Driven Discovery
School of Physics, Peking University(北京大学物理学院);Center for High Energy Physics, Peking University(北京大学高能物理中心);Institute of High Energy Physics, Chinese Academy of Sciences(中国科学院高能物理研究所);Center of Advanced Quantum Studies, School of Physics and Astronomy, Beijing Normal University(北京师范大学物理天文学院先进量子研究中心);Key Laboratory of Multi-scale Spin Physics, Ministry of Education, Beijing Normal University(北京师范大学教育部多尺度自旋物理重点实验室)
Weakly Supervised Spatio-Temporal Candidate Discovery of Dairy Farm Sites from Seasonal Satellite Imagery
School of Computer Science, University of Galway(戈尔韦大学计算机科学学院);Faculty of Computer Science and Engineering, GIK Institute of Engineering Sciences and Technology(工程科学与技术GIK学院计算机科学与工程系)
Steering an Active Learning Workflow Towards Novel Materials Discovery via Queue Prioritization
1 Department of Computer Science, University of Chicago;2 Data Science \& Learning Division, Argonne National Laboratory;3 Department of Civil, Materials;Environmental Engineering, University of Illinois at Chicago