Thumbnail
Access Restriction
Subscribed

Author Chen, T. ♦ Jannarone, R. ♦ Cho, Y. B. ♦ Takefuji, Y.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Multinomial Conjunctoids are supervised statistical modules that learn the relationships among binary events. The multinomial conjunctoid algorithm precludes the following problems that occur in existing feedforward multi-layered neural networks: (a) existing networks often cannot determine underlying neural architectures, for example how many hidden layers should be used, how many neurons in each hidden layer are required, and what interconnections between neurons should be made; (b) existing networks cannot avoid convergence to suboptimal solutions during the learning process; (c) existing networks require many iterations to converge, if at all, to stable states; and (d) existing networks may not be sufficiently general to reflect all learning situations. By contrast, multinomial conjunctoids are based on a well-developed statistical decision theory framework, which guarantees that learning algorithms will converge to optimal learning states as the number of learning trials increases, and that convergence during each trial will be very fast. In this paper a prototype multinomial conjunctoid circuit based on CMOS VLSI technology is described.
Description Affiliation: Univ. of South Carolina, Columbia (Takefuji, Y.; Jannarone, R.; Cho, Y. B.; Chen, T.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1981-04-01
Publisher Place New York
Journal ACM SIGARCH Computer Architecture News (CARN)
Volume Number 16
Issue Number 2
Page Count 6
Starting Page 12
Ending Page 17


Open content in new tab

   Open content in new tab
Source: ACM Digital Library