Sciweavers

730 search results - page 87 / 146
» Faster dimension reduction
Sort
View
SDM
2004
SIAM
162views Data Mining» more  SDM 2004»
13 years 10 months ago
Subspace Clustering of High Dimensional Data
Clustering suffers from the curse of dimensionality, and similarity functions that use all input features with equal relevance may not be effective. We introduce an algorithm that...
Carlotta Domeniconi, Dimitris Papadopoulos, Dimitr...
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 3 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
ICDAR
2011
IEEE
12 years 8 months ago
A New Feature Optimization Method Based on Two-Directional 2DLDA for Handwritten Chinese Character Recognition
—LDA transformation is one of the popular feature dimension reduction techniques for the feature extraction in most handwritten Chinese characters recognition systems. The integr...
Xue Gao, Wenhuan Wen, Lianwen Jin
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
11 years 11 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...
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 9 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani