https://github.com/compnet/signedbenchmark

Benchmark to study partitioning problems on signed graphs

https://github.com/compnet/signedbenchmark

Science Score: 13.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
  • codemeta.json file
  • .zenodo.json file
  • DOI references
    Found 1 DOI reference(s) in README
  • Academic publication links
  • Academic email domains
  • Institutional organization owner
  • JOSS paper metadata
  • Scientific vocabulary similarity
    Low similarity (14.6%) to scientific vocabulary

Keywords

benchmark graph-partitioning signed-graphs
Last synced: 5 months ago · JSON representation

Repository

Benchmark to study partitioning problems on signed graphs

Basic Info
  • Host: GitHub
  • Owner: CompNet
  • License: gpl-3.0
  • Language: R
  • Default Branch: master
  • Homepage:
  • Size: 1.09 MB
Statistics
  • Stars: 2
  • Watchers: 5
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Topics
benchmark graph-partitioning signed-graphs
Created over 8 years ago · Last pushed about 6 years ago

https://github.com/CompNet/SignedBenchmark/blob/master/

SignedBenchmark v1.1
==================
*Benchmark to study partitioning problems on signed graphs*

* Copyright 2017-18 Vincent Labatut 

`SignedBenchmark` is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation. For source availability and license information see `licence.txt`

* Lab site: http://lia.univ-avignon.fr/
* GitHub repo: https://github.com/CompNet/SignedBenchmark
* Contact: Vincent Labatut 

-----------------------------------------------------------------------

# Description
This set of `R` scripts was designed to randomly generate signed graphs possessing some form of community structure, in order to assess partitioning algorithms.

If you use this software, please cite the following article:
```bibtex
@Article{Arinik2020a,
  author    = {Arnk, Nejat and Figueiredo, Rosa and Labatut, Vincent},
  title     = {Multiplicity and Diversity: Analyzing the Optimal Solution Space of the Correlation Clustering Problem on Complete Signed Graphs},
  journal   = {Journal of Complex Networks},
  year      = {2020},
  volume    = {8},
  number    = {6},
  pages     = {cnaa025},
  doi       = {10.1093/comnet/cnaa025},
}
```


# Organization
Here are the folders composing the project:
* Folder `src`: contains the source code (R scripts).
* Folder `out`: contains the files produced by our scripts.


# Installation
1. Install the [`R` language](https://www.r-project.org/)
2. Install the following R packages:
   * [`igraph`](http://igraph.org/r/): required (tested with version 1.0.1).
   * [`expm`](https://cran.r-project.org/web/packages/expm/index.html): required for certain signed graph layouts (tested with version 	0.999-2).
3. Download this project from GitHub and unzip the archive.


# Use
In order to replicate the experiments from the article, perform the following operations:
1. Open the `R` console.
2. Set the current projetct directory as the working directory, using `setwd("my/path/to/the/project/SignedBenchmark")`.
3. Run `src/main.R`
  

# Dependencies
* [`igraph`](http://igraph.org/r/) package: used to build and handle graphs.
* [`expm`](https://cran.r-project.org/web/packages/expm/index.html) package: power of matrices.

Owner

  • Name: Complex Networks
  • Login: CompNet
  • Kind: organization
  • Location: Avignon, France

GitHub Events

Total
  • Watch event: 1
Last Year
  • Watch event: 1