PDF-Download - Deutsche Geodätische Kommission

LITERATURVERZEICHNIS 115
Goodman, J. & O’Rourke, J., Hrsg. (1997), Handbook of Discrete and Computational Geometry, CRC Press,
Boca Raton, New York.
Goodrich, M., Tsay, J.-J., Vengroff, D. & Vitter, J. (1993), External-Memory Computational Geometry, in:
‘34th Symposium on Foundations of Computer Science’.
Guha, S., Rastogi, R. & Shim, K. (1998), CURE: An efficient clustering algorithm for large databases, in: ‘Proc.
of 1998 ACM-SIGMOD International Conference on Management of Data’.
Guha, S., Rastogi, R. & Shim, K. (1999), ROCK: A robust clustering algorithm for categorical attributes, in:
‘Proc. of the 15th International Conference on Data Engineering’.
Güttman, R. (1984), A dynamic index structure for spatial searching, in: ‘Int. Conf. on Management of Data’,
ACM-SIGMOD, Boston, MA, Seiten 47–57.
Haala, N. & Anders, K.-H. (1996), Fusion of 2D-GIS and Image Data for 3D Building Reconstruction, in:
‘International Archives of Photogrammetry and Remote Sensing’, Vol. 31(3), ISPRS, Vienna, Austria,
Seiten 285–290.
Haala, N. & Anders, K.-H. (1997), Acquisition of 3D urban models by analysis of aerial images, digital surface
models and existing 2D building information, in: ‘SPIE Conference on Integrating Photogrammetric
Techniques with Scene Analysis and Machine Vision III’, SPIE, Orlando, Florida, Seiten 212–222.
Hamming, R., Hrsg. (1987), Information und Codierung, VCH Verrlagsgesellschaft, Weinheim.
Han, J. & Fu, Y. (1996), Exploration of the Power of Attribute-Oriented Induction in Data Mining, in: U. Fayyad,
G. Piatetsky-Shapiro, P. Smyth & R. Uthurusamy, Hrsg., ‘Advances in Knowledge Discovery and
Data Mining’, AAAI/MIT, Menlo Park, CA.
Hand, D. (1981), Discrimination and Clssification, Wiley, Chichester.
Hein, O. (1977), Graphentheorie für Anwender, Vol. 83, Bibliographisches Institut AG, Mannheim. ISBN 3-
411-00083-X.
Hermes, H., Hrsg. (1967), Einführung in die Verbandstheorie, 2. Auflage, Springer-Verlag, Berlin-Heidelberg.
Holsheimer, M. & Kersten, M. (1994), Architectural Support for Data Mining, Technical Report CS-R9429,
CWI, Amsterdam, The Netherlands.
Holsheimer, M. & Siebes, A. (1994), Data mining: The search for knowledge in databases, Technical Report
CS-R9406, CWI, Amsterdam, The Netherlands.
Jain, A. & Dubes, R. (1988), Algorithms for Clustering Data, Prentice Hall.
Jaromczyk, J. & Toussaint, G. (1992), Relative neighborhood graphs and their relatives, in: ‘Proceedings IEEE’,
Vol. 80(9), Seiten 1502–1517.
Jarvis, R. & Patrick, E. (1973), ‘Clustering using a similarity measure based on shared near neighbours’, IEEE
Transactions on Computers 22(11), 1025–1034.
Karypis, G., Han, E.-H. S. & Kumar, V. (1999), CHAMELEON: A Hierarchical Clustering Algorithm
Using Dynamical Modeling, To appear in the IEEE Computer or via internet at
http://winter.cs.umn.edu/∼karypis/publications/data-mining.html.
Kaufman, L. & Rousseeuw, P. (1990), Finding Groups in Data: An Introduction to Cluster Analysis, John Wiley
&Sons.
Kaufmann, M. (1971), Einführung in die Graphentheorie, R.Oldenbourg,München. ISBN 3-486-33511-1.
King, V. (1995), A Simpler Minimum Spanning Tree Verification Algorithm, in: ‘Workshop on Algorithms and
Data Structures’, Seiten 440–448.
Kirkpatrick, D. & Radke, J. (1985), A framework for computational morphology, in: G. Toussaint, Hrsg.,
‘Computational Geometry’, North-Holland, Seiten 217–248.