Sciweavers

843 search results - page 62 / 169
» Learning aspect models with partially labeled data
Sort
View
EMNLP
2008
15 years 5 months ago
Joint Unsupervised Coreference Resolution with Markov Logic
Machine learning approaches to coreference resolution are typically supervised, and require expensive labeled data. Some unsupervised approaches have been proposed (e.g., Haghighi...
Hoifung Poon, Pedro Domingos
AI
2007
Springer
15 years 4 months ago
Learning action models from plan examples using weighted MAX-SAT
AI planning requires the definition of action models using a formal action and plan description language, such as the standard Planning Domain Definition Language (PDDL), as inp...
Qiang Yang, Kangheng Wu, Yunfei Jiang
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
15 years 9 months ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei
ECML
2005
Springer
15 years 9 months ago
Multi-view Discriminative Sequential Learning
Discriminative learning techniques for sequential data have proven to be more effective than generative models for named entity recognition, information extraction, and other task...
Ulf Brefeld, Christoph Büscher, Tobias Scheff...
128
Voted
WWW
2009
ACM
16 years 4 months ago
A dynamic bayesian network click model for web search ranking
As with any application of machine learning, web search ranking requires labeled data. The labels usually come in the form of relevance assessments made by editors. Click logs can...
Olivier Chapelle, Ya Zhang