Zobrazeno 1 - 10 of 32 pro vyhledávání: '"graphes orientés"'
1
Classification non supervisée de graphes orientés : faut-il distinguer les nœuds origines des nœuds terminaux ?
Autor: Keribin, Christine
Publikováno v: Journal de la Société Française de Statistique
Journal de la Société Française de Statistique, Société Française de Statistique et Société Mathématique de France, 2021, 162 (1), pp.24
Journal de la Société Française de Statistique, 2021, 162 (1), pp.24
International audience; When clustering the nodes of a graph, a unique partition of the nodes is usually built, either the graph is undirected or directed. While this choice is pertinent for undirected graphs, it should be discussed for directed grap
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8c2637c0efbadb74a53aaf451516b338
https://hal.inria.fr/hal-03139333
Zobrazit plný text záznamu
2
Cluster or co-cluster the nodes of oriented graphs?
Autor: Keribin, Christine
When clustering the nodes of a graph, a unique partition of the nodes is usually built, either the graph is undirected or directed. While this choice is pertinent for undirected graphs, it should be discussed for directed graphs because it implies th
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______212::8fb17f88819c5b1cbf4aa9a4f14a59a5
https://hal.inria.fr/hal-03139333
Zobrazit plný text záznamu
3
Communities in directed graphs: Finding directed community structures using triads
Autor: Gamgne Domgue, Félicité, Norbert, Tsopze, Ndoundam, René
Community detection in directed networks appears as one of the most relevant topics in the field of network analysis. One common theme in some formalizations is that flows should tend to stay within communities and could be centered round core nodes
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2dda2925b4fef88c84f60bfd5024b47f
https://hal.archives-ouvertes.fr/hal-01849601v2/file/papier_gamgne_arima19.pdf
Zobrazit plný text záznamu
4
Acyclic partitioning of large directed acyclic graphs
Autor: Herrmann, Julien, Yusuf Özkaya, M, Uçar, Bora, Kaya, Kamer, Çatalyürek, Ümit
Publikováno v: [Research Report] RR-9163, Inria-Research Centre Grenoble – Rhône-Alpes. 2018
We investigate the problem of partitioning the vertices of a directed acyclic graph into a given number of parts. The objective function is to minimize the number or the total weight of the edges having end points in different parts, which is also kn
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______2592::bc9b389b2d72e71833eafeac925e2e73
https://hal.inria.fr/hal-01744603/document
Zobrazit plný text záznamu
5
Inference of directed regulatory networks on the transcription factors of Arabidopsis thaliana and setting up of co-regulation groups
Autor: Vasseur, Yann
Publikováno v: Statistiques [math.ST]. Université Paris-Saclay, 2017. Français. ⟨NNT : 2017SACLS475⟩
Méthodologie [stat.ME]. Université Paris Saclay; Laboratoire Select INRIA, 2017. Français
This thesis deals with the characterisation of key genes in gene expression regulation, called transcription factors, in the plant Arabidopsis thaliana. Using expression data, our biological goal is to cluster transcription factors in groups of co-re
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0b1eb9b6a0e12a9503637372a6dd183d
https://tel.archives-ouvertes.fr/tel-01688715
Zobrazit plný text záznamu
6
Partitionnement acyclique de grands graphes acycliques orientés
Autor: Ümit V. Çatalyürek, Bora Uçar, Kamer Kaya, Julien Herrmann, Jonathan Kho
Publikováno v: [Research Report] RR-9163, Inria-Research Centre Grenoble – Rhône-Alpes. 2018
CCGrid '17 Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing
CCGRID 2017-17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing
CCGRID 2017-17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, May 2017, Madrid, Spain. pp.371-380, ⟨10.1109/CCGRID.2017.101⟩
CCGrid
We investigate the problem of partitioning the vertices of a directed acyclic graph into a given number of parts. The objective function is to minimize the number or the total weight of the edges having end points in different parts, which is also kn
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5c3d1cdba5b3b5495322755d493ad63
Zobrazit plný text záznamu
7
Formal concepts based communities detection in directed networks
Autor: Tsopze, Norbert, Félicité, Gamgne Domgue
Community detection in directed networks appears as one of dominant research works in network analysis. Most existing models for community detection are symmetric, in which incom-ming and outgoing links are treated equally. In this paper, we propose
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______212::ed7234f9bb17bca8c03ac6d91776af9e
https://hal.archives-ouvertes.fr/hal-01308690/file/tsopze_etal_2016.pdf
Zobrazit plný text záznamu
8
Détection des communautés dans les réseaux orientés à l'aide des concepts formels
Autor: Tsopze, Norbert, Félicité, Gamgne Domgue
Community detection in directed networks appears as one of dominant research works in network analysis. Most existing models for community detection are symmetric, in which incom-ming and outgoing links are treated equally. In this paper, we propose
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______2592::ed7234f9bb17bca8c03ac6d91776af9e
https://hal.archives-ouvertes.fr/hal-01308690/file/tsopze_etal_2016.pdf
Zobrazit plný text záznamu
9
Des graphes orientés aux treillis complets : une nouvelle approche de l'ordre faible sur les goupes de Coxeter
Autor: Viard , François
Publikováno v: Théorie des groupes [math.GR]. Université Claude Bernard-Lyon I, 2015. Français. ⟨NNT : 2015LYO10232⟩
Théorie des groupes [math.GR]. Université Claude Bernard-Lyon I, 2015. Français. 〈NNT : 2015LYO10232〉
Weak order on a Coxeter group W is a partial order on W appearing in many areas of algebraic combinatorics. In this thesis, we propose a new general model for the study of the weak order and other related partially ordered sets (also called “posets
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f72260c1a98083f4eaadd2718ebb63a0
https://theses.hal.science/tel-01619363
Zobrazit plný text záznamu
10
Subdivisions of digraphs
Autor: Maia de Oliviera, Ana Karolinna
Publikováno v: Other [cs.OH]. Université Nice Sophia Antipolis, 2014. English. ⟨NNT : 2014NICE4084⟩
In this work, we consider the following problem: Given a directed graph D, does it contain a subdivision of a prescribed digraph F? We believe that there is a dichotomy between NP-complete and polynomial-time solvable instances of this problem. We pr
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a17dcf9231e6d173f28ae63d8743014e
https://tel.archives-ouvertes.fr/tel-01127012/document
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje