Distance measures for point sets and their computation

Acta Informatica

Volumn 34, Issue 2, 1997, Pages 109-133

  Eiter, Thomas ^a   Mannila, Heikki ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FUNCTIONS; POLYNOMIALS;

DISTANCE FUNCTIONS; METRIC INFIMUM METHOD; MINIMUM DISTANCE LINK MEASURE; SUPPLY POLYNOMIAL TIME ALGORITHMS; SURJECTION MEASURE;

SET THEORY;

EID: 0031338770     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050075     Document Type: Article

References (26)

1. H. Alt, K. Mehlhorn, H. Wagener, E. Welzl: Congruence, similarity and symmetries of geometric objects. Discrete Comput. Geom. 3, 237-256 (1988)
2. M. R. Anderberg: Cluster Analysis for Applications. Academic Press, New York, 1973.
3. C. Berge: Graphs and Hypergraphs. Elsevier Science Publishers B.V. (North-Holland), 1989.
4. J. Dugundji: Topology. Allyn and Bacon, Inc., Boston, 1966.
5. U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy (editors): Advances in Knowledge Discovery and Data Mining. AAAI Press, 1995. To appear.
6. P. Gärdenfors: Knowledge in Flux. Bradford Books, MIT Press, 1988.
7. M. Garey, R. Graham, D. Johnson: Some NP-complete Geometric Problems. In Proceedings STOC-78, pages 10-21, 1978.
8. M. Garey, D. S. Johnson: Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
9. D. Huttenlocher, K. Kedem: Efficiently Computing the Hausdorff Distance for Point Sets under Translation. In Proceedings of the Sixth ACM Symposium on Computational Geometry, pp. 340-349 (1990)
10. K. Mehlhorn: Graph Algorithms and NP-Completeness, volume 2 of Data Structures and Algorithms. Springer, 1984.
11. S. Muggleton: Inductive Acquisition of Expert Knowledge. Addison Wesley, Reading, Massachusetts, 1990.
12. B. K. Natarajan: Machine Learning: A Theoretical Approach. Morgan Kaufmann, San Mateo, CA, May 1991.
13. I. Niiniluoto: Truthlikeness. D. Reidel Pub. Comp., Dordrecht, Holland, 1987.
14. G. Oddie: Verisimilitude and Distance in Logical Space. In I. Niiniluoto and R. Tuomela, editors, The Logic and Epistemology of Scientific Change, pages 243-264. North-Holland, 1979. (Acta Philosophica Fennica 30).
15. G. Oddie: Likeness to Truth. D. Reidel Pub. Comp., Dordrecht, Holland, 1986.
16. G. Piatetsky-Shapiro, W. J. Frawley (editors): Knowledge Discovery in Databases. AAAI Press/The MIT Press, Menlo Park, CA, 1991.
17. K. Popper: Some Comments on Truth and the Growth of Knowledge. In E. Nagel, P. Suppes, and A. Tarski, editors, Logic, Methodology, and Philosophy of Science, pp. 285-292 (1962)
18. K. Popper: A Note on Verisimilitude. British Journal for the Philosophy of Science 27, 147-159 (1976)
19. P. Z. Revesz: On the Semantics of Theory Change: Arbitration between Old and New Information. In Proceedings of the Twelth ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-93), pages 71-79, June 1993.
20. H. Romerburg: Cluster Analysis for Researchers. Lifetime Learning, Belmont, CA, 1984.
21. H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hätönen, H. Mannila: Pruning and grouping of discovered association rules. In MLnet Workshop on Statistics, Machine Learning, and Discovery in Databases, pages 47-52, Heraklion, Crete, Greece, April 1995.
22. R. Tuomela: Verisimilitude and Theory-Distance. Synthese 38, 213-246 (1978)
23. P. Vaiyda: Geometry Helps in Matching. In Proceedings of the Twentiest ACM Symposium on the Theory of Computing (STOC-88), pages 422-425, 1988.
24. J. van Leeuwen: Graph Algorithms. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 10. Elsevier - North-Holland, Amsterdam 1990.
25. M. Winslett: Updating Logical Databases. Cambridge University Press, 1990.
26. S. Wrobel: On the Proper Definition of Minimality in Specialization and Theory Revision. In P. B. Brazdil, editor, Machine Learning: ECML-93. European Conference on Machine Learning, Lecture Notes in AI 667, pp65-82. Springer-Verlag, 1993