Sciweavers

571 search results - page 4 / 115
» Testing homogeneity of a large data set by bootstrapping
Sort
View
EMNLP
2007
13 years 8 months ago
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
David A. Smith, Jason Eisner
BMCBI
2007
102views more  BMCBI 2007»
13 years 7 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...
EUROPAR
1999
Springer
13 years 11 months ago
Parallel k/h-Means Clustering for Large Data Sets
This paper describes the realization of a parallel version of the k/h-means clustering algorithm. This is one of the basic algorithms used in a wide range of data mining tasks. We ...
Kilian Stoffel, Abdelkader Belkoniene
CSDA
2006
233views more  CSDA 2006»
13 years 7 months ago
Analysis of Type-II progressively hybrid censored data
The mixture of Type-I and Type-II censoring schemes, called the hybrid censoring scheme is quite common in life-testing or reliability experiments. Recently Type-II progressive ce...
Debasis Kundu, Avijit Joarder
BMCBI
2008
133views more  BMCBI 2008»
13 years 7 months ago
A Web-based and Grid-enabled dChip version for the analysis of large sets of gene expression data
Background: Microarray techniques are one of the main methods used to investigate thousands of gene expression profiles for enlightening complex biological processes responsible f...
Luca Corradi, Marco Fato, Ivan Porro, Silvia Scagl...