Senén Barro

Bio: Senén Barro is an academic researcher from University of Santiago de Compostela. The author has contributed to research in topics: Fuzzy logic & Fuzzy classification. The author has an hindex of 28, co-authored 173 publications receiving 4767 citations. Previous affiliations of Senén Barro include Favaloro University & University of Murcia.

Do we need hundreds of classifiers to solve real world classification problems

Abstract: We evaluate 179 classifiers arising from 17 families (discriminant analysis, Bayesian, neural networks, support vector machines, decision trees, rule-based classifiers, boosting, bagging, stacking, random forests and other ensembles, generalized linear models, nearest-neighbors, partial least squares and principal component regression, logistic and multinomial regression, multiple adaptive regression splines and other methods), implemented in Weka, R (with and without the caret package), C and Matlab, including all the relevant classifiers available today. We use 121 data sets, which represent the whole UCI data base (excluding the large-scale problems) and other own real problems, in order to achieve significant conclusions about the classifier behavior, not dependent on the data set collection. The classifiers most likely to be the bests are the random forest (RF) versions, the best of which (implemented in R and accessed via caret) achieves 94.1% of the maximum accuracy overcoming 90% in the 84.3% of the data sets. However, the difference is not statistically significant with the second best, the SVM with Gaussian kernel implemented in C using LibSVM, which achieves 92.3% of the maximum accuracy. A few models are clearly better than the remaining ones: random forest, SVM with Gaussian and polynomial kernels, extreme learning machine with Gaussian kernel, C5.0 and avNNet (a committee of multi-layer perceptrons implemented in R with the caret package). The random forest is clearly the best family of classifiers (3 out of 5 bests classifiers are RF), followed by SVM (4 classifiers in the top-10), neural networks and boosting ensembles (5 and 3 members in the top-20, respectively).

Fuzzy reasoning supported by Petri nets

Abstract: We develop a representational model for the knowledge base (KB) of fuzzy production systems with rule chaining based on the Petri net formalism. The model presents the execution of a KB following a data driven strategy based on the sup-min compositional rule of inference. In this connection, algorithms characterizing different situations have been described, including the case where the KB is characterized by complete information about all the input variables and the case where it is characterized by ignorance of some of these variables. For this last situation we develop a process of "incremental reasoning"; this process allows the KB to take information about previously unknown values into consideration as soon as such information becomes available. Furthermore, as compared to other solutions, the rule chaining mechanism we introduce is more flexible, and the description of the rules more generic. The computational complexity of these algorithms is O((C/2+M+N)R/sup 2/) for the "complete information" case and O((M+N)R/sup 2/) and O(2(M+N)R/sup 2/) for the other cases, where R is the number of fuzzy conditional statements of the KB, M and N the maximum number of antecedents and consequents in the rules and C the number of chaining transitions in the KB representation. >

Fuzzy Logic in Medicine

Abstract: A Call for a Stronger Role for Fuzzy Logic in Medicine.- Fuzzy Information Granulation of Medical Images. Blood Vessel Extraction from 3-D MRA Images.- Breast Cancer Classification Using Fuzzy Central Moments.- Awareness Monitoring and Decision-Making for General Anaesthesia.- Depth of Anesthesia Control with Fuzzy Logic.- Intelligent Alarms for Anaesthesia Monitoring Based on a Fuzzy Logic Approach.- Fuzzy Clustering in Medicine: Applications to Electrophysiological Signal Processing.- Fuzzy Logic in a Decision Support System in the Domain of Coronary Heart Disease Risk Assessment.- A Model-based Temporal Abductive Diagnosis Model for an Intensive Coronary Care Unit.- A Fuzzy Model for Pattern Recognition in the Evolution of Patients.- Mass Assignment Methods for Medical Classification Diagnosis.- Acquisition of Fuzzy Association Rules from Medical Data.

Modern Applied Statistics With S

Abstract: Thank you very much for downloading modern applied statistics with s. As you may know, people have search hundreds times for their favorite readings like this modern applied statistics with s, but end up in harmful downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they cope with some harmful virus inside their laptop. modern applied statistics with s is available in our digital library an online access to it is set as public so you can download it instantly. Our digital library saves in multiple countries, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the modern applied statistics with s is universally compatible with any devices to read.

Do we need hundreds of classifiers to solve real world classification problems

Abstract: We evaluate 179 classifiers arising from 17 families (discriminant analysis, Bayesian, neural networks, support vector machines, decision trees, rule-based classifiers, boosting, bagging, stacking, random forests and other ensembles, generalized linear models, nearest-neighbors, partial least squares and principal component regression, logistic and multinomial regression, multiple adaptive regression splines and other methods), implemented in Weka, R (with and without the caret package), C and Matlab, including all the relevant classifiers available today. We use 121 data sets, which represent the whole UCI data base (excluding the large-scale problems) and other own real problems, in order to achieve significant conclusions about the classifier behavior, not dependent on the data set collection. The classifiers most likely to be the bests are the random forest (RF) versions, the best of which (implemented in R and accessed via caret) achieves 94.1% of the maximum accuracy overcoming 90% in the 84.3% of the data sets. However, the difference is not statistically significant with the second best, the SVM with Gaussian kernel implemented in C using LibSVM, which achieves 92.3% of the maximum accuracy. A few models are clearly better than the remaining ones: random forest, SVM with Gaussian and polynomial kernels, extreme learning machine with Gaussian kernel, C5.0 and avNNet (a committee of multi-layer perceptrons implemented in R with the caret package). The random forest is clearly the best family of classifiers (3 out of 5 bests classifiers are RF), followed by SVM (4 classifiers in the top-10), neural networks and boosting ensembles (5 and 3 members in the top-20, respectively).

Drug-induced prolongation of the QT interval.

Abstract: The single most common cause of the withdrawal or restriction of the use of marketed drugs has been QT-interval prolongation associated with polymorphic ventricular tachycardia, or torsade de pointes, a condition that can be fatal. This review summarizes the current knowledge about molecular and clinical predictors of drug-induced QT-interval prolongation and torsade de pointes and discusses how new molecular predictors of drug action might be incorporated into drug-development programs and clinical practice. A general approach to drugs suspected of causing this problem is presented.

ilastik: interactive machine learning for (bio)image analysis.

Abstract: We present ilastik, an easy-to-use interactive tool that brings machine-learning-based (bio)image analysis to end users without substantial computational expertise. It contains pre-defined workflows for image segmentation, object classification, counting and tracking. Users adapt the workflows to the problem at hand by interactively providing sparse training annotations for a nonlinear classifier. ilastik can process data in up to five dimensions (3D, time and number of channels). Its computational back end runs operations on-demand wherever possible, allowing for interactive prediction on data larger than RAM. Once the classifiers are trained, ilastik workflows can be applied to new data from the command line without further user interaction. We describe all ilastik workflows in detail, including three case studies and a discussion on the expected performance.

A wavelet-based ECG delineator: evaluation on standard databases

Abstract: In this paper, we developed and evaluated a robust single-lead electrocardiogram (ECG) delineation system based on the wavelet transform (WT). In a first step, QRS complexes are detected. Then, each QRS is delineated by detecting and identifying the peaks of the individual waves, as well as the complex onset and end. Finally, the determination of P and T wave peaks, onsets and ends is performed. We evaluated the algorithm on several manually annotated databases, such as MIT-BIH Arrhythmia, QT, European ST-T and CSE databases, developed for validation purposes. The QRS detector obtained a sensitivity of Se=99.66% and a positive predictivity of P+=99.56% over the first lead of the validation databases (more than 980,000 beats), while for the well-known MIT-BIH Arrhythmia Database, Se and P+ over 99.8% were attained. As for the delineation of the ECG waves, the mean and standard deviation of the differences between the automatic and manual annotations were computed. The mean error obtained with the WT approach was found not to exceed one sampling interval, while the standard deviations were around the accepted tolerances between expert physicians, outperforming the results of other well known algorithms, especially in determining the end of T wave.