Sciweavers

135 search results - page 21 / 27
» High dimensional nearest neighbor searching
Sort
View
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 1 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
ICCV
2009
IEEE
15 years 16 days ago
Mode-Detection via Median-Shift
Median-shift is a mode seeking algorithm that relies on computing the median of local neighborhoods, instead of the mean. We further combine median-shift with Locality Sensitive...
Lior Shapira, Shai Avidan, Ariel Shamir
ICDM
2009
IEEE
176views Data Mining» more  ICDM 2009»
13 years 5 months ago
SISC: A Text Classification Approach Using Semi Supervised Subspace Clustering
Text classification poses some specific challenges. One such challenge is its high dimensionality where each document (data point) contains only a small subset of them. In this pap...
Mohammad Salim Ahmed, Latifur Khan
TRECVID
2008
13 years 9 months ago
National Institute of Informatics, Japan at TRECVID 2008
This paper reports our experiments for TRECVID 2008 tasks: high level feature extraction, search and contentbased copy detection. For the high level feature extraction task, we use...
Duy-Dinh Le, Xiaomeng Wu, Shin'ichi Satoh, Sheetal...
CVPR
2010
IEEE
14 years 3 months ago
Parametric Dimensionality Reduction by Unsupervised Regression
We introduce a parametric version (pDRUR) of the recently proposed Dimensionality Reduction by Unsupervised Regression algorithm. pDRUR alternately minimizes reconstruction error ...
Miguel Carreira-perpinan, Zhengdong Lu