Sciweavers

1197 search results - page 149 / 240
» Classification with partial labels
Sort
View
DIS
2004
Springer
15 years 6 months ago
Generating AVTs Using GA for Learning Decision Tree Classifiers with Missing Data
Abstract. Attribute value taxonomies (AVTs) have been used to perform AVT-guided decision tree learning on partially or totally missing data. In many cases, user-supplied AVTs are ...
Jinu Joo, Jun Zhang 0002, Jihoon Yang, Vasant Hona...
COLING
2008
15 years 4 months ago
Instance-Based Ontology Population Exploiting Named-Entity Substitution
We present an approach to ontology population based on a lexical substitution technique. It consists in estimating the plausibility of sentences where the named entity to be class...
Claudio Giuliano, Alfio Massimiliano Gliozzo
133
Voted
DAGSTUHL
2006
15 years 4 months ago
New Algebraic Tools for Constraint Satisfaction
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
Henning Schnoor, Ilka Schnoor
112
Voted
NA
2006
123views more  NA 2006»
15 years 2 months ago
Restarted block Lanczos bidiagonalization methods
Abstract. The problem of computing a few of the largest or smallest singular values and associated singular vectors of a large matrix arises in many applications. This paper descri...
James Baglama, Lothar Reichel
104
Voted
COMBINATORICS
2000
101views more  COMBINATORICS 2000»
15 years 2 months ago
Bound Graph Polysemy
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
Paul J. Tanenbaum