期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2011
卷号：2
期号：2(Version 2)
出版社：Ayushmaan Technologies
摘要：This research work involving spatial objects, that are directly visible from query points. In this article, presenting the environment of spatial data mining and formulate the visible k nearest neighbor (VkNN) query solutions as incremental algorithm with two variants differing in how to prune objects during the search process. One variant applies visibility pruning only to objects, whereas the other variant applies visibility pruning to index nodes as well. Our implementation results show that the latter outperforms the former. We further propose the aggregate VkNN query, which finds the visible k nearest objects to a set of query points based on an aggregate distance function. two approaches to processing the aggregate VkNN query. One accesses the database via multiple VkNN queries, whereas the other issues an aggregate k nearest neighbor query to retrieve objects from the database and then rerank the results based on the aggregate visible distance metric, with extensive experiments.
关键词：Spatial data mining; visibility; geographical information systems;pruning; distance metricg
