untitled
<OAI-PMH schemaLocation=http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd><responseDate>2018-01-24T08:01:26Z</responseDate><request identifier=oai:localhost:2139/10115 verb=GetRecord metadataPrefix=oai_dc>http://uwispace.sta.uwi.edu/oai/request</request><GetRecord><record><header><identifier>oai:localhost:2139/10115</identifier><datestamp>2011-06-15T03:02:01Z</datestamp><setSpec>com_2139_5461</setSpec><setSpec>com_2139_41682</setSpec><setSpec>com_123456789_8511</setSpec><setSpec>col_2139_5462</setSpec></header><metadata><dc schemaLocation=http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd>
<title>A fuzzy backpropagation algorithm</title>
<creator>Stoeva, Stefka</creator>
<creator>Nikov, Alexander</creator>
<subject>Neural networks</subject>
<subject>Learning algorithm</subject>
<subject>Fuzzy logic</subject>
<subject>Multicriteria analysis</subject>
<description>This paper presents an extension of the standard backpropagation algorithm (SBP). The proposed learning algorithm is based on the fuzzy integral of Sugeno and thus called fuzzy backpropagation (FBP) algorithm. Necessary and sufficient conditions for convergence of FBP algorithm for single-output networks in case of single- and multiple-training patterns are proved. A computer simulation illustrates and confirms the theoretical results. FBP algorithm shows considerably greater convergence rate compared to SBP algorithm. Other advantages of FBP algorithm are that it reaches forward to the target value without oscillations, requires no assumptions about probability distribution and independence of input data. The convergence conditions enable training by automation of weights tuning process (quasi-unsupervised learning) pointing out the interval where the target value belongs to. This supports acquisition of implicit knowledge and ensures wide application, e.g. for creation of adaptable user interfaces, assessment of products, intelligent data analysis, etc.</description>
<date>2011-06-14T12:03:33Z</date>
<date>2011-06-14T12:03:33Z</date>
<date>2011-06-14</date>
<type>Article</type>
<identifier>http://hdl.handle.net/2139/10115</identifier>
<language>en</language>
</dc>
</metadata></record></GetRecord></OAI-PMH>
