Figure 5 - uploaded by Thibault Lechien
Content may be subject to copyright.
A histogram of the differences in runtime of the evolved instances

A histogram of the differences in runtime of the evolved instances

Source publication
Preprint
Full-text available
Predicting and comparing algorithm performance on graph instances is challenging for multiple reasons. First, there is usually no standard set of instances to benchmark performance. Second, using existing graph generators results in a restricted spectrum of difficulty and the resulting graphs are usually not diverse enough to draw sound conclusions...

Contexts in source publication

Context 1
... resulted in a range of [-0.97, 2.08] seconds, which shows that our evolutionary algorithm is able to generate graphs with much larger differences in runtime, as we found a range of [-3.83, 165.55] seconds in the evolved instances. A histogram of the differences in runtime of the evolved instances is shown in Figure 5. ...
Context 2
... resulted in a range of [-0.97, 2.08] seconds, which shows that our evolutionary algorithm is able to generate graphs with much larger differences in runtime, as we found a range of [-3.83, 165.55] seconds in the evolved instances. A histogram of the differences in runtime of the evolved instances is shown in Figure 5. ...

Similar publications

Article
Full-text available
Multi-view clustering has gained importance in recent times due to the large-scale generation of data, often from multiple sources. Multi-view clustering refers to clustering a set of objects which are expressed by multiple set of features, known as views, such as movies being expressed by the list of actors or by a textual summary of its plot. Co-...