Sciweavers

4560 search results - page 382 / 912
» Finding Data in the Neighborhood
Sort
View
CVPR
1998
IEEE
16 years 8 months ago
Segmentation by Grouping Junctions
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...
Hiroshi Ishikawa 0002, Davi Geiger
CVPR
2005
IEEE
16 years 8 months ago
A Weighted Nearest Mean Classifier for Sparse Subspaces
In this paper we focus on high dimensional data sets for which the number of dimensions is an order of magnitude higher than the number of objects. From a classifier design standp...
Cor J. Veenman, David M. J. Tax
ICDE
2004
IEEE
88views Database» more  ICDE 2004»
16 years 8 months ago
Group Nearest Neighbor Queries
Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, t...
Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyria...
KDD
2007
ACM
122views Data Mining» more  KDD 2007»
16 years 7 months ago
Expertise modeling for matching papers with reviewers
An essential part of an expert-finding task, such as matching reviewers to submitted papers, is the ability to model the expertise of a person based on documents. We evaluate seve...
David M. Mimno, Andrew McCallum
KDD
2002
ACM
119views Data Mining» more  KDD 2002»
16 years 7 months ago
Evaluating classifiers' performance in a constrained environment
In this paper, we focus on methodology of finding a classifier with a minimal cost in presence of additional performance constraints. ROCCH analysis, where accuracy and cost are i...
Anna Olecka