Igraph
Материал из Letopisi.Ru — «Время вернуться домой»
(Различия между версиями)
(Новая страница: «Пакет, предназначенный для работы с данными и представлениями сетевых отношений. Подроб…») |
|||
| Строка 4: | Строка 4: | ||
** http://kateto.net/networks-r-igraph | ** http://kateto.net/networks-r-igraph | ||
| + | |||
| + | === Объединение узлов === | ||
| + | The function contract.vertices() merges several vertices into one. By computing the community structure, one can control how this merging happens. At conclusion of the contraction, two vertices can have multiple edges. | ||
| + | |||
| + | |||
| + | === Объединение связей === | ||
| + | The equivalent step for edges is simplify(). A simplified graph contains only a single edge between two nodes. The simplification step can compute summary statistics for the combined edges, for example the sum of edge weights. | ||
| + | |||
| + | |||
| + | === Разные способы определения сообществ === | ||
| + | |||
| + | ; What are the differences between community detection algorithms in igraph? | ||
| + | : http://stackoverflow.com/questions/9471906/what-are-the-differences-between-community-detection-algorithms-in-igraph/9478989#9478989 | ||
| + | |||
| + | ; Finding clusters of CRAN packages using igraph | ||
| + | : http://blog.revolutionanalytics.com/2014/12/finding-clusters-of-cran-packages-using-igraph.html | ||
| + | |||
| + | |||
| + | ---- | ||
[[Категория:R]] | [[Категория:R]] | ||
[[Категория:Сеть]] | [[Категория:Сеть]] | ||
Версия 22:00, 19 февраля 2016
Пакет, предназначенный для работы с данными и представлениями сетевых отношений. Подробная документация:
- Network Analysis and Visualization with R and igraph
Объединение узлов
The function contract.vertices() merges several vertices into one. By computing the community structure, one can control how this merging happens. At conclusion of the contraction, two vertices can have multiple edges.
Объединение связей
The equivalent step for edges is simplify(). A simplified graph contains only a single edge between two nodes. The simplification step can compute summary statistics for the combined edges, for example the sum of edge weights.
Разные способы определения сообществ
- What are the differences between community detection algorithms in igraph?
- http://stackoverflow.com/questions/9471906/what-are-the-differences-between-community-detection-algorithms-in-igraph/9478989#9478989
- Finding clusters of CRAN packages using igraph
- http://blog.revolutionanalytics.com/2014/12/finding-clusters-of-cran-packages-using-igraph.html
