Incremental neighborhood graphs construction for multidimensional databases indexing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4509 LNAI, Issue , 2007, Pages 405-416

  Hacid, Hakim ^a   Yoshida, Tetsuya ^b  

^a UNIVERSITÉ LUMIÈRE LYON 2   (France)

^b HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATABASE SYSTEMS; INDEXING (OF INFORMATION); OPTIMIZATION; PROBLEM SOLVING;

MULTIDIMENSIONAL DATABASES INDEXING; NEIGHBORHOOD GRAPHS; NEIGHBORHOOD GRAPHS OPTIMIZATION;

GRAPH THEORY;

EID: 37249058978     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72665-4_35     Document Type: Conference Paper

References (15)

1. P. Cignoni, C. Montani, and R. Scopigno. Dewall: A fast divide and conquer delaunay triangulation algorithm in ed. Computer-Aided Design, 30(5):333-341, 1998.
2. K. R. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic zoology, 18:259-278, 1969.
3. V. Gaede and O. Günther. Multidimensional access methods. ACM Comput. Surv., 30(2):170-231, 1998.
4. H. Hacid and D. Zighed. Content-based image retrieval in large image databases. In IEEE International Conference on Granular Computing (GrC 2006), Atlanta, USA, May 2006.
5. H. Hacid and D. A. Zighed. An effective method for locally neighborhood graphs updating. In DEXA, pages 930-939, 2005.
6. J. Jaromczyk and G. Toussaint. Relative neighborhood graphs and their relatives. P-IEEE, 80:1502-1517.
7. J. Katajainen. The region approach for computing relative neighborhood graphs in the lp metric. Computing, 40:147-161, 1988.
8. D. G. Kirkpatrick and J. D. Radke. A framework for computational morphology. In Computational Geometry, G. T. Tousaint, ed., Elsevier Science Publishers, North Holland, pages 217-249, 1985.
9. J. B. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability", Berkeley, University of California Press, 1, pages 281-297, 1967.
10. F. Preparata and M. I. Shamos. Computationnal Geometry-Introduction. Springer-Verlag, New-York, 1985.
11. W. D. Smith. Studies in computational geometry motivated by mesh generation. PhD thesis, Princeton University, 1989.
12. P. Somervuo and T. Kohonen. Self-organizing maps and learning vector quantization for feature sequences. Neural Processing Letters, 10(2):151-159, 1999.
13. G. T. Toussaint. The relative neighborhood graphs in a finite planar set. Pattern recognition, 12:261-268, 1980.
14. G. T. Toussaint. Some insolved problems on proximity graphs. D. W Dearholt and F. Harrary, editors, proceeding of the first workshop on proximity graphs. Memoranda in computer and cognitive science MCCS-91-224. Computing research laboratory. New Mexico state university Las Cruces, 1991.
15. E. Welzl, P. Su, and R. L. S. D. III. A comparison of sequential delaunay triangulation algorithms. Comput. Geom., 7:361-385, 1997.