no code implementations • 28 Jul 2021 • Tiphaine Viard, Henry Soldano, Guillaume Santini
After recalling and extending notions from formal concept analysis on graphs to stream graphs, we introduce algorithms to enumerate closed patterns on a labeled stream graph, and introduce a way to select relevant closed patterns.
no code implementations • 21 Jan 2020 • Tiphaine Viard, Thomas McLachlan, Hamidreza Ghader, Satoshi Sekine
Wikipedia is a huge opportunity for machine learning, being the largest semi-structured base of knowledge available.
1 code implementation • 11 Oct 2017 • Matthieu Latapy, Tiphaine Viard, Clémence Magnien
It is also consistent with graph theory: graph concepts are special cases of the ones we introduce.