European Workshop on Probabilistic Graphical Models最新文献

筛选
英文 中文
A New Method for Vertical Parallelisation of TAN Learning Based on Balanced Incomplete Block Designs 基于平衡不完全块设计的TAN学习垂直并行化新方法
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_20
A. Madsen, Frank Jensen, A. Salmerón, Martin Karlsen, H. Langseth, Thomas D. Nielsen
{"title":"A New Method for Vertical Parallelisation of TAN Learning Based on Balanced Incomplete Block Designs","authors":"A. Madsen, Frank Jensen, A. Salmerón, Martin Karlsen, H. Langseth, Thomas D. Nielsen","doi":"10.1007/978-3-319-11433-0_20","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_20","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117066349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Extended Probability Trees for Probabilistic Graphical Models 概率图模型的扩展概率树
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_8
A. Cano, Manuel Gómez-Olmedo, S. Moral, Cora B. Pérez-Ariza
{"title":"Extended Probability Trees for Probabilistic Graphical Models","authors":"A. Cano, Manuel Gómez-Olmedo, S. Moral, Cora B. Pérez-Ariza","doi":"10.1007/978-3-319-11433-0_8","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_8","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132609402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Supervised Classification Using Hybrid Probabilistic Decision Graphs 基于混合概率决策图的监督分类
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_14
Antonio Fernández, R. Rumí, J. Sagrado, A. Salmerón
{"title":"Supervised Classification Using Hybrid Probabilistic Decision Graphs","authors":"Antonio Fernández, R. Rumí, J. Sagrado, A. Salmerón","doi":"10.1007/978-3-319-11433-0_14","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_14","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"17 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132118578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Compression of Bayesian Networks with NIN-AND Tree Modeling 基于n - and树建模的贝叶斯网络压缩
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_36
Y. Xiang, Qing Liu
{"title":"Compression of Bayesian Networks with NIN-AND Tree Modeling","authors":"Y. Xiang, Qing Liu","doi":"10.1007/978-3-319-11433-0_36","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_36","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132397059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
An Approximate Tensor-Based Inference Method Applied to the Game of Minesweeper 一种近似张量推理方法在扫雷游戏中的应用
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_35
Jirka Vomlel, P. Tichavský
{"title":"An Approximate Tensor-Based Inference Method Applied to the Game of Minesweeper","authors":"Jirka Vomlel, P. Tichavský","doi":"10.1007/978-3-319-11433-0_35","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_35","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132480187","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Extended Tree Augmented Naive Classifier 扩展树增强朴素分类器
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_12
Cassio Polpo de Campos, Marco Cuccu, Giorgio Corani, Marco Zaffalon
{"title":"Extended Tree Augmented Naive Classifier","authors":"Cassio Polpo de Campos, Marco Cuccu, Giorgio Corani, Marco Zaffalon","doi":"10.1007/978-3-319-11433-0_12","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_12","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134584691","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Min-BDeu and Max-BDeu Scores for Learning Bayesian Networks 学习贝叶斯网络的Min-BDeu和Max-BDeu分数
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_28
Mauro Scanagatta, Cassio Polpo de Campos, Marco Zaffalon
{"title":"Min-BDeu and Max-BDeu Scores for Learning Bayesian Networks","authors":"Mauro Scanagatta, Cassio Polpo de Campos, Marco Zaffalon","doi":"10.1007/978-3-319-11433-0_28","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_28","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134039766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Treewidth and the Computational Complexity of MAP Approximations MAP近似的树宽和计算复杂度
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_18
J. Kwisthout
{"title":"Treewidth and the Computational Complexity of MAP Approximations","authors":"J. Kwisthout","doi":"10.1007/978-3-319-11433-0_18","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_18","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130473572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Minimizing Relative Entropy in Hierarchical Predictive Coding 分层预测编码中相对熵的最小化
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_17
J. Kwisthout
{"title":"Minimizing Relative Entropy in Hierarchical Predictive Coding","authors":"J. Kwisthout","doi":"10.1007/978-3-319-11433-0_17","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_17","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114407756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Learning Maximum Weighted (k+1)-Order Decomposable Graphs by Integer Linear Programming 用整数线性规划学习最大加权(k+1)阶可分解图
European Workshop on Probabilistic Graphical Models Pub Date : 2014-09-17 DOI: 10.1007/978-3-319-11433-0_26
Aritz Pérez Martínez, C. Blum, J. A. Lozano
{"title":"Learning Maximum Weighted (k+1)-Order Decomposable Graphs by Integer Linear Programming","authors":"Aritz Pérez Martínez, C. Blum, J. A. Lozano","doi":"10.1007/978-3-319-11433-0_26","DOIUrl":"https://doi.org/10.1007/978-3-319-11433-0_26","url":null,"abstract":"","PeriodicalId":124205,"journal":{"name":"European Workshop on Probabilistic Graphical Models","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128151208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书