Kaushik Chakrabarti, Michael Ortega-Binderberger, Sharad Mehrotra, and Kriengkrai Porkaew, "Evaluating refined queries in top-k retrieval systems," vol. 16, no. 2, pp. 256--270, 2004. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Managing Large Multidimensional Datasets Inside A Database System - Chakrabarti (2001) Self-citation (Chakrabarti) (Correct)
....adds all the qualifying points to the result. The R tree can also support the k nearest neighbor (k NN) query efficiently, i.e. find the k nearest neighbors to a given point in terms of Euclidean distance [121, 66] K NN queries with respect to other distance functions has been studied recently [82, 131, 21]. Inserting a new point in the R tree involves selecting a leaf node L to place the point (by starting from the root and recursively selecting the node that requires the least enlargement to accommodate the point) and placing the point in L. If the boundary of L changes or L is split (because it ....
K. Chakrabarti, K.Porkaew, M. Ortega, and S. Mehrotra. Evaluating refined queries in top-k retrieval systems. Submitted for publication. Available as Technical Report TR-MARS-00-04, University of California at Irvine, online at http://www-db.ics.uci.edu/pages/publications/, July 2000.
Database Support for Multimedia Applications - Ortega-Binderberger, al. (2001) Self-citation (Chakrabarti Ortega Mehrotra) (Correct)
....along the dimensions of the feature space to capture the visual perception of the user. This implies that the index structure must support arbitrary distance functions and arbitrary weights along the dimensions that are specified by the user at query time. Such techniques have been developed in [62, 93, 21]. Another requirement of the index structure is to support multi example queries, since the user might submit multiple images as part of the query (see section 2) Such queries are particularly important for retrieval models that represent the query using multiple query points [88, 110] A ....
....way to implement a multipoint query is the multiple expansion approach proposed by Porkaew et al. 89] and Wu et al. 110] The approach explores the nearest neighbors of each individual point P F using the traditional single point k NN algorithm and combines them. An alternate way, proposed in [88, 21], is to develop a new k NN algorithm that can handle multipoint queries. The latter technique involves (1) redefining the MINDIST function, which is used to compute the distance of an index node from the query and (2) using the distance function described above to compute the distance of a indexed ....
[Article contains additional citation context not shown here]
Kaushik Chakrabarti, Kriengkrai Porkaew, Michael Ortega, and Sharad Mehrotra. Evaluating Refined Queries in Top-k Retrieval Systems. Available as Technical Report TR-MARS-00-04, University of California at Irvine, online at http://www-db.ics.uci.edu/pages/publications/, July 2000.
Project Overview - In His State (Correct)
No context found.
Kaushik Chakrabarti, Michael Ortega-Binderberger, Sharad Mehrotra, and Kriengkrai Porkaew, "Evaluating refined queries in top-k retrieval systems," vol. 16, no. 2, pp. 256--270, 2004.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC