On Terrain Coverage Optimization by Using a Network Approach for Universal Graph-Based Data Mining and Knowledge Discovery

@inproceedings{Preu2014OnTC,
  title={On Terrain Coverage Optimization by Using a Network Approach for Universal Graph-Based Data Mining and Knowledge Discovery},
  author={Michael Preu{\ss} and Matthias Dehmer and Stefan Pickl and Andreas Holzinger},
  booktitle={Brain Informatics and Health},
  year={2014}
}
This conceptual paper discusses a graph-based approach for on-line terrain coverage, which has many important research aspects and a wide range of application possibilities, e.g in multi-agents. Such approaches can be used in different application domains, e.g. in medical image analysis. In this paper we discuss how the graphs are being generated and analyzed. In particular, the analysis is important for improving the estimation of the parameter set for the used heuristic in the field of route… 
On Graph Extraction from Image Data
TLDR
A novel approach for knowledge discovery by extracting graph structures from natural image data is presented, built upon modern Web technologies, utilizing HTML canvas and pure Javascript inside a Web-browser, which is a very promising engineering approach.
Multiple Minimum Support-Based Rare Graph Pattern Mining Considering Symmetry Feature-Based Growth Technique and the Differing Importance of Graph Elements
TLDR
This work proposes a new frequent graph pattern mining method, which can deal with both different element importance and multiple minimum support thresholds and can obtain more meaningful graph pattern results with higher importance.
Knowledge Discovery from Complex High Dimensional Data
TLDR
Graph-based knowledge representation has lots of potential, for instance to create perceivable and interactive representations and to perform new types of analysis based on graph theory and network topology, and is shown in this article.
Extravaganza Tutorial on Hot Ideas for Interactive Knowledge Discovery and Data Mining in Biomedical Informatics
TLDR
This tutorial gives an overview of the HCI-KDD approach and focuses on 3 topics: graphs, topology and entropy.
Optimizing Wiener and Randić Indices of Graphs
TLDR
This work investigates how individual weights must be assigned to edges, minimizing the connection strength of the graph, using the weighted Wiener index and a modified version of the ordinary Randic index.
Trends in Interactive Knowledge Discovery for Personalized Medicine: Cognitive Science meets Machine Learning
TLDR
This paper provides a rough overview of the HCI-KDD approach and focuses on three future trends: graph-based mining, topological data mining and entropy-based data mining.
Processing Neurology Clinical Data for Knowledge Discovery: Scalable Data Flows Using Distributed Computing
TLDR
This chapter describes the development of a high performance data flow system called Signal Data Cloud (SDC) to pre-process large-scale electrophysiological signal data using open source Apache Pig and discusses the various challenges being faced by the biomedical informatics community in the context of Big Data.

References

SHOWING 1-10 OF 67 REFERENCES
A Multi-Objective Online Terrain Coverage Approach
TLDR
A new multi-objective optimization approach in the field of terrain coverage that can reduce the repeated coverage and therefore the total coverage time is introduced.
The Robust Shortest Path Problem with Interval Data
TLDR
It is shown that knowing those arcs which are never on shortest paths the authors can preprocess a graph prior to solution of the robust path problems, supporting the claim that the preprocessing of graphs helps us significantly in solving the robust paths problems.
Spanning tree based terrain coverage by multi robots in unknown environments
TLDR
A novel simultaneous on-line coverage strategy for multi robots, which is structured and assures complete and robust coverage of the surface regardless of the shape of the unknown environment is presented.
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
TLDR
How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
Multirobot Forest Coverage for Weighted and Unweighted Terrain
TLDR
Multirobot forest coverage (MFC), a new polynomial-time multirobot coverage algorithm based on an algorithm by Even et al. for finding a tree cover with trees of balanced weights is described.
On the Generation of Point Cloud Data Sets: Step One in the Knowledge Discovery Process
TLDR
This paper describes the case for natural point clouds, i.e. where the data already are represented by points; some fundamentals of medical images are provided, particularly dermoscopy, confocal laser scanning microscopy, and total-body photography; the use of graph theoretic concepts for image analysis is described, and some medical background on skin cancer is given.
Multi-touch Graph-Based Interaction for Knowledge Discovery on Mobile Devices: State-of-the-Art and Future Challenges
TLDR
This paper presents the state-of-the-art in graph-based approaches for multi-touch interaction on mobile devices and highlights some open problems to stimulate further research and future developments.
Genetic algorithms for solving shortest path problems
TLDR
A priority-based encoding method is proposed which can potentially represent all possible paths in a graph which can find the known optimum very rapidly with very high probability.
Graph Matching : Theoretical Foundations , Algorithms , and Applications
TLDR
Applications of graph matching will be demonstrated giving examples from the fields of pattern recognition and computer vision, and recent theoretical work showing various relations between different similarity measures will be discussed.
An Analysis of Stochastic Shortest Path Problems
We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose a probability distribution over the set of successor nodes so as to reach a
...
1
2
3
4
5
...