Results 1  10
of
1,475,255
kNN at TREC9
 In Proc. of the 9th Text REtrieval Conference (TREC9
, 2000
"... We applied a multiclass knearestneighbor based text classification algorithm to the adaptive and batch filtering problems in the TREC9 filtering track. While our systems performed well in the batch filtering tasks, they did not perform as well in the adaptive filtering tasks, in part becaus ..."
Abstract
 Add to MetaCart
We applied a multiclass knearestneighbor based text classification algorithm to the adaptive and batch filtering problems in the TREC9 filtering track. While our systems performed well in the batch filtering tasks, they did not perform as well in the adaptive filtering tasks, in part
and kNN reranking
"... retrieval and localization with spatiallyconstrained similarity measure ..."
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps required by earlier algorithms. First, the paper states the maximum flow problem, gives the FordFulkerson labeling method for its solution, and points out that an improper choice of flow augmenting paths can lead to severe computational difficulties. Then rules of choice that avoid these difficulties are given. We show that, if each flow augmentation is made along an augmenting path having a minimum number of arcs, then a maximum flow in an nnode network will be obtained after no more than ~(n a n) augmentations; and then we show that if each flow change is chosen to produce a maximum increase in the flow value then, provided the capacities are integral, a maximum flow will be determined within at most 1 + logM/(M1) if(t, S) augmentations, wheref*(t, s) is the value of the maximum flow and M is the maximum number of arcs across a cut. Next a new algorithm is given for the minimumcost flow problem, in which all shortestpath computations are performed on networks with all weights nonnegative. In particular, this
Surface kNN Query Processing
"... A kNN query finds the k nearestneighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to efficient kNN query processing is to fetch and check the distances of a minimum number of points from the database. For many a ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
A kNN query finds the k nearestneighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to efficient kNN query processing is to fetch and check the distances of a minimum number of points from the database. For many
(a) Sampling (b) kNN6
"... the knearest neighbors and the Gabriel graph often introduce false extrema (red). A denser variant, the diamond graph, considerably reduces the number of false extrema, while our relaxed empty region graph accurately extracts the correct extrema, requiring only a marginal number of additional edges ..."
Abstract
 Add to MetaCart
the knearest neighbors and the Gabriel graph often introduce false extrema (red). A denser variant, the diamond graph, considerably reduces the number of false extrema, while our relaxed empty region graph accurately extracts the correct extrema, requiring only a marginal number of additional
An evaluation of statistical approaches to text categorization
 Journal of Information Retrieval
, 1999
"... Abstract. This paper focuses on a comparative evaluation of a widerange of text categorization methods, including previously published results on the Reuters corpus and new results of additional experiments. A controlled study using three classifiers, kNN, LLSF and WORD, was conducted to examine th ..."
Abstract

Cited by 664 (23 self)
 Add to MetaCart
Abstract. This paper focuses on a comparative evaluation of a widerange of text categorization methods, including previously published results on the Reuters corpus and new results of additional experiments. A controlled study using three classifiers, kNN, LLSF and WORD, was conducted to examine
Efficient kNN Search on Vertically Decomposed Data
"... Applications like multimedia retrieval require e#cient support for similarity search on large data collections. Yet, nearest neighbor search is a di#cult problem in high dimensional spaces, rendering e#cient applications hard to realize: index structures degrade rapidly with increasing dimensionalit ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
dimensionality, while sequential search is not an attractive solution for repositories with millions of objects. This paper approaches the problem from a di#erent angle. A solution is sought in an unconventional storage scheme, that opens up a new range of techniques for processing kNN queries, especially
Results 1  10
of
1,475,255