4591 search results - page 401 / 919 » Learning from Dyadic Data |
221
click to vote
NIPS
2004
15 years 9 months ago
2004
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
183
click to vote
UAI
1998
15 years 9 months ago
1998
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this paper we examine how to learn the structure of a DPN from data. We extend stru...
198
click to vote
NPL
2006
15 years 7 months ago
2006
Hierarchical Incremental Class Learning (HICL) is a new task decomposition method that addresses the pattern classification problem. HICL is proven to be a good classifier but clos...
230
click to vote
TCSV
2008
15 years 7 months ago
2008
Abstract--This paper presents a survey of trajectory-based activity analysis for visual surveillance. It describes techniques that use trajectory data to define a general set of ac...
198
click to vote
VLDB
2002
ACM
15 years 7 months ago
2002
ACM
Deduplication, a key operation in integrating data from multiple sources, is a time-consuming, labor-intensive and domainspecific operation. We present our design of alias that us...