Sciweavers

4196 search results - page 619 / 840
» Unsupervised Learning of Relations
Sort
View
97
Voted
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
16 years 4 months ago
Mining reference tables for automatic text segmentation
Automatically segmenting unstructured text strings into structured records is necessary for importing the information contained in legacy sources and text collections into a data ...
Eugene Agichtein, Venkatesh Ganti
ALT
2009
Springer
16 years 1 months ago
Complexity versus Agreement for Many Views
Abstract. The paper considers the problem of semi-supervised multiview classification, where each view corresponds to a Reproducing Kernel Hilbert Space. An algorithm based on co-...
Odalric-Ambrym Maillard, Nicolas Vayatis
ALT
2008
Springer
16 years 1 months ago
Entropy Regularized LPBoost
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
Manfred K. Warmuth, Karen A. Glocer, S. V. N. Vish...
ALT
2002
Springer
16 years 1 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...
SIGCSE
2010
ACM
181views Education» more  SIGCSE 2010»
15 years 11 months ago
Teaching the principles of the hacker curriculum to undergraduates
The “Hacker Curriculum” exists as a mostly undocumented set of principles and methods for learning about information security. Hacking, in our view, is defined by the ability...
Sergey Bratus, Anna Shubina, Michael E. Locasto