Find research datasets worth reusing
Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.
2
datasets available to search
ShareScore release 0.7.1
Dataset results
2 results for “Signed graphs”
Real-World Signed Graphs Annotated for Whole Graph Classification
<p><strong>Description: </strong>this corpus was designed as an experimental benchmark for a task of signed graph classification. It is composed of three datasets derived from external sources and adapted to our needs:</p> <ul> <li><strong>SpaceOrigin Conversations [1]: </strong>set of conversational graphs, each one associated to a situation of verbal abuse vs. normal situation. These conversations model interactions happening in chatrooms hosted by an MMORPG/ The graphs were originally unsigned: we attributed signed to the edges based on the polarity of the exchanged messages. </li> <li><strong>Correlation Clustering Instances [2]: </strong>set of graph generated randomly as instances of the Correlation Clustering problem, which consists in partitioning signed graphs. These graphs are not associated in any class in the original paper. We proposed a class based on certain features of the space of optimal solutions explored in [2].</li> <li><strong>European Parliament Roll-Calls [3]: </strong>vote networks extracted from the activity of French Members of the European Parliament. The original data does not have any class associated to the networks: we proposed one based on the number of political factions identified in each network in [3]. </li> </ul> <p>These data were used in [4] in order to train and assess various representation learning methods. The authors proposed Signed Graph2vec, a signed variant of Graph2vec; WSGCN, a whole-graph variant of Signed Graph Convolutional Networks (SGCN), and use an aggregated version of Signed Network Embeddings (SiNE) as a baseline. The article provides more information regarding the properties of the datasets, and how they were constituted.</p> <p><strong>Software: </strong>the software used to train the representation learning methods and classifiers is publicly available online: <a href="https://github.com/CompNet/SWGE">SWGE</a>.</p> <p><strong>References:</strong></p> <ol> <li>Papegnies, É.; Labatut, V.; Dufour, R. & Linarès, G. Conversational Networks for Automatic Online Moderation. <em>IEEE Transactions on Computational Social Systems, </em>2019<em>, </em>6:38-55. DOI: <a href="http://doi.org/10.1109/TCSS.2018.2887240">10.1109/TCSS.2018.2887240</a> ⟨<a href="https://hal.science/hal-01999546">hal-01999546</a>⟩</li> <li>Arınık, N.; Figueiredo, R. & Labatut, V. Multiplicity and Diversity: Analyzing the Optimal Solution Space of the Correlation Clustering Problem on Complete Signed Graphs. <em>Journal of Complex Networks, </em>2020<em>, </em>8(6):cnaa025. DOI: <a href="http://doi.org/10.1093/comnet/cnaa025">10.1093/comnet/cnaa025</a> ⟨<a href="https://hal.science/hal-02994011">hal-02994011</a>⟩</li> <li>Arınık, N.; Figueiredo, R. & Labatut, V. Multiple partitioning of multiplex signed networks: Application to European parliament votes. <em>Social Networks, </em>2020<em>, </em>60:83-102. DOI: <a href="http://doi.org/10.1016/j.socnet.2019.02.001">10.1016/j.socnet.2019.02.001</a> ⟨<a href="https://hal.science/hal-02082574">hal-02082574</a>⟩</li> <li>Cécillon, N.; Labatut, V.; Dufour, R. & Arınık, N. Whole-Graph Representation Learning For the Classification of Signed Networks. <em>IEEE Access</em>, 2024, 12:151303-151316. DOI: <a href="https://dx.doi.org/10.1109/ACCESS.2024.3472474">10.1109/ACCESS.2024.3472474</a> <a href="https://hal.archives-ouvertes.fr/hal-04712854" rel="nofollow">⟨hal-04712854⟩</a></li> </ol> <p><strong>Funding: </strong>part of this work was funded by a grant from the <em>Provence-Alpes-Côte-d'Azur</em> region (PACA, France) and the <em>Nectar de Code</em> company.</p> <p><strong>Citation: </strong>If you use this data or the associated source code, please cite article [4]:</p> <p><code>@Article{Cecillon2024,</code><br><code> author = {Cécillon, Noé and Labatut, Vincent and Dufour, Richard and Arınık, Nejat},</code><br><code> title = {Whole-Graph Representation Learning For the Classification of Signed Networks},</code><br><code> journal = {IEEE Access},</code><br><code> year = {2024},</code><br><code> volume = {12},</code><br><code> pages = {151303-151316},</code><br><code> doi = {10.1109/ACCESS.2024.3472474},</code><br><code>}</code></p>
Space of Optimal Solutions of the Correlation Clustering Problem for Complete Signed Graphs
<p><strong>Description. </strong>This is the data used in the experiments of the following paper:</p> <ul> <li>N. Arınık, R. Figueiredo, and V. Labatut, “Multiplicity and Diversity: Analyzing the Optimal Solution Space of the Correlation Clustering Problem on Complete Signed Graphs,” <em>Journal of Complex Networks </em>8(6):cnaa025, 2020. DOI: <a href="http://doi.org/10.1093/comnet/cnaa025">10.1093/comnet/cnaa025</a> ⟨<a href="https://hal.archives-ouvertes.fr/hal-02994011">hal-02994011</a>⟩</li> </ul> <p>This dataset contains:</p> <ul> <li>Plot files used in the article;</li> <li>Input signed networks;</li> <li>All optimal solutions (i.e. optimal solution space) of the corresponding networks;</li> <li>Evaluation files.</li> </ul> <p><strong>Source code. </strong>The code source is accessible on GitHub: <a href="https://github.com/CompNet/Sosocc">https://github.com/CompNet/Sosocc</a></p> <p><strong>Citation. </strong>If you use the data or source code, please cite the above article.</p> <p><br><code>@Article{Arinik2020,</code><br><code> author = {Arınık, Nejat and Figueiredo, Rosa and Labatut, Vincent},</code><br><code> title = {Multiplicity and Diversity: Analyzing the Optimal Solution Space of the Correlation Clustering Problem on Complete Signed Graphs},</code><br><code> journal = {Journal of Complex Networks},</code><br><code> year = {2020},</code><br><code> volume = {8},</code><br><code> number = {6},</code><br><code> pages = {cnaa025},</code><br><code> doi = {10.1093/comnet/cnaa025},</code><br><code>}</code><br><br></p> <p>--------------------------------------------</p> <p><strong>Details.</strong></p> <p><br><strong># PLOT FILES</strong><br>* `<em>Figure1.zip</em>`: Figures showing that there might be many distinct optimal solutions of a small-sized network.<br>* `<em>Figure2.zip</em>`: Figures showing that distinct optimal solutions of a given network might be partition-wise very similar or different.<br>* `<em>Figure4: All Results.zip</em>`: Figure 4 in the article contains only a few plots regarding the results for space considerations. This zip file contains all plots, and it is organized by the values of `<em>l<sub>0</sub></em>`. In each `<em>l<sub>0</sub></em>` folder, the results are shown in three different perspectives:<br>--- Detected Imbalance Percentage vs Graph Order (i.e. number of vertices)<br>--- Prop mispl vs Graph order<br>--- Graph order vs Prop mispl<br>* `<em>workflow.pdf</em>`: The workflow of the methodology used in the article.<br>* `<em>Syrian network With All Solutions.pdf</em>`: Syrian network (on top) with core part information through node colors, and its optimal solutions in which node colors represent partition information (on bottom).<br> </p> <p><strong>#NETWORKS</strong><br>All networks are in `<em>Input Signed Networks.tar.gz</em>`.<br>Networks are generated through a simple random model (available in <em>https://github.com/CompNet/SignedBenchmark</em>) designed to produce complete (or uncomplete) unweighted networks with built-in modular structure.<br>There are 3 parameters used for the generation:</p> <ol> <li>number of nodes (`<em>n</em>`)</li> <li>initial number of modules (`<em>l<sub>0</sub></em>`)</li> <li>proportion of misplaced links, i.e. proportion of frustrated links, (`<em>q<sub>m</sub></em>`)</li> </ol> <p>Inside `<em>Input Signed Networks.tar.gz</em>`:<br>NETWORKS<br>|__n=NB-NODE_l0=INIT_NB_MODULE_dens=1.0000<br>....|__propMispl=PROP_MISPL<br>........|__propNeg=PROP_NEG<br>............|__network=NETWORK_NO<br><br>- The first hierarchy => the folders are named as follows: n=NB-NODE_l0=INIT-NB-MODULE_dens=1.0000<br>The number of nodes, the initial number of modules and the network density are given. The network density is always 1, since we treat only complete signed networks.<br>- The second hierarchy => the folders are named as follows: propMispl=PROP_MISPL<br>Proportion of misplaced links is given.<br>- The third hierarchy => the folders are named as follows: propNeg=PROP_NEG<br>Proportion of negative links (`<em>q<sub>n</sub></em>`) is specified. `<em>q<sub>n</sub></em>` changes depending on `<em>n</em>` and `<em>l<sub>0</sub></em>`. Since only complete signed networks are studied, this parameter is automatically computed from the other input parameters.<br>- The fourth hierarchy => the folders are named as follows: network=NETWORK_NO<br>Network numbers are shown.<br>In the end, thre are three file formats describing the same network content: GraphML (.graphml), Pajek NET (.net) or .G format.<br><br><strong># PARTITIONS</strong><br>All partition results are in `<em>Partition Results.tar.gz</em>`. Note that all optimal partitions of a signed network are obtained through an exact partitioning method. The code source is accessible here: <em>https://github.com/arinik9/ExCC</em><br>Inside `<em>Partition Results.tar.gz</em>`:<br><br>PARTITIONS<br>|__n=NB-NODE_l0=INIT_NB_MODULE_dens=1.0000<br>....|__propMispl=PROP_MISPL<br>........|__propNeg=PROP_NEG<br>............|__network=NETWORK_NO<br>................|__"<em>ExCC-all</em>"<br>....................|__"<em>signed-unweighted</em>"<br><br>- The first hierarchy => the folders are named as follows: n=NB-NODE_l0=INIT-NB-MODULE_dens=1.0000<br>- The second hierarchy => the folders are named as follows: propMispl=PROP_MISPL<br>- The third hierarchy => the folders are named as follows: propNeg=PROP_NEG<br>- The fourth hierarchy => the folders are named as follows: network=NETWORK_NO<br>- The fifth hierarchy => the folders are named as follows: "<em>ExCC-all</em>"<br>The name of the partitioning method are shown. Since an exact partitioning method is used to obtain all distinct optimal solutions, it is named as "<em>ExCC-all</em>".<br>- The sixth hierarchy => the folders are named as follows: "<em>signed-unweighted</em>"<br>The type of signed networks are shown: signed and unweighted</p> <p>In the end, the partition results are located, and the file names are named as follows: <em>membership.txt</em>. Note that the first partition result number starts from zero.</p> <p> </p> <p><strong># EVALUATIONS</strong><br>Evaluation results related to our plots are in `<em>Evaluation Results.tar.gz</em>. Note that the hierarchy of this folder is the same as that of 'Partitions'. Inside `<em>Evaluation</em><em> Results.tar.gz</em>`:</p> <p>- `Best-k-for-kmedoids.csv`: It contains three columns. 1) the number of solution classes via kmedoids, 2) the best Silhouette score, 3) the best clustering in terms of Silhouette score, which represents solution classes.</p> <p>- `class-core-part-size-tresh=1.00.csv`. It indicates the proportion of core part size for each solution class.</p> <p>- `exec-time.csv`: It indicates the execution time in seconds.</p> <p>- `imbalance.csv`: It contains the information of imbalance as 1) count and 2) percentage</p> <p>- `nb-solution.csv`: It indicates the total number of solutions<br>--------------------------------------------</p> <p>Funding: this research benefited from the support of the Agorantic FR 3621, as well as the FMJH Program PGMO and from the support to this program from EDF-THALES-ORANGE-CRITEO.</p>
ScienceDex guides
Understand access before you commit
These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.
Allen Brain Atlas
Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.
Annotated Behaviour and Observability Dataset (ABODe)
ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.
DANDI Archive for NWB datasets
DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.
International Brain Laboratory public data
The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.
OpenNeuro
OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.