关于正函数的分解

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI:10.1109/ISIT.2001.935907

T.H. Chan, R. Yeung

{"title":"关于正函数的分解","authors":"T.H. Chan, R. Yeung","doi":"10.1109/ISIT.2001.935907","DOIUrl":null,"url":null,"abstract":"Factorization of positive functions into products of local functions is crucial in graphical modeling. In this paper, the problem of factorizing a positive function P is investigated. When P does not have a simple factorization, an approximation of P by a simple function is given by a computationally efficient algorithm.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On factorization of positive functions\",\"authors\":\"T.H. Chan, R. Yeung\",\"doi\":\"10.1109/ISIT.2001.935907\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Factorization of positive functions into products of local functions is crucial in graphical modeling. In this paper, the problem of factorizing a positive function P is investigated. When P does not have a simple factorization, an approximation of P by a simple function is given by a computationally efficient algorithm.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.935907\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.935907","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

在图形建模中，将正函数分解成局部函数的乘积是至关重要的。研究了正函数P的因式分解问题。当P没有简单因数分解时，用一个计算效率高的算法给出一个简单函数对P的近似。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On factorization of positive functions

Factorization of positive functions into products of local functions is crucial in graphical modeling. In this paper, the problem of factorizing a positive function P is investigated. When P does not have a simple factorization, an approximation of P by a simple function is given by a computationally efficient algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

自引率

0.00%

发文量