PERFORMANCE ANALYSIS OF SOFT COMPUTING TECHNIQUES FOR CLASSIFYING CARDIAC ARRHYTHMIA
Journal Title: Indian Journal of Computer Science and Engineering - Year 2013, Vol 4, Issue 6
Abstract
Cardiovascular diseases kill more people than other diseases. Arrhythmia is a common term used for cardiac rhythm deviating from normal sinus rhythm. Many heart diseases are detected through electrocardiograms (ECG) analysis. Manual analysis of ECG is time consuming and error prone. Thus, an automated system for detecting arrhythmia in ECG signals gains importance. Features are extracted from time series ECG data with Discrete Cosine Transform (DCT) computing the distance between RR waves. The feature is the beat’s extracted RR interval. Frequency domain extracted features are classified using Classification and Regression Tree (CART), Radial Basis Function (RBF), Support Vector Machine (SVM) and Multilayer Perceptron Neural Network (MLP-NN). Experiments were conducted on the MIT-BIH arrhythmia database.
Authors and Affiliations
R GANESH KUMAR , Dr. Y S KUMARASWAMY
WEB SERVICE DISCOVERY BASED ON COMPUTION OF SEMANTIC SIMILARITY DISTANCE AND QOS NORMALIZATION
Service discovery is an important activity in services computing paradigm. Omnipresent of internet and proliferation of web services paves unrestricted opportunity to many service providers to create, locate and access t...
COMPARATIVE STUDY OF DIFFERENT APPROACHES FOR EFFICIENT RECTIFICATION UNDER GENERAL MOTION
This paper is concerned with the generating an efficient fundamental matrix for image rectification problem under motion. Computation of fundamental matrix is the information source to estimate the accurate optic flow in...
THE IMPACT OF KNOWLEDGE-BASED CONFIGURATIONS ON CRYPTOANALYSIS
Unified semantic archetypes have led to many practical advances, including symmetric encryption and widearea networks. In this work, we argue the development of replication, which embodies the extensive principles of e-v...
AN OPTICAL NEURAL NETWORK MODEL FOR MINING FREQUENT ITEMSETS IN LARGE DATABASES
This paper proposes a model for mining frequent patterns in large databases by implementing Optical Neural Networks. The whole database is scanned only once and stored as a matrix. The frequent patterns are then mined fr...
An Efficient Approach of Election Algorithm in Distributed Systems
In this paper, I have proposed an election algorithm that can be used in distributed systems to elect a coordinator. This is a betterment of an already existing Election algorithm (also known as Bully Algorithm) proposed...