Sciweavers

209 search results - page 18 / 42
» t-Spanners for metric space searching
Sort
View
PRL
2010
159views more  PRL 2010»
14 years 8 months ago
Creating diverse nearest-neighbour ensembles using simultaneous metaheuristic feature selection
The nearest-neighbour (1NN) classifier has long been used in pattern recognition, exploratory data analysis, and data mining problems. A vital consideration in obtaining good res...
Muhammad Atif Tahir, Jim E. Smith
ICIP
2003
IEEE
15 years 11 months ago
Generalized pattern matching using orbit decomposition
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
Yacov Hel-Or, Hagit Hel-Or
PAMI
2007
125views more  PAMI 2007»
14 years 9 months ago
Matching by Linear Programming and Successive Convexification
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
Hao Jiang, Mark S. Drew, Ze-Nian Li
KDD
2010
ACM
249views Data Mining» more  KDD 2010»
14 years 12 months ago
Semi-supervised sparse metric learning using alternating linearization optimization
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...
Wei Liu, Shiqian Ma, Dacheng Tao, Jianzhuang Liu, ...
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
15 years 10 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...