Learning Markov Network Structures Constrained by Context-Specific Independences | ||
| dc.conicet.avisoEditorial | Electronic version of an article published as [International Journal on Artificial Intelligence Tools, 23, 06, December 2014, 1460030 [43 pages] https://doi.org/10.1142/S0218213014600306 © World Scientific Publishing Company http://www.worldscientific.com/worldscinet/ijait | * |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mendoza | |
| dc.conicet.organizacion | Universidad Tecnológica Nacional. Facultad Regional Mendoza. Departamento de Sistemas de Información | |
| dc.conicet.organizacion | Universidad Tecnológica Nacional. Facultad Regional Mendoza. Departamento de Sistemas de Información | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mendoza | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mendoza | |
| dc.conicet.organizacion | Universidad Tecnológica Nacional. Facultad Regional Mendoza. Departamento de Sistemas de Información | |
| dc.contributor.author | Edera, Alejandro | |
| dc.contributor.author | Schluter, Federico Enrique Adolfo | |
| dc.contributor.author | Bromberg, Facundo | |
| dc.date.issued | 2014-12 | |
| dc.description.abstract | This work focuses on learning the structure of Markov networks from data. Markov networks are parametric models for compactly representing complex probability distributions. These models are composed by: a structure and numerical weights, where the structure describes independences that hold in the distribution. Depending on which is the goal of structure learning, learning algorithms can be divided into: density estimation algorithms, where structure is learned for answering inference queries; and knowledge discovery algorithms, where structure is learned for describing independences qualitatively. The latter algorithms present an important limitation for describing independences because they use a single graph; a coarse grain structure representation which cannot represent flexible independences. For instance, context-specific independences cannot be described by a single graph. To overcome this limitation, this work proposes a new alternative representation named canonical model as well as the CSPC algorithm; a novel knowledge discovery algorithm for learning canonical models by using context-specific independences as constraints. On an extensive empirical evaluation, CSPC learns more accurate structures than state-of-the-art density estimation and knowledge discovery algorithms. Moreover, for answering inference queries, our approach obtains competitive results against density estimation algorithms, significantly outperforming knowledge discovery algorithms. | es |
| dc.description.fil | Fil: Edera, Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mendoza; Argentina. Universidad Tecnológica Nacional. Facultad Regional Mendoza. Departamento de Sistemas de Información; Argentina | |
| dc.description.fil | Fil: Schluter, Federico Enrique Adolfo. Universidad Tecnológica Nacional. Facultad Regional Mendoza. Departamento de Sistemas de Información; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mendoza; Argentina | |
| dc.description.fil | Fil: Bromberg, Facundo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mendoza; Argentina. Universidad Tecnológica Nacional. Facultad Regional Mendoza. Departamento de Sistemas de Información; Argentina | |
| dc.format | application/pdf | es |
| dc.identifier.citation | Bromberg, Facundo; Schluter, Federico Enrique Adolfo; Edera, Alejandro; Learning Markov Network Structures Constrained by Context-Specific Independences; World Scientific; International Journal On Artificial Intelligence Tools; 23; 6; 12-2014; 1-43 | es |
| dc.identifier.eissn | 1793-6349 | es |
| dc.identifier.institucional | CONICET | |
| dc.identifier.issn | 0218-2130 | es |
| dc.identifier.repo | CONICET Digital | |
| dc.identifier.uri | http://hdl.handle.net/11336/32298 | |
| dc.journal.number | 6 | es |
| dc.journal.pagination | 1-43 | es |
| dc.journal.pais | Singapur | es |
| dc.journal.title | International Journal On Artificial Intelligence Tools | es |
| dc.journal.volume | 23 | es |
| dc.language.iso | eng | es |
| dc.publisher | World Scientific | es |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/http://www.worldscientific.com/doi/abs/10.1142/S0218213014600306 | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1142/S0218213014600306 | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/1307.3964 | |
| dc.rights | info:eu-repo/semantics/openAccess | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | * |
| dc.subject | Markov Network | es |
| dc.subject | Structure Learning | es |
| dc.subject | Context-Specific Independences | es |
| dc.subject | Csi Models | es |
| dc.subject | Knowledge Discovery | es |
| dc.subject.classification | Ciencias de la Computación | es |
| dc.subject.classification | Ciencias de la Computación e Información | es |
| dc.subject.classification | CIENCIAS NATURALES Y EXACTAS | es |
| dc.title | Learning Markov Network Structures Constrained by Context-Specific Independences | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
Archivos
Bloque original
Cargando...
- Nombre:
- CONICET_Digital_Nro.78ff8cd3-69d0-4b4d-973e-d0524f05e277_X.pdf
- Tamaño:
- 592.05 KB
- Formato:
- Adobe Portable Document Format
- Descripción: