S-Threshold函数的野村参数

I. Prokić, J. Pantović
{"title":"S-Threshold函数的野村参数","authors":"I. Prokić, J. Pantović","doi":"10.1109/ISMVL.2017.53","DOIUrl":null,"url":null,"abstract":"A multilevel S-threshold function characterizes a partition of a discrete point set (the domain of the function)into nonempty subsets. Each subset is labeled by one element (level) of the image set. We propose an encoding that converts a multilevel S-threshold function into a tuple of positive integers. The components of this code are generalisation of well known Chow and Nomura parameters. We derive upper bounds for the number of linear, the number of multilinear and the number of polynomial threshold functions. Comparing the encoding proposed in this paper with the one that uses discrete moments, we show that there are cases when we can get lower upper bounds for the number of considered functions.","PeriodicalId":393724,"journal":{"name":"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Nomura Parameters for S-Threshold Functions\",\"authors\":\"I. Prokić, J. Pantović\",\"doi\":\"10.1109/ISMVL.2017.53\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A multilevel S-threshold function characterizes a partition of a discrete point set (the domain of the function)into nonempty subsets. Each subset is labeled by one element (level) of the image set. We propose an encoding that converts a multilevel S-threshold function into a tuple of positive integers. The components of this code are generalisation of well known Chow and Nomura parameters. We derive upper bounds for the number of linear, the number of multilinear and the number of polynomial threshold functions. Comparing the encoding proposed in this paper with the one that uses discrete moments, we show that there are cases when we can get lower upper bounds for the number of considered functions.\",\"PeriodicalId\":393724,\"journal\":{\"name\":\"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2017.53\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2017.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

一个多层s阈值函数描述了一个离散点集(函数的域)被划分为非空子集的特征。每个子集由图像集的一个元素(级别)标记。我们提出了一种将多层s阈值函数转换为正整数元组的编码方法。该代码的组成部分是众所周知的Chow和Nomura参数的推广。给出了线性阈值函数、多元线性阈值函数和多项式阈值函数的上限。将本文提出的编码与使用离散矩的编码进行比较,我们发现在某些情况下,我们可以得到所考虑的函数数量的下界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Nomura Parameters for S-Threshold Functions
A multilevel S-threshold function characterizes a partition of a discrete point set (the domain of the function)into nonempty subsets. Each subset is labeled by one element (level) of the image set. We propose an encoding that converts a multilevel S-threshold function into a tuple of positive integers. The components of this code are generalisation of well known Chow and Nomura parameters. We derive upper bounds for the number of linear, the number of multilinear and the number of polynomial threshold functions. Comparing the encoding proposed in this paper with the one that uses discrete moments, we show that there are cases when we can get lower upper bounds for the number of considered functions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信