A fuzzy threshold max-product unit, with learning algorithm, for classification of pattern vectors

R. Brouwer
{"title":"A fuzzy threshold max-product unit, with learning algorithm, for classification of pattern vectors","authors":"R. Brouwer","doi":"10.1109/SBRN.2000.889740","DOIUrl":null,"url":null,"abstract":"Proposes a max-product threshold unit (maptu) that, like a single perceptron, can perform dichotomous classifications of pattern vectors. Maptu classifies a pattern vector, x, by determining whether x max-prod w is less than 0.5 or greater than 0.5. Here w, consisting of non-negative values, is referred to as the weight vector. As part of training w is found by setting it equal to c* 0.5/max X/sup -/. X/sup -/ is the matrix whose rows are the training patterns belonging to class-. Maximization is done within the columns of X/sup -/. Since (x max-prod w<0.5) vs. (x max-prod w>0.5) is not symmetrical because the former is much more restrictive than the latter a satisfiability factor based on X/sup -/ and X/sup +/ is calculated to determine which set of training data should be labeled class-and which should be labeled class/sup +/. Let X/sup +/ denote the matrix whose rows are the training patterns belonging to class/sup +/. The only iteration is involved in finding c by trying values greater than 0 near 1. The method is tried with success on 4 different sets of data. Results obtained by other methods in classification of this data is used for comparison to the method using maptu.","PeriodicalId":448461,"journal":{"name":"Proceedings. Vol.1. Sixth Brazilian Symposium on Neural Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Vol.1. Sixth Brazilian Symposium on Neural Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBRN.2000.889740","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Proposes a max-product threshold unit (maptu) that, like a single perceptron, can perform dichotomous classifications of pattern vectors. Maptu classifies a pattern vector, x, by determining whether x max-prod w is less than 0.5 or greater than 0.5. Here w, consisting of non-negative values, is referred to as the weight vector. As part of training w is found by setting it equal to c* 0.5/max X/sup -/. X/sup -/ is the matrix whose rows are the training patterns belonging to class-. Maximization is done within the columns of X/sup -/. Since (x max-prod w<0.5) vs. (x max-prod w>0.5) is not symmetrical because the former is much more restrictive than the latter a satisfiability factor based on X/sup -/ and X/sup +/ is calculated to determine which set of training data should be labeled class-and which should be labeled class/sup +/. Let X/sup +/ denote the matrix whose rows are the training patterns belonging to class/sup +/. The only iteration is involved in finding c by trying values greater than 0 near 1. The method is tried with success on 4 different sets of data. Results obtained by other methods in classification of this data is used for comparison to the method using maptu.
基于学习算法的模糊阈值最大积单元模式向量分类
提出了一种最大积阈值单元(maptu),它可以像单个感知器一样对模式向量进行二分类。Maptu通过确定x max-prod w是小于0.5还是大于0.5来对模式向量x进行分类。这里,由非负值组成的w被称为权向量。作为训练的一部分,w可以通过设置它等于c* 0.5/max X/sup -/来找到。X/sup -/是矩阵,其行是属于类-的训练模式。最大化是在X/sup -/列内完成的。由于(x max-prod w0.5)不是对称的,因为前者比后者更具限制性,因此计算基于x /sup -/和x /sup +/的满意系数,以确定哪一组训练数据应该标记为class,哪一组应该标记为class/sup +/。设X/sup +/表示矩阵,其行是属于/sup +/类的训练模式。唯一的迭代是通过尝试1附近大于0的值来找到c。该方法在4组不同的数据上进行了成功的试验。使用其他方法对该数据进行分类的结果与使用maptu的方法进行比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信