Probabilistic modeling has been a dominant approach in Machine Learning research. As the field evolves, the problems of interest become increasingly challenging and complex. Makin...
Ming-Wei Chang, Lev-Arie Ratinov, Nicholas Rizzolo...
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Traditional Active Learning (AL) techniques assume that the annotation of each datum costs the same. This is not the case when annotating sequences; some sequences will take longe...
Robbie Haertel, Eric K. Ringger, Kevin D. Seppi, J...
Data sparsity is a major problem for collaborative filtering (CF) techniques in recommender systems, especially for new users and items. We observe that, while our target data are...
Weike Pan, Evan Wei Xiang, Nathan Nan Liu, Qiang Y...
We present the problem of categorizing web services according to a shallow ontology for presentation on a specialist portal, using their WSDL and associated textual documents foun...