1403 search results - page 51 / 281 » Set cover algorithms for very large datasets |
FLAIRS
2008
15 years 2 days ago
2008
This paper presents a syntactic path-based learning algorithm (CANDEL from CANDIDATE-ELIMINATION) for the coreference resolution of pronouns that have their antecedents in the sam...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...
BMCBI
2002
14 years 9 months ago
2002
Background: The identification of species or species groups with specific oligo-nucleotides as molecular signatures is becoming increasingly popular for bacterial samples. However...
FGR
2006
IEEE
15 years 1 months ago
2006
IEEE
Non-linear subspaces derived using kernel methods have been found to be superior compared to linear subspaces in modeling or classification tasks of several visual phenomena. Such...
DAWAK
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...