Learning Hidden Graphs From Samples

Several real-world problems, like molecular biology and chemical reactions, have hidden graphs, and we need to learn the hidden graph using edge-detecting samples. In this problem, the learner receives examples explaining whether a set of vertices induces an edge of the hidden graph. This article ex...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on pattern analysis and machine intelligence Vol. 45; no. 10; pp. 11993 - 12003
Main Authors:	Abniki, Ahmad, Beigy, Hamid
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.10.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Adaptation models Apexes Chemical reactions Complexity theory Electron tubes Empirical risk minimization algorithm graph learning Graph theory Graphs hidden graphs Learning Molecular biology Monte Carlo methods nonuniform learning probably approximately correct learning Risk management structural risk minimization algorithm Topology Training Trees (mathematics) VC-dimension Vertex sets
ISSN:	0162-8828, 1939-3539, 2160-9292, 1939-3539
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!