{"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}
引用次数: 1
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.