Biomedical subjects

Jacek M Zurada

Publications and source records attributed to Jacek M Zurada.

8 recordsLinked to original sources

PubMed2006

Generalized core vector machines.

Kernel methods, such as the support vector machine (SVM), are often formulated as quadratic programming (QP) problems. However, given m training patterns, a naive implementation of the QP solver takes O(m3) training time and at least O(m2) space. Hence, scaling up these QPs is a major stumbling block in applying kernel methods on very large data sets, and a replacement of the naive method for finding the QP solutions is highly desirable. Recently, by using approximation algorithms for the minimum enclosing ball (MEB) problem, we proposed the core vector machine (CVM) algorithm that is much faster and can handle much larger data sets than existing SVM implementations. However, the CVM can only be used with certain kernel functions and kernel methods. For example, the very popular support vector regression (SVR) cannot be used with the CVM. In this paper, we introduce the center-constrained MEB problem and subsequently extend the CVM algorithm. The generalized CVM algorithm can now be used with any linear/nonlinear kernel and can also be applied to kernel methods such as SVR and the ranking SVM. Moreover, like the original CVM, its asymptotic time complexity is again linear in m and its space complexity is independent of m. Experiments show that the generalized CVM has comparable performance with state-of-the-art SVM and SVR implementations, but is faster and produces fewer support vectors on very large data sets.

Algorithms↗

PubMed2005

An energy function-based design method for discrete Hopfield associative memory with attractive fixed points.

An energy function-based autoassociative memory design method to store a given set of unipolar binary memory vectors as attractive fixed points of an asynchronous discrete Hopfield network (DHN) is presented. The discrete quadratic energy function whose local minima correspond to the attractive fixed points of the network is constructed via solving a system of linear inequalities derived from the strict local minimality conditions. The weights and the thresholds are then calculated using this energy function. If the inequality system is infeasible, we conclude that no such asynchronous DHN exists, and extend the method to design a discrete piecewise quadratic energy function, which can be minimized by a generalized version of the conventional DHN, also proposed herein. In spite of its computational complexity, computer simulations indicate that the original method performs better than the conventional design methods in the sense that the memory can store, and provide the attractiveness for almost all memory sets whose cardinality is less than or equal to the dimension of its elements. The overall method, together with its extension, guarantees the storage of an arbitrary collection of memory vectors, which are mutually at least two Hamming distances away from each other, in the resulting network.

Association Learning↗

PubMed2004

Bifurcating neuron: computation and learning.

The ability of bifurcating processing units and their networks to rapidly switch between different dynamic modes has been used in recent research efforts to model new computational properties of neural systems. In this spirit, we devise a bifurcating neuron based on control of chaos collapsing to a period-3 orbit in the dynamics of a quadratic logistic map (QLM). Proposed QLM3 neuron is constructed with the third iterate of QLM and uses an external input, which governs its dynamics. The input shifts the neuron's dynamics from chaos to one of the stable fixed points. This way the inputs from certain ranges (clusters) are mapped to stable fixed points, while the rest of the inputs is mapped to chaotic or periodic output dynamics. It has been shown that QLM3 neuron is able to learn a specific mapping by adaptively adjusting its bifurcation parameter, the idea of which is based on the principles of parametric control of logistic maps [Proceedings of the International Symposium on Nonlinear Theory and its Applications (NOLTA'97), Honolulu, HI, 1997; Proceedings of SPIE, 2000]. Learning algorithm for the bifurcation parameter is proposed, which employs the error gradient descent method.

Learning↗

PubMed2004

Signal processing with temporal sequences in olfactory systems.

The olfactory system is a very efficient biological setup capable of odor information processing with neural signals. The nature of neural signals restricts the information representation to multidimensional temporal sequences of spikes. The information is contained in the interspike intervals within each individual neural signal and interspike intervals between multiple signals. A mechanism of interactions between random excitations evoked by odorants in the olfactory receptors of the epithelium and deterministic operation of the olfactory bulb is proposed in this paper. Inverse Frobenius-Perron models of the bulb's temporal sequences are fitted to the interspike distributions of temporally modulated receptor signals. Ultimately, such pattern matching results in ability to recognize odors and offer a hypothetic model for signal processing occurring in the primary stage of the olfactory system.

Action Potentials↗

PubMed2002

Temporal-to-spatial dynamic mapping, flexible recognition, and temporal correlations in an olfactory cortex model.

This paper proposes temporal-to-spatial dynamic mapping inspired by neural dynamics of the olfactory cortex. In our model the temporal structure of olfactory-bulb patterns is mapped to the spatial dynamics of the ensemble of cortical neurons. This mapping is based on the following biological mechanism: while anterior part of piriform cortex can be excited by the afferent input alone, the posterior areas require both afferent and association signals, which are temporally correlated in a specific way. One of the functional types of the neurons in our model corresponds to the cortical spatial dynamics and encodes odor components, and another represents temporal activity of association-fiber signals, which, we suggest, may be relevant to the encoding of odor concentrations. The temporal-to-spatial mapping and distributed representation of the model enable simultaneous rough cluster classification and fine recognition of patterns within a cluster as parts of the same dynamic process. The model is able to extract and segment the components of complex odor patterns which are spatiotemporal sequences of neural activity.

Animals↗

PubMed2002

Estimation of K distribution parameters using neural networks.

The K distribution is an accurate model for ultrasonic backscatter. A neural approach is developed to estimate K distribution parameters. Accuracy and consistency of the estimates from simulated K and envelope data compare favorably with other techniques. Neural networks can potentially be used as a complementary technique for tissue characterization.

Computer Simulation↗

PubMedDate not supplied

Individualization of pharmacological anemia management using reinforcement learning.

Effective management of anemia due to renal failure poses many challenges to physicians. Individual response to treatment varies across patient populations and, due to the prolonged character of the therapy, changes over time. In this work, a Reinforcement Learning-based approach is proposed as an alternative method for individualization of drug administration in the treatment of renal anemia. Q-learning, an off-policy approximate dynamic programming method, is applied to determine the proper dosing strategy in real time. Simulations compare the proposed methodology with the currently used dosing protocol. Presented results illustrate the ability of the proposed method to achieve the therapeutic goal for individuals with different response characteristics and its potential to become an alternative to currently used techniques.

Algorithms↗

PubMedDate not supplied

Pharmacodynamic population analysis in chronic renal failure using artificial neural networks--a comparative study.

This work presents a pharmacodynamic population analysis in chronic renal failure patients using Artificial Neural Networks (ANNs). In pursuit of an effective and cost-efficient strategy for drug delivery in patients with renal failure, two different types of ANN are applied to perform drug dose-effect modeling and their performance compared. Applied in a clinical environment, such models will allow for prediction of patient response to the drug at the effect site and, subsequently, for adjusting the dosing regimen.

Artificial Intelligence↗