PubMed Health⌕ Search

Biomedical subjects

M Lagerholm

Publications and source records attributed to M Lagerholm.

2 recordsLinked to original sources

Clustering ECG complexes using hermite functions and self-organizing maps.

An integrated method for clustering of QRS complexes is presented which includes basis function representation and self-organizing neural networks (NN's). Each QRS complex is decomposed into Hermite basis functions and the resulting coefficients and width parameter are used to represent the complex. By means of this representation, unsupervised self-organizing NN's are employed to cluster the data into 25 groups. Using the MIT-BIH arrhythmia database, the resulting clusters are found to exhibit a very low degree of misclassification (1.5%). The integrated method outperforms, on the MIT-BIH database, both a published supervised learning method as well as a conventional template cross-correlation clustering method.

Algorithms↗

A Potts Neuron Approach to Communication Routing.

A feedback neural network approach to communication routing problems is developed, with emphasis on multiple shortest path problems, with several requests for transmissions between distinct start and end nodes. The basic ingredients are a set of Potts neurons for each request, with interactions designed to minimize path lengths and prevent overloading of network arcs. The topological nature of the problem is conveniently handled using a propagator matrix approach. Although the constraints are global, the algorithmic steps are based entirely on local information, facilitating distributed implementations. In the polynomially solvable single-request case, the approach reduces to a fuzzy version of the Bellman-Ford algorithm. The method is evaluated for synthetic problems of varying sizes and load levels, by comparing to exact solutions from a branch-and-bound method, or to approximate solutions from a simple heuristic. With very few exceptions, the Potts approach gives high-quality legal solutions. The computational demand scales merely as the product of the numbers of requests, nodes, and arcs.

Journal Article↗