Sciweavers

1403 search results - page 85 / 281
» Set cover algorithms for very large datasets
Sort
View
BMCBI
2010
134views more  BMCBI 2010»
14 years 10 months ago
R-Gada: a fast and flexible pipeline for copy number analysis in association studies
Background: Genome-wide association studies (GWAS) using Copy Number Variation (CNV) are becoming a central focus of genetic research. CNVs have successfully provided target genom...
Roger Pique-Regi, Alejandro Cáceres, Juan R...
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
14 years 11 months ago
Creating a Cluster Hierarchy under Constraints of a Partially Known Hierarchy
Although clustering under constraints is a current research topic, a hierarchical setting, in which a hierarchy of clusters is the goal, is usually not considered. This paper trie...
Korinna Bade, Andreas Nürnberger
DMIN
2009
195views Data Mining» more  DMIN 2009»
14 years 7 months ago
Improved k-NN Algorithm for Text Classification
- Over the last twenty years, text classification has become one of the key techniques for organizing electronic information such as text and web documents. The k-Nearest Neighbor ...
Muhammed Miah
CVPR
2010
IEEE
15 years 6 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
SEMWEB
2009
Springer
15 years 4 months ago
Results of OKKAM Feature based Entity Matching Algorithm for Instance Matching Contest of OAEI 2009
To investigate the problem of entity recognition, we deal with the creation of the so-called Entity Name System (ENS) which is an open, public back-bone infrastructure for the (Sem...
Heiko Stoermer, Nataliya Rassadko