Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Hibshman, Justus Isaiah"'
Real-world data is typically a noisy manifestation of a core pattern (schema), and the purpose of data mining algorithms is to uncover that pattern, thereby splitting (i.e. decomposing) the data into schema and noise. We introduce SCHENO, a principle
Externí odkaz:
http://arxiv.org/abs/2404.13489
Autor:
Cedre, Daniel Gonzalez, Hibshman, Justus Isaiah, La Fond, Timothy, Boquet, Grant, Weninger, Tim
Context-free graph grammars have shown a remarkable ability to model structures in real-world relational data. However, graph grammars lack the ability to capture time-changing phenomena since the left-to-right transitions of a production rule do not
Externí odkaz:
http://arxiv.org/abs/2303.11553
Autor:
Hibshman, Justus Isaiah
Given any two graphs on the same vertex set, $G_1 = (V, E_1)$ and $G_2 = (V, E_2)$, along with the difference between the two graphs $\Delta = (E_1 \setminus E_2) \cup (E_2 \setminus E_1)$, we prove that the ratio of the sizes of the two graphs' auto
Externí odkaz:
http://arxiv.org/abs/2205.05726