-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram.html
More file actions
264 lines (247 loc) · 13.8 KB
/
Copy pathprogram.html
File metadata and controls
264 lines (247 loc) · 13.8 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
---
title: Program
layout: default
---
<h1>Program Schedule for Uncertainty 99</h1>
<h2>Tutorials: Sunday, January 3, 1999 </h2>
<ul>
<li><b>Tutorial A: 8:30am -
10:30am</b>
<p>Susan Dumais, Microsoft Research<br>
<a href="dumais.htm">Information Access and Retrieval</a>
<p></p>
<li><b>Tutorial B: 11:00am - 12:00pm
and 1:30pm - 2:30pm</b>
<p>David Spiegelhalter, MRC Biostatistics Unit,
Institute for Public Health, Cambridge<br>
<a href="spiegelh.htm">Bayesian Statistical Analysis</a>
<p></p>
<li><b>Tutorial C: 3.30pm -
5:00pm</b>
<p>Trevor Hastie, Stanford University<br>
<a href="hastie.htm">Additive Logistic Regression: A Statistical View of Boosting</a>
<p></p>
<li><b>Banquet: 7:00pm</b>
<p>Speaker: Ed George </p></li></ul>
<h2>Monday Jan 4 </h2>
<ul>
<p>7:30 to 8:45 REGISTRATION/CONTINENTAL BREAKFAST
<p>8:45 to 9:00 OPENING COMMENTS
<br>David Heckerman, Joe Whittaker
<p>9:00 to 11:00 SESSION 1 <b>Model
Choice</b> CHAIR: Thomas Richardson
<table>
<tr>
<td>Pedro Domingos </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/proceval.htm">Process-oriented evaluation: The next step</a></td></tr>
<tr>
<td>Alan Gelfand, Sujit Ghosh </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/modelcho.htm">Model choice</a></td></tr>
<tr>
<td>Murlikrishna Viswanathan </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/comppoly.htm">A note on the comparison of polynomial selection methods</a></td></tr>
<tr>
<td>Matthew Brand </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/brand.htm">Pattern discovery via entropy minimization</a></td></tr>
</table>
<p>11:00 to 11:30 BREAK
<p>11:30 to 12:30 SESSION 2 <b>Latent variables </b>CHAIR: Kathyrn Laskey
<table>
<tr>
<td>Dan Geiger, David Heckerman, Henry King,
Chris Meek </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/geiger.htm">On the geometry of DAG models with hidden variables</a></td></tr>
<tr>
<td>Thomas Richardson, Heiko Bailer,
Mooulinath Bannerjee </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/banerjee.htm">Efficient structure search in the presence of latent
variables</a></td></tr></table>
<p>12:30 to 1:30 LUNCH (provided)
<p>1:30 to 5:00 BREAK
<p>5:00 to 6:00 POSTER SUMMARIES (2 mins/poster) CHAIR: Joe Whittaker
<p>6:00 to 7:00 DINNER
<p>7:00 to 9:30 POSTER SESSIONS </p></ul>
<h2>Tuesday Jan 5</h2>
<ul>
<p>8:00 to 9:00 CONTINENTAL BREAKFAST
<p>9:00 to 10:00 SESSION 3 <b>Theory</b> CHAIR: David Madigan
<table>
<tr>
<td>Phil Dawid, Milan Studeny </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/dawstud.htm">Conditional products: an alternative approach to
conditional independence</a></td></tr>
<tr>
<td>Wenxin Jiang, Martin Tanner </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/himixexp.htm">Hierarchical mixtures-of-experts for generalized linear
models:some results on denseness and consistency</a></td></tr>
</table>
<p>10:00 to 10:30 COFFEE BREAK
<p>10:30 to 11:30 SESSION 4 <b>Regression </b>CHAIR: Padhraic Smyth
<table>
<tr>
<td>Greg Ridgeway, David Madigan, Thomas
Richardson </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/boostmet.htm">Boosting methodology for regression problems</a></td></tr>
<tr>
<td>Tommi Jaakkola, David Haussler </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/jaakkola.htm">Probabilistic kernel regression models</a></td></tr></table>
<p>11:30 to 12:30 SESSION 5 <b>Computational Methods </b>CHAIR: Padhraic Smyth
<table>
<tr>
<td>Nir Friedman, Lise Getoor </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/getoor.htm">Learning structure from data efficiently: applying bounding
techniques</a></td></tr>
<tr>
<td>Tim Oates, Paul Cohen, Casey Durfee </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/oates.htm">Efficient mining of statistical dependencies</a></td></tr>
</table>
<p>12:30 to 2:00 LUNCH (provided)
<p>2:00 to 3:30 SESSION 6 <b>Applications </b>CHAIR:
<table>
<tr>
<td>Louis A Cox </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/predchem.htm">Causal mechanisms and classification trees for predicting
chemical carcinogens</a></td></tr>
<tr>
<td>Jan De Geeter </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/degeeter.htm">Geometric modelling of a nuclear environment</a></td></tr>
<tr>
<td>Lewis Frey, Doug Fisher </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/frey.htm">Modeling decision tree performance with the power law</a></td></tr></a></td></tr></table>
<p>3:30 to 4:40 BUSINESS MEETING</p></ul>
<h2>Wednesday Jan 6 </h2>
<ul>
<p>8:00 to 9:00 CONTINENTAL BREAKFAST
<p>9:00 to 10:30 SESSION 7 <b>Inference</b> CHAIR: Greg Cooper
<table>
<tr>
<td>Michael Haft, Reimar Hofmann, Volker
Tresp </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/haft.htm">Model-independent mean field theory as a local method for
approximate propagation of information</a></td></tr>
<tr>
<td>H Attias </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/attias.htm">Hierarchical IFA belief networks</a></td></tr>
<tr>
<td>Kalev Kask, Rina Dechter </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/.htm">Stochastic local search for Bayesian network</a></td></tr></table>
<p>10:30 to 11:00 COFFEE BREAK
<p>11:00 to 12:00 SESSION 8 <b>Applications </b>CHAIR: Doug Fisher
<table>
<tr>
<td>Peter Spirtes, Greg Cooper </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/.htm">An
experiment in causal discovery using a pneumona database</a></td></tr>
<tr>
<td>David Madigan </td>
<td><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/.htm">Bayesian graphical models for non-compliance in randomaized
trials</a></td></tr></table>
<p>12:00 to 12:15 CLOSING REMARKS </p></ul>
<hr color="#000055">
<font size="+1">Plenary Presentations will last 25 minutes with 5 minutes for questions</font>
<hr color="#000055">
<br>
<h2 designtimesp="27700">Poster Sessions</h2>
<p designtimesp="27701">
<table designtimesp="27702">
<tbody>
<tr designtimesp="27703">
<td designtimesp="27704">Almond Herskovits Mislevey Steinberg </td>
<td designtimesp="27705"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/almond.htm">Transfer of information between system and evidence
models</a> </td></tr>
<tr designtimesp="27706">
<td designtimesp="27707">Chien George </td>
<td designtimesp="27708"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/chien.htm">Bayesian collaborative filtering</a> </td></tr>
<tr designtimesp="27709">
<td designtimesp="27710">Cowell </td>
<td designtimesp="27711">Parameter learning from incomplete data for Bayesian
networks </td></tr>
<tr designtimesp="27712">
<td designtimesp="27713">Friedman Goldszmidt Wyner </td>
<td designtimesp="27714"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/nfriedma.htm">On the application of the bootstrap for computing
confidence measures on features of induced Bayesian networks</a></td></tr>
<tr designtimesp="27715">
<td designtimesp="27716">Golinelli Madigan Consonni </td>
<td designtimesp="27717"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/golinell.htm">Relaxing the local independence assumption for
quantitative learning in acyclic directed graphical models through hierarchical
partition models</a> </td></tr>
<tr designtimesp="27718">
<td designtimesp="27719">Humphreys Titterington </td>
<td designtimesp="27720"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/binabolt.htm">A new method of learning in binary Boltzmann machines</a>
</td></tr>
<tr designtimesp="27721">
<td designtimesp="27722">Jensen </td>
<td designtimesp="27723">Statistical Challenges to inductive inference in linked
data </td></tr>
<tr designtimesp="27724">
<td designtimesp="27725">Jorgensen Hunt </td>
<td designtimesp="27726"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/jorgense.htm">Mixture model clustering with the multimix program</a>
</td></tr>
<tr designtimesp="27727">
<td designtimesp="27728">Keogh Pazzani </td>
<td designtimesp="27729"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/keogh.htm">Algorithms for learning augmented bayesian classifiers</a>
</td></tr>
<tr designtimesp="27730">
<td designtimesp="27731">Kontkanen Myllymaki Silander Tirri </td>
<td designtimesp="27732">Exploring the robustness of Bayesian and
information-theoretic methods for predictive inference </td></tr>
<tr designtimesp="27733">
<td designtimesp="27734">Kreutz Reimetz Sendhoff Weihs Seelen </td>
<td designtimesp="27735"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/optidens.htm">Structure optimization of density estimation models
applied to regression problems with dynamic noise</a> </td></tr>
<tr designtimesp="27736">
<td designtimesp="27737">Larkin </td>
<td designtimesp="27738">A learning rule based method of feature extraction with
application to acoustic signal classification </td></tr>
<tr designtimesp="27739">
<td designtimesp="27740">Laskey </td>
<td designtimesp="27741"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/laskey.htm">Learning extensible multi-entity directed graphical
models</a> </td></tr>
<tr designtimesp="27742">
<td designtimesp="27743">Monti Cooper </td>
<td designtimesp="27744"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/cbdiscre.htm">A latent variable model for multivariate discretization</a>
</td></tr>
<tr designtimesp="27745">
<td designtimesp="27746">Pearl Meshkat </td>
<td designtimesp="27747"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/pearl.htm">Testing regression models with fewer regressors</a>
</td></tr>
<tr designtimesp="27748">
<td designtimesp="27749">Ramoni Sebastiani </td>
<td designtimesp="27750"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/ramoni.htm">Learning conditional probabilities from incomplete
data: an experimental comparison</a> </td></tr>
<tr designtimesp="27751">
<td designtimesp="27752">Rida Labbi Pelegrini </td>
<td designtimesp="27753"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/rida.htm">Experts combination through density decomposition</a>
</td></tr>
<tr designtimesp="27754">
<td designtimesp="27755">Roedder </td>
<td designtimesp="27756"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/roedder.htm">Entropy driven probabilistic inference and
inconsistency</a> </td></tr>
<tr designtimesp="27757">
<td designtimesp="27758">Schmill Cohen </td>
<td designtimesp="27759"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/schmill.htm">Learned models for continuous planning</a> </td></tr>
<tr designtimesp="27760">
<td designtimesp="27761">Schubert </td>
<td designtimesp="27762"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/optkalgo.htm">Efficient optimization of large k real-time control
algorithm</a></td></tr>
<tr designtimesp="27763">
<td designtimesp="27764">Sebastiani Ramoni </td>
<td designtimesp="27765"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/sebastia.htm">Model folding for data subject to nonresponse</a>
</td></tr>
<tr designtimesp="27766">
<td designtimesp="27767">Settimi Smith </td>
<td designtimesp="27768"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/settimi.htm">Geometry moments and Bayesian networks with hidden
variables</a> </td></tr>
<tr designtimesp="27769">
<td designtimesp="27770">Smyth </td>
<td designtimesp="27771">Joint probabilistic clustering of multivariate and
sequential data </td></tr>
<tr designtimesp="27772">
<td designtimesp="27773">Stanghellini Whittaker </td>
<td designtimesp="27774"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/stanghel.htm">Analysis of multivariate time series via a hidden
graphical model</a> </td></tr>
<tr designtimesp="27775">
<td designtimesp="27776">Vogler </td>
<td designtimesp="27777"><a href="http://web.archive.org/web/20011025032302/http://www.maths.lancs.ac.uk/probnetap.htm">Visual design support for probabilistic network
application</a> </td></tr></tbody></table>
<p>