Sciweavers

4324 search results - page 60 / 865
» A Generalized Representer Theorem
Sort
View
SDM
2008
SIAM
176views Data Mining» more  SDM 2008»
15 years 5 months ago
A General Model for Multiple View Unsupervised Learning
Multiple view data, which have multiple representations from different feature spaces or graph spaces, arise in various data mining applications such as information retrieval, bio...
Bo Long, Philip S. Yu, Zhongfei (Mark) Zhang
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 4 months ago
Differential privacy and robust statistics
We show by means of several examples that robust statistical estimators present an excellent starting point for differentially private estimators. Our algorithms use a new paradig...
Cynthia Dwork, Jing Lei
157
Voted
TLCA
2009
Springer
15 years 10 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey
122
Voted
AMW
2010
15 years 5 months ago
What You Must Remember When Processing Data Words
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characteriza...
Michael Benedikt, Clemens Ley, Gabriele Puppis
117
Voted
SLOGICA
2008
73views more  SLOGICA 2008»
15 years 3 months ago
Some Aspects of Polyadic Inductive Logic
We give a brief account of some de Finetti style representation theorems for probability functions satisfying Spectrum Exchangeability in Polyadic Inductive Logic, together with ap...
Jürgen Landes, Jeff B. Paris, Alena Vencovsk&...