Sciweavers

475 search results - page 36 / 95
» A Distance-Based Packing Method for High Dimensional Data
Sort
View
ICANN
1997
Springer
14 years 10 days ago
Topology Representing Networks for Intrinsic Dimensionality Estimation
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
Jörg Bruske, Gerald Sommer
BMCBI
2005
112views more  BMCBI 2005»
13 years 8 months ago
Visualization methods for statistical analysis of microarray clusters
Background: The most common method of identifying groups of functionally related genes in microarray data is to apply a clustering algorithm. However, it is impossible to determin...
Matthew A. Hibbs, Nathaniel C. Dirksen, Kai Li, Ol...
CVPR
2008
IEEE
14 years 10 months ago
Margin-based discriminant dimensionality reduction for visual recognition
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
Hakan Cevikalp, Bill Triggs, Frédéri...
IPPS
2007
IEEE
14 years 3 months ago
Coarse-grain Parallel Execution for 2-dimensional PDE Problems
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...
Georgios I. Goumas, Nikolaos Drosinos, Vasileios K...
MCS
2001
Springer
14 years 1 months ago
Input Decimation Ensembles: Decorrelation through Dimensionality Reduction
Using an ensemble of classifiers instead of a single classifier has been shown to improve generalization performance in many machine learning problems [4, 16]. However, the exten...
Nikunj C. Oza, Kagan Tumer