Sciweavers

396 search results - page 16 / 80
» Lossy Reduction for Very High Dimensional Data
Sort
View
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
15 years 9 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
UAI
2000
14 years 10 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
TKDE
2008
133views more  TKDE 2008»
14 years 9 months ago
Rotational Linear Discriminant Analysis Technique for Dimensionality Reduction
The linear discriminant analysis (LDA) technique is very popular in pattern recognition for dimensionality reduction. It is a supervised learning technique that finds a linear tran...
Alok Sharma, Kuldip K. Paliwal
IJCAI
2007
14 years 11 months ago
A Subspace Kernel for Nonlinear Feature Extraction
Kernel based nonlinear Feature Extraction (KFE) or dimensionality reduction is a widely used pre-processing step in pattern classification and data mining tasks. Given a positive...
Mingrui Wu, Jason D. R. Farquhar
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
12 years 12 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...