Hybrid Additive-Multiplicative Evolutionary Neural Network Architectures Employing Heterogeneous Activation Functions
نویسندگان
چکیده
منابع مشابه
Some Remarks about Additive and Multiplicative Functions
The present paper contains some results about the classical multiplicative functions (n), a(n) and also about general additive and multiplicative functions. (1) It is well known that n/{n) ^x.) It is known that both fi(x) and fï(x) are strictly inc...
متن کاملPrediction of Surface Roughness by Hybrid Artificial Neural Network and Evolutionary Algorithms in End Milling
Machining processes such as end milling are the main steps of production which have major effect on the quality and cost of products. Surface roughness is one of the considerable factors that production managers tend to implement in their decisions. In this study, an artificial neural network is proposed to minimize the surface roughness by tuning the conditions of machining process such as cut...
متن کاملOn Arabic Character Recognition Employing Hybrid Neural Network
Arabic characters illustrate intricate, multidimensional and cursive visual information. Developing a machine learning system for Arabic character recognition is an exciting research. This paper addresses a neural computing concept for Arabic Optical Character Recognition (OCR). The method is based on local image sampling of each character to a selected feature matrix and feeding these matrices...
متن کاملProtein Modeling with Hybrid Hidden Markov Model/Neural Network Architectures
Hidden Markov Models (HMMs) are useful in a number of tasks in computational molecular biology, and in particular to model and align protein families. We argue that HMMs are somewhat optimal within a certain modeling hierarchy. Single first order HMMs, however, have two potential limitations: a large number of unstructured parameters, and a built-in inability to deal with long-range dependencie...
متن کاملA relation between additive and multiplicative complexity of Boolean functions
In the present note we prove an asymptotically tight relation between additive and multiplicative complexity of Boolean functions with respect to implementation by circuits over the basis {⊕,∧, 1}. To start, consider a problem of computation of polynomials over a semiring (K,+,×) by circuits over the arithmetic basis {+,×} ∪K. It’s a common knowledge that a polynomial of n variables with nonsca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Intelligent Informatics
سال: 2004
ISSN: 1347-7986,1881-7203
DOI: 10.3156/jsoft.16.102_2