A Hybrid Random Forest based Support Vector Machine Classification Supplemented by Boosting

This paper presents an approach to classify remote sensed data using a hybrid classifier. Random forest, Support Vector machines and boosting methods are used to build the said hybrid classifier. The central idea is to subdivide the input data set into smaller subsets and classify individual subsets. The individual subset classification is done using support vector machines classifier. Boosting is used at each subset to evaluate the learning by using a weight factor for every data item in the data set. The weight factor is updated based on classification accuracy. Later the final outcome for the complete data set is computed by implementing a majority voting mechanism to the individual subset classification outcomes

Utility of AdaBoost to Detect Sleep Apnea-Hypopnea Syndrome From Single-Channel Airflow

Producción CientíficaThe purpose of this study is to evaluate the usefulness of the boosting algorithm AdaBoost (AB) in the context of the sleep apnea-hypopnea syndrome (SAHS) diagnosis. Methods: We characterize SAHS in single-channel airflow (AF) signals from 317 subjects by the extraction of spectral and non-linear features. Relevancy and redundancy analyses are conducted through the fast correlation-based filter (FCBF) to derive the optimum set of features among them. These are used to feed classifiers based on linear discriminant analysis (LDA) and classification and regression trees (CART). LDA and CART models are sequentially obtained through AB, which combines their performances to reach higher diagnostic ability than each of them separately. Results: Our AB-LDA and AB-CART approaches showed high diagnostic performance when determining SAHS and its severity. The assessment of different apnea-hypopnea index cutoffs using an independent test set derived into high accuracy: 86.5% (5 events/h), 86.5% (10 events/h), 81.0% (15 events/h), and 83.3% (30 events/h). These results widely outperformed those from logistic regression and a conventional event-detection algorithm applied to the same database. Conclusion: Our results suggest that AB applied to data from single-channel AF can be useful to determine SAHS and its severity. Significance: SAHS detection might be simplified through the only use of single-channel AF data.Ministerio de Economía y Competitividad (project TEC2011-22987)Junta de Castilla y León (project VA059U13

Parallelizing support vector machines for scalable image annotation

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Machine learning techniques have facilitated image retrieval by automatically classifying and annotating images with keywords. Among them Support Vector Machines (SVMs) are used extensively due to their generalization properties. However, SVM training is notably a computationally intensive process especially when the training dataset is large. In this thesis distributed computing paradigms have been investigated to speed up SVM training, by partitioning a large training dataset into small data chunks and process each chunk in parallel utilizing the resources of a cluster of computers. A resource aware parallel SVM algorithm is introduced for large scale image annotation in parallel using a cluster of computers. A genetic algorithm based load balancing scheme is designed to optimize the performance of the algorithm in heterogeneous computing environments. SVM was initially designed for binary classifications. However, most classification problems arising in domains such as image annotation usually involve more than two classes. A resource aware parallel multiclass SVM algorithm for large scale image annotation in parallel using a cluster of computers is introduced. The combination of classifiers leads to substantial reduction of classification error in a wide range of applications. Among them SVM ensembles with bagging is shown to outperform a single SVM in terms of classification accuracy. However, SVM ensembles training are notably a computationally intensive process especially when the number replicated samples based on bootstrapping is large. A distributed SVM ensemble algorithm for image annotation is introduced which re-samples the training data based on bootstrapping and training SVM on each sample in parallel using a cluster of computers. The above algorithms are evaluated in both experimental and simulation environments showing that the distributed SVM algorithm, distributed multiclass SVM algorithm, and distributed SVM ensemble algorithm, reduces the training time significantly while maintaining a high level of accuracy in classifications

Doctor of Philosophy

dissertationScene labeling is the problem of assigning an object label to each pixel of a given image. It is the primary step towards image understanding and unifies object recognition and image segmentation in a single framework. A perfect scene labeling framework detects and densely labels every region and every object that exists in an image. This task is of substantial importance in a wide range of applications in computer vision. Contextual information plays an important role in scene labeling frameworks. A contextual model utilizes the relationships among the objects in a scene to facilitate object detection and image segmentation. Using contextual information in an effective way is one of the main questions that should be answered in any scene labeling framework. In this dissertation, we develop two scene labeling frameworks that rely heavily on contextual information to improve the performance over state-of-the-art methods. The first model, called the multiclass multiscale contextual model (MCMS), uses contextual information from multiple objects and at different scales for learning discriminative models in a supervised setting. The MCMS model incorporates crossobject and interobject information into one probabilistic framework, and thus is able to capture geometrical relationships and dependencies among multiple objects in addition to local information from each single object present in an image. The second model, called the contextual hierarchical model (CHM), learns contextual information in a hierarchy for scene labeling. At each level of the hierarchy, a classifier is trained based on downsampled input images and outputs of previous levels. The CHM then incorporates the resulting multiresolution contextual information into a classifier to segment the input image at original resolution. This training strategy allows for optimization of a joint posterior probability at multiple resolutions through the hierarchy. We demonstrate the performance of CHM on different challenging tasks such as outdoor scene labeling and edge detection in natural images and membrane detection in electron microscopy images. We also introduce two novel classification methods. WNS-AdaBoost speeds up the training of AdaBoost by providing a compact representation of a training set. Disjunctive normal random forest (DNRF) is an ensemble method that is able to learn complex decision boundaries and achieves low generalization error by optimizing a single objective function for each weak classifier in the ensemble. Finally, a segmentation framework is introduced that exploits both shape information and regional statistics to segment irregularly shaped intracellular structures such as mitochondria in electron microscopy images

Estudio de métodos de construcción de ensembles de clasificadores y aplicaciones

La inteligencia artificial se dedica a la creación de sistemas informáticos con un comportamiento inteligente. Dentro de este área el aprendizaje computacional estudia la creación de sistemas que aprenden por sí mismos. Un tipo de aprendizaje computacional es el aprendizaje supervisado, en el cual, se le proporcionan al sistema tanto las entradas como la salida esperada y el sistema aprende a partir de estos datos. Un sistema de este tipo se denomina clasificador. En ocasiones ocurre, que en el conjunto de ejemplos que utiliza el sistema para aprender, el número de ejemplos de un tipo es mucho mayor que el número de ejemplos de otro tipo. Cuando esto ocurre se habla de conjuntos desequilibrados. La combinación de varios clasificadores es lo que se denomina "ensemble", y a menudo ofrece mejores resultados que cualquiera de los miembros que lo forman. Una de las claves para el buen funcionamiento de los ensembles es la diversidad. Esta tesis, se centra en el desarrollo de nuevos algoritmos de construcción de ensembles, centrados en técnicas de incremento de la diversidad y en los problemas desequilibrados. Adicionalmente, se aplican estas técnicas a la solución de varias problemas industriales.Ministerio de Economía y Competitividad, proyecto TIN-2011-2404

Pediatric sleep apnea: Characterization of apneic events and sleep stages using heart rate variability

Producción CientíficaHeart rate variability (HRV) is modulated by sleep stages and apneic events. Previous studies in children compared classical HRV parameters during sleep stages between obstructive sleep apnea (OSA) and controls. However, HRV-based characterization incorporating both sleep stages and apneic events has not been conducted. Furthermore, recently proposed novel HRV OSA-specific parameters have not been evaluated. Therefore, the aim of this study was to characterize and compare classic and pediatric OSA-specific HRV parameters while including both sleep stages and apneic events. A total of 1610 electrocardiograms from the Childhood Adenotonsillectomy Trial (CHAT) database were split into 10-minute segments to extract HRV parameters. Segments were characterized and grouped by sleep stage (wake, W; non-rapid eye movement, NREMS; and REMS) and presence of apneic events (under 1 apneic event per segment, e/s; 1–5 e/s; 5–10 e/s; and over 10 e/s). NREMS showed significant changes in HRV parameters as apneic event frequency increased, which were less marked in REMS. In both NREMS and REMS, power in BW2, a pediatric OSA-specific frequency domain, allowed for the optimal differentiation among segments. Moreover, in the absence of apneic events, another defined band, BWRes, resulted in best differentiation between sleep stages. The clinical usefulness of segment-based HRV characterization was then confirmed by two ensemble-learning models aimed at estimating apnea-hypopnea index and classifying sleep stages, respectively. We surmise that basal sympathetic activity during REMS may mask apneic events-induced sympathetic excitation, thus highlighting the importance of incorporating sleep stages as well as apneic events when evaluating HRV in pediatric OSA.Ministerio de Ciencia, Innovación y Universidades y el Fondo Europeo de Desarrollo Regional (FEDER) under projects (PID2019-104881RB-I00), (PID2020-115468RB-I00), (PDC2021-120775-I00) and (PID2021-126734OB-C21)Sociedad Española de Sueño (SES) en el marco del proyecto “Beca de Investigación SES 2019”, by 'CIBER-Consorcio Centro de Investigación Biomédica en Red- (CB19/01/00012)' a través del 'Instituto de Salud Carlos III' co- financiado con fondos FEDER, así como bajo el proyecto SleepyHeart de la convocatoria de valorización 2020, y por el Gobierno de Aragón (Grupo de Referencia BSICoS T39-20R).The National Sleep Research Resource was supported by the National Heart, Lung, and Blood Institute (R24 HL114473, 75N92019R002).Ministerio de Ciencia, Innovación y Universidades, “Ayudas para contratos predoctorales para la Formación de Doctores” grant (PRE2018-085219) and “Ramón y Cajal” (MICIU/FSE) grant (RYC2019-028566-I)Institutos Nacionales de Salud-"Ensayo de adenoamigdalectomía infantil (CHAT)"- (HL083075, HL083129, UL1-RR-024134, UL1 RR024989) and (grant AG061824)

A Hybrid Random Forest based Support Vector Machine Classification Supplemented by Boosting

This paper presents an approach to classify remote sensed data using a hybrid classifier. Random forest, Support Vector machines and boosting methods are used to build the said hybrid classifier. The central idea is to subdivide the input data set into smaller subsets and classify individual subsets. The individual subset classification is done using support vector machines classifier. Boosting is used at each subset to evaluate the learning by using a weight factor for every data item in the data set. The weight factor is updated based on classification accuracy. Later the final outcome for the complete data set is computed by implementing a majority voting mechanism to the individual subset classification outcomes