Find research datasets worth reusing

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.&nbsp;&nbsp;</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].&nbsp;</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, &Eacute;.; Labatut, V.; Dufour, R. &amp; Linar&egrave;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. &amp; 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. &amp; 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&eacute;cillon, N.; Labatut, V.; Dufour, R. &amp; Arınık, N. Whole-Graph Representation Learning For the Classification of Signed Networks. <em>IEEE Access</em>, 2024, 12:151303-151316. DOI:&nbsp;<a href="https://dx.doi.org/10.1109/ACCESS.2024.3472474">10.1109/ACCESS.2024.3472474</a>&nbsp;<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&ocirc;te-d'Azur</em>&nbsp;region (PACA, France) and the&nbsp;<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>&nbsp; author &nbsp; &nbsp;= {C&eacute;cillon, No&eacute; and Labatut, Vincent and Dufour, Richard and Arınık, Nejat},</code><br><code>&nbsp; title &nbsp; &nbsp; = {Whole-Graph Representation Learning For the Classification of Signed Networks},</code><br><code>&nbsp; journal &nbsp; = {IEEE Access},</code><br><code>&nbsp; year &nbsp; &nbsp; &nbsp;= {2024},</code><br><code>&nbsp; volume&nbsp; &nbsp; = {12},</code><br><code>&nbsp; pages&nbsp; &nbsp; &nbsp;= {151303-151316},</code><br><code>&nbsp; doi &nbsp; &nbsp; &nbsp; = {10.1109/ACCESS.2024.3472474},</code><br><code>}</code></p>