Sciweavers

475 search results - page 27 / 95
» A Distance-Based Packing Method for High Dimensional Data
Sort
View
BMCBI
2006
92views more  BMCBI 2006»
13 years 7 months ago
Recrafting the neighbor-joining method
Background: The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical (n3)...
Thomas Mailund, Gerth Stølting Brodal, Rolf...
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
11 years 10 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...
PKDD
2009
Springer
153views Data Mining» more  PKDD 2009»
14 years 2 months ago
Subspace Regularization: A New Semi-supervised Learning Method
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
Yan-Ming Zhang, Xinwen Hou, Shiming Xiang, Cheng-L...
CVPR
2008
IEEE
14 years 9 months ago
Dimensionality reduction by unsupervised regression
We consider the problem of dimensionality reduction, where given high-dimensional data we want to estimate two mappings: from high to low dimension (dimensionality reduction) and f...
Miguel Á. Carreira-Perpiñán, ...
EDBT
2006
ACM
154views Database» more  EDBT 2006»
13 years 11 months ago
Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
Christoph Brochhaus, Marc Wichterich, Thomas Seidl