Word morph and topological structures: A graph generating algorithm
Jürgen Klüver, Jörn Schmidt, Christina Klüver · Complexity · 2016
An algorithm of generating graph structures for the ordering of datasets is proposed. It operates with the key concept of “sphere neighborhood” and generates the graph structured ordering of datasets, provided the elements of such sets can be related by some similarity relation. The algorithm always allows determining the shortest path between two nodes in a constructive way. It is demonstrated by an application to the famous Word Morph game and in addition to the ordering of logfiles with respect to the detection of errors. Therefore, the algorithm can be very useful for the dealing with Big Data problems. © 2016 Wiley Periodicals, Inc. Complexity 21: 426–436, 2016