Above are papers related to the following paper: [Paper_ID] Paper #1125402. 	[Title] Learning Convex Sets of Probability from Data [Abstract] Several theories of inference and decision employ sets of probability distributions as the fundamental representation of (subjective) belief. This paper investigates a frequentist connection between empirical data and convex sets of probability distributions. Building on earlier work by Walley and Fine, a framework is advanced in which a sequence of random outcomes can be described as being drawn from a convex set of distributions, rather than just from a single distribution. The extra generality can be detected from observable characteristics of the outcome sequence. The paper presents new asymptotic convergence results paralleling the laws of large numbers in probability theory, and concludes with a comparison between this approach and approaches based on prior subjective constraints. c fl1997 Carnegie Mellon University Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #28964. 	[Title] Robust Parameter Learning in Bayesian Networks with Missing Data [Abstract]  Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #18770. 	[Title] A guide to the literature on learning probabilistic networks from data [Abstract] This literature review discusses different methods under the general rubric of learning Bayesian networks from data, and includes some overlapping work on more general probabilistic networks. Connections are drawn between the statistical, neural network, and uncertainty communities, and between the different methodological communities, such as Bayesian, description length, and classical statistics. Basic concepts for learning and Bayesian networks are introduced and methods are then reviewed. Methods are discussed for learning parameters of a probabilistic network, for learning the structure, and for learning hidden variables. The presentation avoids formal definitions and theorems, as these are plentiful in the literature, and instead illustrates key concepts with simplified examples. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1125944. 	[Title] Temporal abstractions for pre-processing and interpreting diabetes monitoring time series [Abstract] In this paper we describe a number of intelligent data analysis techniques to pre-process and analyze data coming from home monitoring of diabetic patients. In particular, we show how the combination of temporal abstractions with statistical and probabilistic techniques may be applied to derive useful summaries of patients' behaviour over a certain monitoring period. Finally, we describe how Intelligent Data Analysis methods may be used to index past cases to perform a case-based re trieval in a data-base of past cases. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #28957. 	[Title] Operations for Learning with Graphical Models decomposition techniques and the demonstration that graphical models provide [Abstract] This paper is a multidisciplinary review of empirical, statistical learning from a graphical model perspective. Well-known examples of graphical models include Bayesian networks, directed graphs representing a Markov chain, and undirected networks representing a Markov field. These graphical models are extended to model data analysis and empirical learning using the notation of plates. Graphical operations for simplifying and manipulating a problem are provided including decomposition, differentiation, and the manipulation of probability models from the exponential family. Two standard algorithm schemas for learning are reviewed in a graphical framework: Gibbs sampling and the expectation maximization algorithm. Using these operations and schemas, some popular algorithms can be synthesized from their graphical specification. This includes versions of linear regression, techniques for feed-forward networks, and learning Gaussian and discrete Bayesian networks from data. The paper concludes by sketching some implications for data analysis and summarizing how some popular algorithms fall within the framework presented. Please summarise all the given information.

Paper #1125402 has the title `Learning Convex Sets of Probability from Data  
` and the abstract `Several theories of inference and decision employ sets of probability distributions as the fundamental representation of (subjective) belief. This paper investigates a frequentist connection between empirical data and convex sets of probability distributions. Building on earlier work by Walley and Fine, a framework is advanced in which a sequence of random outcomes can be described as being drawn from a convex set of distributions, rather than just from a single distribution. The extra generality can be detected from observable characteristics of the outcome sequence. The paper presents new asymptotic convergence results paralleling the laws of large numbers in probability theory, and concludes with a comparison between this approach and approaches based on prior subjective constraints. c fl1997 Carnegie Mellon University
`.
Question: Which category should Paper #1125402 be classified as ?
You can select one from ['Neural_Networks', 'Case_Based', 'Theory', 'Reinforcement_Learning', 'Probabilistic_Methods', 'Rule_Learning', 'Genetic_Algorithms'].


Paper #1125402 has the title `Learning Convex Sets of Probability from Data  
` and the abstract `Several theories of inference and decision employ sets of probability distributions as the fundamental representation of (subjective) belief. This paper investigates a frequentist connection between empirical data and convex sets of probability distributions. Building on earlier work by Walley and Fine, a framework is advanced in which a sequence of random outcomes can be described as being drawn from a convex set of distributions, rather than just from a single distribution. The extra generality can be detected from observable characteristics of the outcome sequence. The paper presents new asymptotic convergence results paralleling the laws of large numbers in probability theory, and concludes with a comparison between this approach and approaches based on prior subjective constraints. c fl1997 Carnegie Mellon University
`.
Question: Which category should Paper #1125402 be classified as ?
You can select one from ['Neural_Networks', 'Case_Based', 'Theory', 'Reinforcement_Learning', 'Probabilistic_Methods', 'Rule_Learning', 'Genetic_Algorithms'].

This paper should be classified into: Probabilistic_Methods