2512 search results - page 185 / 503 » Learning from Highly Structured Data by Decomposition |
126
click to vote
LREC
2008
15 years 5 months ago
2008
The ultimate goal when building dialogue systems is to satisfy the needs of real users, but quality assurance for dialogue strategies is a non-trivial problem. The applied evaluat...
115
click to vote
JMLR
2007
15 years 4 months ago
2007
We show that, given data from a mixture of k well-separated spherical Gaussians in Rd, a simple two-round variant of EM will, with high probability, learn the parameters of the Ga...
134
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
We empirically study the relationship between supervised and multiple instance (MI) learning. Algorithms to learn various concepts have been adapted to the MI representation. Howe...
190
click to vote
WWW
2011
ACM
14 years 10 months ago
2011
ACM
Web pages are usually highly structured documents. In some documents, content with different functionality is laid out in blocks, some merely supporting the main discourse. In ot...
119
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...