DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Sung-Ho | ko |
dc.contributor.author | Lee, S. | ko |
dc.date.accessioned | 2013-03-27T08:36:24Z | - |
dc.date.available | 2013-03-27T08:36:24Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2008-02-13 | - |
dc.identifier.citation | IASTED International Conference on Artificial Intelligence and Applications, AIA 2008, pp.116 - 120 | - |
dc.identifier.uri | http://hdl.handle.net/10203/160904 | - |
dc.description.abstract | Suppose that we are interested in modeling for a random vector X and that we are given a set of graphical decomposable models, G1, ⋯ , Gm, for subvectors of X each of which share some variables with at least one of the other models. Under the assumption that the model of X is graphical and decomposable, we propose an approach of searching for models of X based on the given decomposable graphical models. A main idea in this approach is that we combine G1, ⋯ , Gm using graphs of prime separators (section 2). When the true graphical model for the whole data is decomposable, prime separators in a marginal model are also prime separators in a maximal combined model of the marginal models. This property plays a key role in model-combination. The proposed approach is applied to searching for a model of 100 variables for illustration. | - |
dc.language | English | - |
dc.publisher | AIA | - |
dc.title | A model searching method based on marginal model structures | - |
dc.type | Conference | - |
dc.identifier.scopusid | 2-s2.0-62849109152 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 116 | - |
dc.citation.endingpage | 120 | - |
dc.citation.publicationname | IASTED International Conference on Artificial Intelligence and Applications, AIA 2008 | - |
dc.identifier.conferencecountry | AU | - |
dc.identifier.conferencelocation | Innsbruck | - |
dc.contributor.localauthor | Kim, Sung-Ho | - |
dc.contributor.nonIdAuthor | Lee, S. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.