Sciweavers

280 search results - page 32 / 56
» Approximate nearest neighbors using sparse representations
Sort
View
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
13 years 3 days ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
81
Voted
ICRA
2005
IEEE
129views Robotics» more  ICRA 2005»
15 years 3 months ago
Exactly Sparse Delayed-State Filters
— This paper presents the novel insight that the SLAM information matrix is exactly sparse in a delayedstate framework. Such a framework is used in view-based representations of ...
Ryan Eustice, Hanumant Singh, John J. Leonard
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
15 years 11 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
15 years 4 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
JMLR
2008
100views more  JMLR 2008»
14 years 9 months ago
Hit Miss Networks with Applications to Instance Selection
In supervised learning, a training set consisting of labeled instances is used by a learning algorithm for generating a model (classifier) that is subsequently employed for decidi...
Elena Marchiori