Slide 28
Slide 28 text
Classifier
d combine them linearly in the argument of an
onential. Mathematically, the goodness g
(
q
)
of a
ential query q with feature values fi(
q
)
is
g
(
q
) = exp(
X
i
ifi(
q
))
.
eatures can be binary or real-valued, with 0 being th
ue of an uninformative feature. Parameters of the
ssifier, i
, can be learned across a collection of record
ning gestures to tune the quality of the classifier. Fo
liminary experiments in Section , these parameters a
manually, and tuning using training data is scope fo
ther improvement in quality. New queries can be
• g(q) = “Goodness” of a query, probability distribution of SQL
queries
• fi
= features from
• Relative Position information (gesture + objects)
• Schema compatibility
• Data compatibility (distribution)
• λ learned from training