Up a level |
This graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
A word cloud is a visual representation of the most frequently used words in a text or a set of texts. The words appear in different sizes, with the size of each word being proportional to its frequency of occurrence in the text. The more frequently a word is used, the larger it appears in the word cloud. This technique allows for a quick visualization of the most important themes and concepts in a text.
In the context of this page, the word cloud was generated from the publications of the author {}. The words in this cloud come from the titles, abstracts, and keywords of the author's articles and research papers. By analyzing this word cloud, you can get an overview of the most recurring and significant topics and research areas in the author's work.
The word cloud is a useful tool for identifying trends and main themes in a corpus of texts, thus facilitating the understanding and analysis of content in a visual and intuitive way.
Fischer, A., Plamondon, R., Savaria, Y., Riesen, K., & Bunke, H. (2014, August). A Hausdorff heuristic for efficient computation of graph edit distance [Paper]. Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition (S+SSPR 2014), Joensuu, Finland. External link
Riesen, K., Fischer, A., & Bunke, H. (2015). Estimating graph edit distance using lower and upper bounds of bipartite approximations. International Journal of Pattern Recognition and Artificial Intelligence, 29(2), 27 pages. External link
Riesen, K., Fischer, A., & Bunke, H. (2014, August). Improving Approximate Graph Edit Distance Using Genetic Algorithms [Paper]. Joint IAPR International Workshop (S+SSPR 2014), Joensuu, Finland. Published in Lecture notes in computer science. External link
Riesen, K., Fischer, A., & Bunke, H. (2014, October). Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation [Paper]. 6th IAPR TC 3 International Workshop (ANNPR 2014), Montreal, QC, Canada. Published in Lecture notes in computer science. External link
Riesen, K., Fischer, A., & Bunke, H. (2014, October). Computing Upper and Lower Bounds of Graph Edit Distance in Cubic Time [Paper]. 6th IAPR TC 3 International Workshop (ANNPR 2014), Montreal, QC, Canada. Published in Lecture notes in computer science. External link