Sciweavers

966 search results - page 88 / 194
» A Two-Level Learning Method for Generalized Multi-instance P...
Sort
View
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 3 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
96
Voted
ICML
2009
IEEE
16 years 3 months ago
Multi-assignment clustering for Boolean data
Conventional clustering methods typically assume that each data item belongs to a single cluster. This assumption does not hold in general. In order to overcome this limitation, w...
Andreas P. Streich, Mario Frank, David A. Basin, J...
144
Voted
SIGIR
2011
ACM
14 years 5 months ago
Learning online discussion structures by conditional random fields
Online forum discussions are emerging as valuable information repository, where knowledge is accumulated by the interaction among users, leading to multiple threads with structure...
Hongning Wang, Chi Wang, ChengXiang Zhai, Jiawei H...
158
Voted
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
16 years 3 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
121
Voted
CIKM
2007
Springer
15 years 8 months ago
Structure and semantics for expressive text kernels
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...
Stephan Bloehdorn, Alessandro Moschitti