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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on pattern analysis and machine intelligence Ročník 45; číslo 10; s. 11993 - 12003
Hlavní autoři:	Abniki, Ahmad, Beigy, Hamid
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	United States IEEE 01.10.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!