Daniel A. Keim

Learn More
In this paper, we propose a new method for indexing large amounts of point and spatial data in highdimensional space. An analysis shows that index structures such as the R*-tree are not adequate for indexing high-dimensional data sets. The major problem of R-tree-based index structures is the overlap of the bounding boxes in the directory, which increases(More)
ÐNever before in history has data been generated at such high volumes as it is today. Exploring and analyzing the vast volumes of data is becoming increasingly difficult. Information visualization and visual data mining can help to deal with the flood of information. The advantage of visual data exploration is that the user is directly involved in the data(More)
Several clustering algorithms can be applied to clustering in large multimedia databases. The effectiveness and efficiency of the existing algorithms, however, is somewhat limited, since clustering in multimedia databases requires clustering high-dimensional feature vectors and since multimedia databases often contain large amounts of noise. In this paper,(More)
In recent years, the effect of the curse of high dimensionality has been studied in great detail on several problems such as clustering, nearest neighbor search, and indexing. In high dimensional space the data becomes sparse, and traditional indexing and algorithmic techniques fail from a efficiency and/or effectiveness perspective. Recent research results(More)
During the last decade, multimedia databases have become increasingly important in many application areas such as medicine, CAD, geography, and molecular biology. An important research issue in the field of multimedia databases is the content-based retrieval of similar multimedia objects such as images, text, and videos. However, in contrast to searching(More)
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generalization of an algorithm which has been originally proposed for Quadtrees [13], and show that this algorithm is optimal. Then, we develop a cost model which in contrast to previous(More)
1 Department of Computer and Information Science, University of Konstanz, 78457 Konstanz, Germany, keim@informatik.uni-konstanz.de 2 Fraunhofer Institute for Intelligent Analysis and Information Systems(IAIS), Schloss Birlinghoven 53754 Sankt Augustin, Germany, gennady.andrienko@iais.fraunhofer.de 3 Université Paris-Sud, INRIA, Bât 490, F-91405 Orsay Cedex,(More)
Data Nodes, Edges Display Interactive Display Visual Analogues VisualItems in ItemRegistry User Figure 6.3: The Information Visualisation Reference Model, adapted from Heer et al.[57] 6.2 State of the Art 93 a visual analytics issue that should be better tackled by all the visualisation communities. Blending different kinds of visualisations in the same(More)
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results show, however, the problem is a very di cult one, not only with regards to the performance issue but also to the quality issue. In this paper, we discuss the quality issue and(More)
ÐVisualization techniques are of increasing importance in exploring and analyzing large amounts of multidimensional information. One important class of visualization techniques which is particularly interesting for visualizing very large multidimensional data sets is the class of pixel-oriented techniques. The basic idea of pixel-oriented visualization(More)