Sciweavers

58 search results - page 6 / 12
» Relating Equivalence and Reducibility to Sparse Sets
Sort
View
BMCBI
2010
144views more  BMCBI 2010»
13 years 7 months ago
Super-sparse principal component analyses for high-throughput genomic data
Background: Principal component analysis (PCA) has gained popularity as a method for the analysis of highdimensional genomic data. However, it is often difficult to interpret the ...
Donghwan Lee, Woojoo Lee, Youngjo Lee, Yudi Pawita...
ISIPTA
2003
IEEE
130views Mathematics» more  ISIPTA 2003»
14 years 28 days ago
Some Results on Generalized Coherence of Conditional Probability Bounds
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo
PRL
2006
121views more  PRL 2006»
13 years 7 months ago
Information-preserving hybrid data reduction based on fuzzy-rough techniques
Data reduction plays an important role in machine learning and pattern recognition with a high-dimensional data. In real-world applications data usually exists with hybrid formats...
Qinghua Hu, Daren Yu, Zongxia Xie
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 9 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
ECAI
2004
Springer
14 years 1 months ago
New Insights on the Intuitionistic Interpretation of Default Logic
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
Pedro Cabalar, David Lorenzo