Sciweavers

334 search results - page 50 / 67
» Local Dimensionality Reduction: A New Approach to Indexing H...
Sort
View
GRC
2010
IEEE
13 years 8 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
CVPR
2005
IEEE
14 years 9 months ago
Kernel-Based Bayesian Filtering for Object Tracking
Particle filtering provides a general framework for propagating probability density functions in non-linear and non-Gaussian systems. However, the algorithm is based on a Monte Ca...
Bohyung Han, Ying Zhu, Dorin Comaniciu, Larry S. D...
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
14 years 1 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad
BMCBI
2006
202views more  BMCBI 2006»
13 years 7 months ago
Spectral embedding finds meaningful (relevant) structure in image and microarray data
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
Brandon W. Higgs, Jennifer W. Weller, Jeffrey L. S...
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 2 months ago
Orca Reduction and ContrAction Graph Clustering
During the last years, a wide range of huge networks has been made available to researchers. The discovery of natural groups, a task called graph clustering, in such datasets is a ...
Daniel Delling, Robert Görke, Christian Schul...