695 search results - page 16 / 139 » The structure of intrinsic complexity of learning |
UAI
1996
13 years 8 months ago
1996
In this paper we examine a novel addition to the known methods for learning Bayesian networks from data that improves the quality of the learned networks. Our approach explicitly ...
UAI
1998
13 years 8 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...
PR
2010
13 years 6 months ago
2010
We develop a supervised dimensionality reduction method, called Lorentzian Discriminant Projection (LDP), for feature extraction and classification. Our method represents the str...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we propose a novel and general approach for time-series data mining. As an alternative to traditional ways of designing specific algorithm to mine certain kind of ...
ICCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S,...