164 search results - page 31 / 33 » Maximally joining probabilistic data |
109
click to vote
KDD
2004
ACM
15 years 10 months ago
2004
ACM
In this paper, we define and study a novel text mining problem, which we refer to as Comparative Text Mining (CTM). Given a set of comparable text collections, the task of compara...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
: Collaborative Dual-PLSA: Mining Distinction and Commonality across Multiple Domains for Text Classification Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yuhong Xiong, Zhon...
ML
2000
ACM
14 years 9 months ago
2000
ACM
This paper shows that the accuracy of learned text classifiers can be improved by augmenting a small number of labeled training documents with a large pool of unlabeled documents. ...
NIPS
2001
14 years 11 months ago
2001
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
101
Voted
NIPS
2003
14 years 11 months ago
2003
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...