Sciweavers

164 search results - page 32 / 33
» On k-Anonymity and the Curse of Dimensionality
Sort
View
DAWAK
2006
Springer
13 years 8 months ago
On the Computation of Maximal-Correlated Cuboids Cells
The main idea of iceberg data cubing methods relies on optimization techniques for computing only the cuboids cells above certain minimum support threshold. Even using such approac...
Ronnie Alves, Orlando Belo
ICML
2010
IEEE
13 years 6 months ago
Projection Penalties: Dimension Reduction without Loss
Dimension reduction is popular for learning predictive models in high-dimensional spaces. It can highlight the relevant part of the feature space and avoid the curse of dimensiona...
Yi Zhang 0010, Jeff Schneider
BIODATAMINING
2008
120views more  BIODATAMINING 2008»
13 years 5 months ago
Filling the gap between biology and computer science
This editorial introduces BioData Mining, a new journal which publishes research articles related to advances in computational methods and techniques for the extraction of useful ...
Jesús S. Aguilar-Ruiz, Jason H. Moore, Mary...
BMCBI
2010
154views more  BMCBI 2010»
13 years 5 months ago
An eScience-Bayes strategy for analyzing omics data
Background: The omics fields promise to revolutionize our understanding of biology and biomedicine. However, their potential is compromised by the challenge to analyze the huge da...
Martin Eklund, Ola Spjuth, Jarl E. S. Wikberg
BMCBI
2006
140views more  BMCBI 2006»
13 years 5 months ago
Feature selection using Haar wavelet power spectrum
Background: Feature selection is an approach to overcome the 'curse of dimensionality' in complex researches like disease classification using microarrays. Statistical m...
Prabakaran Subramani, Rajendra Sahu, Shekhar Verma