1339 search results - page 178 / 268 » Robust learning from bites for data mining |
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
102
click to vote
AUSAI
2008
Springer
14 years 11 months ago
2008
Springer
Classifiers are traditionally learned using sets of positive and negative training examples. However, often a classifier is required, but for training only an incomplete set of pos...
JMLR
2010
14 years 4 months ago
2010
Supervised learning from multiple labeling sources is an increasingly important problem in machine learning and data mining. This paper develops a probabilistic approach to this p...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
We briefly survey several privacy compromises in published datasets, some historical and some on paper. An inspection of these suggests that the problem lies with the nature of the...
171
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract-- Many applications are driven by evolving data -patterns in web traffic, program execution traces, network event logs, etc., are often non-stationary. Building prediction...