候选格中与布尔代数同构的大子格的存在性

IF 0.5 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS Pub Date : 2023-06-13 DOI:10.3103/S0005105523020097

D. Vinogradov

{"title":"候选格中与布尔代数同构的大子格的存在性","authors":"D. Vinogradov","doi":"10.3103/S0005105523020097","DOIUrl":null,"url":null,"abstract":"<p>Algebraic machine learning has emerged as a way to overcome the need to generate a (potentially exponential) lattice of all candidates (as, for example, in the case of Boolean algebra). In this paper, it is proven that for a random training sample generated by the Bernoulli sequence, the probability that a large sublattice will arise in the lattice of candidates isomorphic to Boolean algebra will tend to unity as the sample size increases.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2023-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Existence of Large Sublattices Isomorphic to Boolean Algebra in a Candidate Lattice\",\"authors\":\"D. Vinogradov\",\"doi\":\"10.3103/S0005105523020097\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Algebraic machine learning has emerged as a way to overcome the need to generate a (potentially exponential) lattice of all candidates (as, for example, in the case of Boolean algebra). In this paper, it is proven that for a random training sample generated by the Bernoulli sequence, the probability that a large sublattice will arise in the lattice of candidates isomorphic to Boolean algebra will tend to unity as the sample size increases.</p>\",\"PeriodicalId\":42995,\"journal\":{\"name\":\"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.3103/S0005105523020097\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.3103/S0005105523020097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 1

摘要

代数机器学习已经成为一种克服生成所有候选者的（潜在指数）格的需要的方法（例如，在布尔代数的情况下）。本文证明，对于由伯努利序列生成的随机训练样本，随着样本量的增加，同构于布尔代数的候选格中出现大子格的概率将趋于一致。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Existence of Large Sublattices Isomorphic to Boolean Algebra in a Candidate Lattice

Algebraic machine learning has emerged as a way to overcome the need to generate a (potentially exponential) lattice of all candidates (as, for example, in the case of Boolean algebra). In this paper, it is proven that for a random training sample generated by the Bernoulli sequence, the probability that a large sublattice will arise in the lattice of candidates isomorphic to Boolean algebra will tend to unity as the sample size increases.

求助全文

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

来源期刊

AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS COMPUTER SCIENCE, INFORMATION SYSTEMS-

自引率

40.00%

发文量

期刊介绍： Automatic Documentation and Mathematical Linguistics is an international peer reviewed journal that covers all aspects of automation of information processes and systems, as well as algorithms and methods for automatic language analysis. Emphasis is on the practical applications of new technologies and techniques for information analysis and processing.