Next Article in Journal
Refinement of Background-Subtraction Methods Based on Convolutional Neural Network Features for Dynamic Background
Next Article in Special Issue
Recommending Links to Control Elections via Social Influence
Previous Article in Journal
A New Regularized Reconstruction Algorithm Based on Compressed Sensing for the Sparse Underdetermined Problem and Applications of One-Dimensional and Two-Dimensional Signal Recovery
Previous Article in Special Issue
Bamboo Garden Trimming Problem: Priority Schedulings
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
Algorithms
Volume 12
Issue 7
10.3390/a12070127
algorithms-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Guidelines for Experimental Algorithmics: A Case Study in Network Analysis

by
Eugenio Angriman
1,†,
Alexander van der Grinten
1,†,
Moritz von Looz
1,†,
Henning Meyerhenke
1,*,†,
Martin Nöllenburg
2,†,
Maria Predari
1,† and
Charilaos Tzovas
1,†
1
Department of Computer Science, Humboldt-Universität zu Berlin, 10099 Berlin, Germany
2
Algorithms and Complexity Group, Institute of Logic and Computation, TU Wien, 1040 Vienna, Austria
*
Author to whom correspondence should be addressed.
†
These authors contributed equally to this work.
Algorithms 2019, 12(7), 127; https://doi.org/10.3390/a12070127
Submission received: 1 June 2019 / Revised: 19 June 2019 / Accepted: 19 June 2019 / Published: 26 June 2019
(This article belongs to the Special Issue Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems)
Browse Figures
Versions Notes

Abstract

The field of network science is a highly interdisciplinary area; for the empirical analysis of network data, it draws algorithmic methodologies from several research fields. Hence, research procedures and descriptions of the technical results often differ, sometimes widely. In this paper we focus on methodologies for the experimental part of algorithm engineering for network analysis—an important ingredient for a research area with empirical focus. More precisely, we unify and adapt existing recommendations from different fields and propose universal guidelines—including statistical analyses—for the systematic evaluation of network analysis algorithms. This way, the behavior of newly proposed algorithms can be properly assessed and comparisons to existing solutions become meaningful. Moreover, as the main technical contribution, we provide SimexPal, a highly automated tool to perform and analyze experiments following our guidelines. To illustrate the merits of SimexPal and our guidelines, we apply them in a case study: we design, perform, visualize and evaluate experiments of a recent algorithm for approximating betweenness centrality, an important problem in network analysis. In summary, both our guidelines and SimexPal shall modernize and complement previous efforts in experimental algorithmics; they are not only useful for network analysis, but also in related contexts.
Keywords: experimental algorithmics; network analysis; applied graph algorithms; statistical analysis of algorithms experimental algorithmics; network analysis; applied graph algorithms; statistical analysis of algorithms

Share and Cite

MDPI and ACS Style

Angriman, E.; van der Grinten, A.; von Looz, M.; Meyerhenke, H.; Nöllenburg, M.; Predari, M.; Tzovas, C. Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms 2019, 12, 127. https://doi.org/10.3390/a12070127

AMA Style

Angriman E, van der Grinten A, von Looz M, Meyerhenke H, Nöllenburg M, Predari M, Tzovas C. Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms. 2019; 12(7):127. https://doi.org/10.3390/a12070127

Chicago/Turabian Style

Angriman, Eugenio, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, and Charilaos Tzovas. 2019. "Guidelines for Experimental Algorithmics: A Case Study in Network Analysis" Algorithms 12, no. 7: 127. https://doi.org/10.3390/a12070127

APA Style

Angriman, E., van der Grinten, A., von Looz, M., Meyerhenke, H., Nöllenburg, M., Predari, M., & Tzovas, C. (2019). Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms, 12(7), 127. https://doi.org/10.3390/a12070127

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop