Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Kevin Françoisse"'
Publikováno v:
Physica A: Statistical Mechanics and its Applications, Vol. 590, no.1, p. 126752 (2022)
This work investigates a paths-based statistical physics formalism, inspired from the bag-of-paths framework, for the design of random walks on a graph in which the transition probabilities (the policy) are biased in favor of some node features. More
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bff4eacd79333ebb79b16c9a6aa8188c
https://hdl.handle.net/2078.1/265098
https://hdl.handle.net/2078.1/265098
Publikováno v:
Neural Networks
Neural Networks, Elsevier, 2017, 90, pp.90-111. ⟨10.1016/j.neunet.2017.03.010⟩
Neural Networks, Vol. 90, p. 90-111 (2017)
Neural Networks, Elsevier, 2017, 90, pp.90-111. ⟨10.1016/j.neunet.2017.03.010⟩
Neural Networks, Vol. 90, p. 90-111 (2017)
This work develops a generic framework, called the bag-of-paths (BoP), for link and network data analysis. The central idea is to assign a probability distribution on the set of all paths in a network. More precisely, a Gibbs-Boltzmann distribution i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39be08f7518f6daf79d93090d33cd76e
https://hal.archives-ouvertes.fr/hal-01583972/file/francoissekivimakietal2017bag-of-path.pdf
https://hal.archives-ouvertes.fr/hal-01583972/file/francoissekivimakietal2017bag-of-path.pdf
Publikováno v:
IEEE Transactions on Neural Networks and Learning Systems. 25:1173-1186
This paper introduces a novel and well-founded betweenness measure, called the bag-of-paths (BoP) betweenness, as well as its extension, the BoP group betweenness, to tackle semisupervised classification problems on weighted directed graphs. The obje
Publikováno v:
Pattern Recognition Letters. 34:146-154
This letter investigates a link-analysis variant of discriminant analysis for projecting nodes of a (partially) labeled graph in a low-dimensional subspace and extracting discriminant node features. Basically, it corresponds to a kernel discriminant
Publikováno v:
IEEE Transactions on Pattern Analysis and Machine Intelligence. 32:1112-1126
This work introduces a link-based covariance measure between the nodes of a weighted directed graph, where a cost is associated with each arc. To this end, a probability distribution on the (usually infinite) countable set of paths through the graph
Publikováno v:
Neural networks : the official journal of the International Neural Network Society. 31
This paper presents a survey as well as an empirical comparison and evaluation of seven kernels on graphs and two related similarity matrices, that we globally refer to as ''kernels on graphs'' for simplicity. They are the exponential diffusion kerne
Publikováno v:
Machine Learning and Knowledge Discovery in Databases ISBN: 9783540874782
ECML/PKDD (1)
ECML/PKDD (1)
This paper describes a novel technique, called $\mathcal{D}$-walks, to tackle semi-supervised classification problems in large graphs. We introduce here a betweenness measure based on passage times during random walks of bounded lengths. Such walks a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::443512790b0b6e49839f0de6a76d6842
https://doi.org/10.1007/978-3-540-87479-9_29
https://doi.org/10.1007/978-3-540-87479-9_29
Publikováno v:
IEEE Transactions on Neural Networks & Learning Systems; Jun2014, Vol. 25 Issue 6, p1173-1186, 14p
Autor:
Walter Daelemans, Katharina Morik
This book constitutes the refereed proceedings of the joint conference on Machine Learning and Knowledge Discovery in Databases: ECML PKDD 2008, held in Antwerp, Belgium, in September 2008. The 100 papers presented in two volumes, together with 5 inv