Re-revisiting learning on hypergraphs: confidence interval and subgradient method

C Zhang, S Hu, ZG Tang… - … Conference on Machine …, 2017 - proceedings.mlr.press
We revisit semi-supervised learning on hypergraphs. Same as previous approaches, our
method uses a convex program whose objective function is not everywhere differentiable …

Re-revisiting learning on hypergraphs: Confidence interval, subgradient method, and extension to multiclass

C Zhang, S Hu, ZG Tang… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
We revisit semi-supervised learning on hypergraphs. Same as previous approaches, our
method uses a convex program whose objective function is not everywhere differentiable …

[PDF][PDF] Algebras of finitary relations

VP Tsvetov - CEUR Workshop Proceedings, 2019 - researchgate.net
Algebras of finitary relations naturally generalize the algebra of binary relations with the left
composition. In this paper, we consider some properties of such algebras. It is well known …

[PDF][PDF] FACULTAD DE CIENCIAS E INGENIERÍA

EEFP Trevejo - 2022 - core.ac.uk
Los chatbots son sistemas de procesamiento de lenguaje natural con los que se puede
interactuar mediante una interfaz de texto o voz, y han sido adoptados en muchas industrias …

Hypernode Graphs for Learning from Binary Relations between Groups in Networks

T Ricatte, R Gilleron, M Tommasi - 2015 - inria.hal.science
The aim of this paper is to propose methods for learning from interactions between groups in
networks. We propose a proper extension of graphs, called hypernode graphs as a formal …

Алгебры n-местных отношений

ВП Цветов - СБОРНИК ТРУДОВ ИТНТ-2019, 2019 - elibrary.ru
Алгебры n-местных отношений являются естественным обобщением алгебры
бинарных отношений с операциями пересечения, объединения, композиции и взятия …