Partitioning graphs by a graphlet motif.

Partitioning graphs by a graphlet motif.

<p>The union of the subgraph monomorphs in given graphs constitute the subgraph covering for the graphlet. Edges not present in the coverings constitute the non-covering subgraphs.</p>

Saved in:

Bibliographic Details
Main Author:	Bettina Soós (10860933) (author)
Other Authors:	Gonzalo Nápoles (22127303) (author), Pieter Spronck (13717717) (author), Çiçek Güven (8541117) (author)
Published:	2025
Subjects:	Biochemistry Neuroscience Evolutionary Biology Space Science Biological Sciences not elsewhere classified Mathematical Sciences not elsewhere classified Information Systems not elsewhere classified statistical occurrence frequencies model &# 8217 core reasoning behind overly complex subgraphs subgraph coverings correspond objective optimization problem corresponding subgraph patterns identifying relevant subgraphs method outperforms state hence avoiding redundant graphs </ p deemed key properties also contribute meaningfully explainable machine learning possible subgraph space determining graphlet explanations graph prediction tasks machine learning subgraph explanations relevant due hard problem graphlet motifs covering subgraph explanatory subgraphs learning task explanatory subgraph xlink "> study introduces structured data still capturing single motifs resulting motifs rely solely prediction task possible motifs motifs found hoc approach genetic algorithm generating explanations desirable explanations computationally difficult comparing performance building blocks art techniques art methodologies also necessary
Tags:	Add Tag No Tags, Be the first to tag this record!

Cannot write session to /tmp/vufind_sessions/sess_1ab29cb0ner7cf0qhvstg7s1t0