Sciweavers

1083 search results - page 86 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 6 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
JMLR
2010
161views more  JMLR 2010»
15 years 1 months ago
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...
Yin-Wen Chang, Cho-Jui Hsieh, Kai-Wei Chang, Micha...
DMKD
1999
ACM
108views Data Mining» more  DMKD 1999»
15 years 10 months ago
Classification as Mining and Use of Labeled Itemsets
We investigate the relationship between association and classification mining. The main issue in association mining is the discovery of interesting patterns of the data, so called...
Dimitris Meretakis, Beat Wüthrich
BMCBI
2007
148views more  BMCBI 2007»
15 years 6 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...
BMCBI
2007
215views more  BMCBI 2007»
15 years 6 months ago
Learning causal networks from systems biology time course data: an effective model selection procedure for the vector autoregres
Background: Causal networks based on the vector autoregressive (VAR) process are a promising statistical tool for modeling regulatory interactions in a cell. However, learning the...
Rainer Opgen-Rhein, Korbinian Strimmer