Sciweavers

164 search results - page 28 / 33
» On k-Anonymity and the Curse of Dimensionality
Sort
View
GRC
2010
IEEE
14 years 10 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
BMCBI
2005
118views more  BMCBI 2005»
14 years 9 months ago
Feature selection and nearest centroid classification for protein mass spectrometry
Background: The use of mass spectrometry as a proteomics tool is poised to revolutionize early disease diagnosis and biomarker identification. Unfortunately, before standard super...
Ilya Levner
CVPR
2005
IEEE
15 years 11 months ago
Discriminant Analysis with Tensor Representation
In this paper, we present a novel approach to solving the supervised dimensionality reduction problem by encoding an image object as a general tensor of 2nd or higher order. First...
Shuicheng Yan, Dong Xu, Qiang Yang, Lei Zhang, Xia...
ICML
2000
IEEE
15 years 10 months ago
On-line Learning for Humanoid Robot Systems
Humanoid robots are high-dimensional movement systems for which analytical system identification and control methods are insufficient due to unknown nonlinearities in the system s...
Gaurav Tevatia, Jörg Conradt, Sethu Vijayakum...
SISAP
2009
IEEE
155views Data Mining» more  SISAP 2009»
15 years 4 months ago
Analyzing Metric Space Indexes: What For?
—It has been a long way since the beginnings of metric space searching, where people coming from algorithmics tried to apply their background to this new paradigm, obtaining vari...
Gonzalo Navarro