Results 11 - 20 of 2,364

Scaling Personalized Web Search

by Glen Jeh, Jennifer Widom - In Proceedings of the Twelfth International World Wide Web Conference , 2002
"... Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's PageRank algorithm. For more refined searches, this global notion of importance can be specialized to create personalized ..."
Abstract - Cited by 409 (2 self) - Add to MetaCart
views of importance -- for example, importance scores can be biased according to a user-specified set of initially interesting pages. Computing and storing all possible personalized views in advance is impractical, as is computing personalized views at query time, since the computation of each view

Svm-knn: Discriminative nearest neighbor classification for visual category recognition

by Hao Zhang, Alexander C. Berg, Michael Maire, Jitendra Malik - in CVPR , 2006
"... We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is quite flexible, and permits recognition based on color, texture, and particularly shape, in a homogeneous framework. While n ..."
Abstract - Cited by 342 (10 self) - Add to MetaCart
. We propose a hybrid of these two methods which deals naturally with the multiclass setting, has reasonable computational complexity both in training and at run time, and yields excellent results in practice. The basic idea is to find close neighbors to a query sample and train a local support vector

Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textual Similarity

by William W. Cohen , 1998
"... Most databases contain "name constants" like course numbers, personal names, and place names that correspond to entities in the real world. Previous work in integration of heterogeneous databases has assumed that local name constants can be mapped into an appropriate global domain by norma ..."
Abstract - Cited by 247 (13 self) - Add to MetaCart
by normalization. However, in many cases, this assumption does not hold; determining if two name constants should be considered identical can require detailed knowledge of the world, the purpose of the user's query, or both. In this paper, we reject the assumption that global domains can be easily constructed

Efficient time series matching by wavelets

by Kin-pong Chan, Ada Wai-chee Fu - Proc. of 15th Int'l Conf. on Data Engineering , 1999
"... Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are applied to time series to reduce the number of dimensions of the feature vectors. Different transformations like Discrete ..."
Abstract - Cited by 286 (1 self) - Add to MetaCart
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are applied to time series to reduce the number of dimensions of the feature vectors. Different transformations like

Query Learning with Large Margin Classifiers

by Colin Campbell, Nello Cristianini, Alex Smola , 2000
"... The active selection of instances can significantly improve the generalisation performance of a learning machine. Large margin classifiers such as Support Vector Machines classify data using the most informative instances (the support vectors). This makes them natural candidates for instance s ..."
Abstract - Cited by 157 (1 self) - Add to MetaCart
The active selection of instances can significantly improve the generalisation performance of a learning machine. Large margin classifiers such as Support Vector Machines classify data using the most informative instances (the support vectors). This makes them natural candidates for instance

Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

by Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani , 1998
"... We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vectors in some high dimensional Euclidean space, we want to construct a space-efficient data structure that would allow us to ..."
Abstract - Cited by 215 (9 self) - Add to MetaCart
to search, given a query vector, for the closest or nearly closest vector in the database. We also address this problem when distances are measured by the L 1 norm, and in the Hamming cube. Significantly improving and extending recent results of Kleinberg, we construct data structures whose size

Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search

by Taher H. Haveliwala - IEEE Transactions on Knowledge and Data Engineering , 2003
"... Abstract—The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative “importance ” of Web pages, independent of any particular search query. To yield more accurate search results, we propose ..."
Abstract - Cited by 237 (2 self) - Add to MetaCart
Abstract—The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative “importance ” of Web pages, independent of any particular search query. To yield more accurate search results, we propose

A model for learning the semantics of pictures

by V. Lavrenko, R. Manmatha, J. Jeon - in NIPS , 2003
"... We propose an approach to learning the semantics of images which allows us to automatically annotate an image with keywords and to retrieve images based on text queries. We do this using a formalism that models the generation of annotated images. We assume that every image is divided into regions, e ..."
Abstract - Cited by 241 (9 self) - Add to MetaCart
We propose an approach to learning the semantics of images which allows us to automatically annotate an image with keywords and to retrieve images based on text queries. We do this using a formalism that models the generation of annotated images. We assume that every image is divided into regions

Generalizing GlOSS to Vector-Space Databases and Broker Hierarchies

by Luis Gravano, Hector Garcia-Molina , 1995
"... As large numbers of text databases have become available on the Internet, it is getting harder to locate the right sources for given queries. In this paper we present gGlOSS, a generalized Glossary-Of-Servers Server, that keeps statistics on the available databases to estimate which databases are t ..."
Abstract - Cited by 179 (15 self) - Add to MetaCart
are the potentially most useful for a given query. gGlOSS extends our previous work [GGMT94a], which focused on databases using the boolean model of document retrieval, to cover databases using the more sophisticated vector-space retrieval model. We evaluate our new techniques using real-user queries and 53 databases

Combining the Evidence of Multiple Query Representations for Information Retrieval

by N. J. Belkin, P. Kantor - Information Processing & Management , 1995
"... Abstract-We report on two studies in the TREC-2 program that investigated the effect on retrieval performance of combination of multiple representations of TREC topics. In one of the projects, five separate Boolean queries for each of the 50 TREC routing topics and 25 of the TREC ad hoc topics were ..."
Abstract - Cited by 144 (7 self) - Add to MetaCart
performance, significantly better than that of single queries, and at least as good as the best individual single-query formulations. In the latter case, data fusion of the ranked lists also led to performance better than that of any single list. In the second project, two automatically produced vector
Results 11 - 20 of 2,364