ig.degree.betweenness
Smith-Pittman Community Detection Algorithm for 'igraph' Objects with R
Science Score: 36.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
○CITATION.cff file
-
✓codemeta.json file
Found codemeta.json file -
✓.zenodo.json file
Found .zenodo.json file -
○DOI references
-
✓Academic publication links
Links to: arxiv.org -
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (11.9%) to scientific vocabulary
Keywords
Repository
Smith-Pittman Community Detection Algorithm for 'igraph' Objects with R
Basic Info
- Host: GitHub
- Owner: benyamindsmith
- License: other
- Language: R
- Default Branch: main
- Homepage: https://arxiv.org/abs/2411.01394
- Size: 8.56 MB
Statistics
- Stars: 39
- Watchers: 1
- Forks: 1
- Open Issues: 2
- Releases: 0
Topics
Metadata Files
README.md
ig.degree.betweenness 
An R package for the implementation of the "Smith-Pittman" (2024) community detection algorithm. Also known as the node degree+edge betweenness algorithm. Compatible with the igraph ecosystem.
- For the Python implementation, see
ig_degree_betweenness_py. - For the C implementation, see
ig_degree_betweenness_c
Installing this package
To install the stable release of this package from CRAN run:
r
install.packages("ig.degree.betweenness")
To install the development version of this package run:
```r
install.packages("devtools")
devtools::install_github("benyamindsmith/ig.degree.betweenness") ```
Sample Usage
Applying the node degree+edge betweenness algorithm can be done by making use of the cluster_degree_betweenness().
An example of using the code is:
```r library(igraphdata) library(ig.degree.betweenness)
data("karate")
sp <- clusterdegreebetweenness(karate) plot( sp, karate, main= "Node degree+edge betweenness clustering" ) ```
Limitations
The present limitations of using this algorithm is that graphs are required to be labeled for the operations to work. For unlabeled graphs, graphs can be prepared with the prep_unlabled_graph() function.
Example:
```r library(igraph) library(igraphdata) library(ig.degree.betweenness) data("UKfaculty")
Making graph undirected so it looks nicer when its plotted
ukfaculty <- prepunlabeled_graph(UKfaculty) |> as.undirected()
ndb <- clusterdegreebetweenness(uk_faculty)
plot( ndb, uk_faculty, main= "Node degree+edge betweenness clustering for UK faculty" ) ```
Owner
- Name: Benjamin Smith
- Login: benyamindsmith
- Kind: user
- Location: Toronto ON
- Website: https://bensstats.wordpress.com/
- Repositories: 3
- Profile: https://github.com/benyamindsmith
GitHub Events
Total
- Issues event: 5
- Watch event: 39
- Issue comment event: 5
- Public event: 1
- Push event: 56
- Fork event: 1
- Create event: 1
Last Year
- Issues event: 5
- Watch event: 39
- Issue comment event: 5
- Public event: 1
- Push event: 56
- Fork event: 1
- Create event: 1
Packages
- Total packages: 1
-
Total downloads:
- cran 219 last-month
- Total dependent packages: 0
- Total dependent repositories: 0
- Total versions: 3
- Total maintainers: 1
cran.r-project.org: ig.degree.betweenness
"Smith-Pittman Community Detection Algorithm for 'igraph' Objects (2024)"
- Homepage: https://github.com/benyamindsmith/ig.degree.betweenness
- Documentation: http://cran.r-project.org/web/packages/ig.degree.betweenness/ig.degree.betweenness.pdf
- License: MIT + file LICENSE
-
Latest release: 0.2.0
published 8 months ago