Khanh Tran Dang, Josef Küng, Roland Wagner,
"e-ISA: An Incremental Lower Bound Approach for Efficiently Finding Approximate Nearest Neighbor of Complex Vague Queries"
: Proceedings of the 4th International Conference on Information Integration and Web-based Applications and Services - iiWAS 2002, 9-2002, ISBN: 3-936150-18-4, DANG Tran Khanh, Josef Küng, Roland Wagner: e-ISA: An Incremental Lower Bound Approach for Efficiently Finding Approximate Nearest Neighbor of Complex Vague Queries, Proceedings of the 4th International Conference on Information Integration and Web-based Applications and Services - iiWAS 2002, SCS Europe BVBA, European-Publishing House, [ISBN 3-936150-18-4], Bandung, Indonesia, September 10-12, 2002

Original Titel:

e-ISA: An Incremental Lower Bound Approach for Efficiently Finding Approximate Nearest Neighbor of Complex Vague Queries

Sprache des Titels:

Englisch

Original Buchtitel:

Proceedings of the 4th International Conference on Information Integration and Web-based Applications and Services - iiWAS 2002

Original Kurzfassung:

In our context, a complex vague query means a multifeature
nearest neighbor query. Answering such queries
requires the system to search on some feature spaces
individually and then combine the searching results to
find the final answers. The feature spaces are commonly
multidimensional spaces and may consist of a vast
amount of data. Therefore searching costs, including
IO-cost and CPU-cost, are prohibitively expensive for
complex vague queries. For only such a single-feature
space, to alleviate the costs, problem of answering
nearest neighbor and approximate nearest neighbor
queries has been proposed and quite well-addressed in
the literature. A data object P is called a (1+|Å)-
approximate nearest neighbor of a given query object Q
with |Å>0 if for all other data objects P!?: dist(P, Q) !Ü
(1+|Å)dist(P!?, Q), in which dist(X, Y) represents the
distance between objects X and Y. In this paper,
however, we introduce an approach for finding (1+|Å)-
approximate nearest neighbor(s) of complex vague
queries, which must deal with the problem on multiple
feature spaces. This approach is based on a novel,
efficient and general algorithm called ISA-Incremental
hyper-Sphere Approach, which has just recently been
introduced for solving nearest neighbor problem in the
Vague Query System (VQS). To the best of our
knowledge, the work presented in this paper is one of a
few vanguard solutions for dealing with problem of
answering approximate multi-feature nearest neighbor
queries. The experimental results with both uniformly
distributed and real data sets will prove the efficiency of the proposed approach.

Sprache der Kurzfassung:

Englisch

Erscheinungsmonat:

9

Erscheinungsjahr:

2002

Notiz zum Zitat:

DANG Tran Khanh, Josef Küng, Roland Wagner: e-ISA: An Incremental Lower Bound Approach for Efficiently Finding Approximate Nearest Neighbor of Complex Vague Queries, Proceedings of the 4th International Conference on Information Integration and Web-based Applications and Services - iiWAS 2002, SCS Europe BVBA, European-Publishing House, [ISBN 3-936150-18-4], Bandung, Indonesia, September 10-12, 2002