Random generation of signed graphs
These scripts were designed to randomly generate signed graphs possessing some form of community structure, in order to assess partitioning algorithms. Various aspects of the graphs can be specified by the user.
These scripts were designed to randomly generate signed graphs possessing some form of community structure, in order to assess partitioning algorithms. Various aspects of the graphs can be specified by the user.
This software takes the name of a public person and a period, and retrieve all events available online involving this person during this period. It first performs a Web search using various engines, then retrieves the corresponding Web pages, performs NER (named entity recognition), uses these entities to cluster the articles, and considers each cluster as the description of a specific event. It is designed to handle Web pages in French, but should work also for English.
These were designed for three purposes: Generate a variety of plots and statistics based on some raw data describing the voting activity of a population. Extract so-called vote networks from these data. Perform various analyses on these networks, in particular: estimate good partitions of the network, according to different measures. Our tool was applied to data representing the activity of the members of the European Parliament (MEPs) during the 7th term (from June 2009 to June 2014), as described in [MFL’15a, MFL’15b]. The raw data describing this activity were first retrieved from the VoteWatch website. However, these data were incomplete, so we later switched to another source: the It’s Your Parliament website. There were also some minor issues with these data, which we had to correct: some MEPs were represented twice, some profiles were incomplete, the policy domains were not defined for all vote texts, etc. These cleaned data are available on Zenodo here and there. URL: https://github.com/CompNet/NetVotes Production date: 2014–2018 Related publications: Nejat Arınık, Rosa Figueiredo et Vincent Labatut. « Signed Graph Analysis for theInterpretation of Voting Behavior ». In : International Conference on Knowledge Technologiesand Data-driven Business (i-KNOW) – International Workshop on Social NetworkAnalysis and Digital Humanities (SnanDig). T. 2025. CEUR Workshop Proceedings.Graz, Plus d'infos
Laboratoire Informatique d'Avignon — Avignon Université