File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICDE.2006.129
- Scopus: eid_2-s2.0-33749620348
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Reverse nearest neighbors search in ad-hoc subspaces
Title | Reverse nearest neighbors search in ad-hoc subspaces |
---|---|
Authors | |
Issue Date | 2006 |
Citation | Proceedings - International Conference On Data Engineering, 2006, v. 2006, p. 76 How to Cite? |
Abstract | Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. In this paper, we study an interesting generalization of the RNN query, where not all dimensions are considered, but only an ad-hoc subset thereof. The rationale is that (i) the dimensionality might be too high for the result of a regular RNN query to be useful, (ii) missing values may implicitly define a meaningful subspace for RNN retrieval, and (iii) analysts may be interested in the query results only for a set of (ad-hoc) problem dimensions (i.e., object attributes). We consider a suitable storage scheme and develop appropriate algorithms for projected RNN queries, without relying on multidimensional indexes. Our methods are experimentally evaluated with real and synthetic data. © 2006 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/93411 |
ISSN | 2023 SCImago Journal Rankings: 1.306 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yiu, ML | en_HK |
dc.contributor.author | Mamoulis, N | en_HK |
dc.date.accessioned | 2010-09-25T15:00:20Z | - |
dc.date.available | 2010-09-25T15:00:20Z | - |
dc.date.issued | 2006 | en_HK |
dc.identifier.citation | Proceedings - International Conference On Data Engineering, 2006, v. 2006, p. 76 | en_HK |
dc.identifier.issn | 1084-4627 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/93411 | - |
dc.description.abstract | Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. In this paper, we study an interesting generalization of the RNN query, where not all dimensions are considered, but only an ad-hoc subset thereof. The rationale is that (i) the dimensionality might be too high for the result of a regular RNN query to be useful, (ii) missing values may implicitly define a meaningful subspace for RNN retrieval, and (iii) analysts may be interested in the query results only for a set of (ad-hoc) problem dimensions (i.e., object attributes). We consider a suitable storage scheme and develop appropriate algorithms for projected RNN queries, without relying on multidimensional indexes. Our methods are experimentally evaluated with real and synthetic data. © 2006 IEEE. | en_HK |
dc.language | eng | en_HK |
dc.relation.ispartof | Proceedings - International Conference on Data Engineering | en_HK |
dc.title | Reverse nearest neighbors search in ad-hoc subspaces | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Mamoulis, N:nikos@cs.hku.hk | en_HK |
dc.identifier.authority | Mamoulis, N=rp00155 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ICDE.2006.129 | en_HK |
dc.identifier.scopus | eid_2-s2.0-33749620348 | en_HK |
dc.identifier.hkuros | 122082 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-33749620348&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 2006 | en_HK |
dc.identifier.spage | 76 | en_HK |
dc.identifier.epage | 76 | en_HK |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Yiu, ML=8589889600 | en_HK |
dc.identifier.scopusauthorid | Mamoulis, N=6701782749 | en_HK |
dc.identifier.issnl | 1084-4627 | - |