Sciweavers

221 search results - page 37 / 45
» On Approximating the Radii of Point Sets in High Dimensions
Sort
View
NIPS
2003
13 years 9 months ago
Locality Preserving Projections
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
Xiaofei He, Partha Niyogi
CGF
2010
171views more  CGF 2010»
13 years 4 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
DPHOTO
2010
208views Hardware» more  DPHOTO 2010»
13 years 9 months ago
A signature analysis based method for elliptical shape
The high level context image analysis regards many fields as face recognition, smile detection, automatic red eye removal, iris recognition, fingerprint verification, etc. Techniq...
Ivana Guarneri, Mirko Guarnera, Giuseppe Messina, ...
KDD
2009
ACM
298views Data Mining» more  KDD 2009»
14 years 2 months ago
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
Rong Pan, Martin Scholz
SIGMOD
1989
ACM
94views Database» more  SIGMOD 1989»
13 years 11 months ago
Redundancy in Spatial Databases
Spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usually require the use of approximations that can be arbitrarily bad. This leads ...
Jack A. Orenstein