Anthropogenic changes to forests, agriculture and hydrology are being driven by a need to provide water, food and shelter to more than six billion people. Unfortunately, these changes have a major impact on hydrology, biodiversity, climate, socio-economic stability and food security. The most pervasive form of land-cover change in South Africa is human settlement expansion. In many cases, new human settlements and settlement expansion are informal and occur in areas that are typically covered by natural vegetation. Settlements are infrequently mapped on an ad-hoc basis in South Africa which makes information on when and where new settlements form very difficult. Determining where and when new informal settlements occur is beneficial from not only an ecological but also a social development standpoint. The objective of this thesis is to make use of coarse resolution satellite data to infer the location of new settlement developments in an automated manner by making use of machine learning methods. The specific sensor that is considered in this thesis is the MODIS sensor on-board the Terra and Aqua satellites. By using samples taken at regular intervals (8 days), a hyper-temporal time-series is constructed and consequently used to detect new human settlement formations in South Africa. Two change detection methods are proposed in this thesis to achieve the goal of automated new settlement development detection using this high-temporal coarse resolution satellite time-series data. / Thesis (PhD(Eng))--University of Pretoria, 2012. / Electrical, Electronic and Computer Engineering / unrestricted

The goal of this thesis is to develop better practical methods for detecting common object classes in real world images. We present a family of object detectors that combine Histogram of Oriented Gradient (HOG), Local Binary Pattern (LBP) and Local Ternary Pattern (LTP) features with efficient Latent SVM classifiers and effective dimensionality reduction and sparsification schemes to give state-of-the-art performance on several important datasets including PASCAL VOC2006 and VOC2007, INRIA Person and ETHZ. The three main contributions are as follows. Firstly, we pioneer the use of Local Ternary Pattern features for object detection, showing that LTP gives better overall performance than HOG and LBP, because it captures both rich local texture and object shape information while being resistant to variations in lighting conditions. It thus works well both for classes that are recognized mainly by their structure and ones that are recognized mainly by their textures. We also show that HOG, LBP and LTP complement one another, so that an extended feature set that incorporates all three of them gives further improvements in performance. Secondly, in order to tackle the speed and memory usage problems associated with high-dimensional modern feature sets, we propose two effective dimensionality reduction techniques. The first, feature projection using Partial Least Squares, allows detectors to be trained more rapidly with negligible loss of accuracy and no loss of run time speed for linear detectors. The second, feature selection using SVM weight truncation, allows active feature sets to be reduced in size by almost an order of magnitude with little or no loss, and often a small gain, in detector accuracy. Despite its simplicity, this feature selection scheme outperforms all of the other sparsity enforcing methods that we have tested. Lastly, we describe work in progress on Local Quantized Patterns (LQP), a generalized form of local pattern features that uses lookup table based vector quantization to provide local pattern style pixel neighbourhood codings that have the speed of LBP/LTP and some of the flexibility and power of traditional visual word representations. Our experiments show that LQP outperforms all of the other feature sets tested including HOG, LBP and LTP.

In recent years, a considerable amount of work has been devoted to the task of automatic frame-semantic analysis. Given the relative maturity of syntactic parsing technology, which is an important prerequisite, frame-semantic analysis represents a realistic next step towards broad-coverage natural language understanding and has been shown to benefit a range of natural language processing applications such as information extraction and question answering. Due to the complexity which arises from variations in syntactic realization, data-driven models based on supervised learning have become the method of choice for this task. However, the reliance on large amounts of semantically labeled data which is costly to produce for every language, genre and domain, presents a major barrier to the widespread application of the supervised approach. This thesis therefore develops unsupervised machine learning methods, which automatically induce frame-semantic representations without making use of semantically labeled data. If successful, unsupervised methods would render manual data annotation unnecessary and therefore greatly benefit the applicability of automatic framesemantic analysis. We focus on the problem of semantic role induction, in which all the argument instances occurring together with a specific predicate in a corpus are grouped into clusters according to their semantic role. Our hypothesis is that semantic roles can be induced without human supervision from a corpus of syntactically parsed sentences, by leveraging the syntactic relations conveyed through parse trees with lexical-semantic information. We argue that semantic role induction can be guided by three linguistic principles. The first is the well-known constraint that semantic roles are unique within a particular frame. The second is that the arguments occurring in a specific syntactic position within a specific linking all bear the same semantic role. The third principle is that the (asymptotic) distribution over argument heads is the same for two clusters which represent the same semantic role. We consider two approaches to semantic role induction based on two fundamentally different perspectives on the problem. Firstly, we develop feature-based probabilistic latent structure models which capture the statistical relationships that hold between the semantic role and other features of an argument instance. Secondly, we conceptualize role induction as the problem of partitioning a graph whose vertices represent argument instances and whose edges express similarities between these instances. The graph thus represents all the argument instances for a particular predicate occurring in the corpus. The similarities with respect to different features are represented on different edge layers and accordingly we develop algorithms for partitioning such multi-layer graphs. We empirically validate our models and the principles they are based on and show that our graph partitioning models have several advantages over the feature-based models. In a series of experiments on both English and German the graph partitioning models outperform the feature-based models and yield significantly better scores over a strong baseline which directly identifies semantic roles with syntactic positions. In sum, we demonstrate that relatively high-quality shallow semantic representations can be induced without human supervision and foreground a promising direction of future research aimed at overcoming the problem of acquiring large amounts of lexicalsemantic knowledge.

Le but de cette thèse est de développer des méthodes pratiques plus performantes pour la détection d'instances de classes d'objets de la vie quotidienne dans les images. Nous présentons une famille de détecteurs qui incorporent trois types d'indices visuelles performantes – histogrammes de gradients orientés (Histograms of Oriented Gradients, HOG), motifs locaux binaires (Local Binary Patterns, LBP) et motifs locaux ternaires (Local Ternary Patterns, LTP) – dans des méthodes de discrimination efficaces de type machine à vecteur de support latent (Latent SVM), sous deux régimes de réduction de dimension – moindres carrées partielles (Partial Least Squares, PLS) et sélection de variables par élagage de poids SVM (SVM Weight Truncation). Sur plusieurs jeux de données importantes, notamment ceux du PASCAL VOC2006 et VOC2007, INRIA Person et ETH Zurich, nous démontrons que nos méthodes améliorent l'état de l'art du domaine. Nos contributions principales sont : – Nous étudions l'indice visuelle LTP pour la détection d'objets. Nous démontrons que sa performance est globalement mieux que celle des indices bien établies HOG et LBP parce qu'elle permet d'encoder à la fois la texture locale de l'objet et sa forme globale, tout en étant résistante aux variations d'éclairage. Grâce à ces atouts, LTP fonctionne aussi bien pour les classes qui sont caractérisées principalement par leurs structures que pour celles qui sont caractérisées par leurs textures. En plus, nous démontrons que les indices HOG, LBP et LTP sont bien complémentaires, de sorte qu'un jeux d'indices étendu qui intègre tous les trois améliore encore la performance. – Les jeux d'indices visuelles performantes étant de dimension assez élevée, nous proposons deux méthodes de réduction de dimension afin d'améliorer leur vitesse et réduire leur utilisation de mémoire. La première, basée sur la projection moindres carrés partielles, diminue significativement le temps de formation des détecteurs linéaires, sans réduction de précision ni perte de vitesse d'exécution. La seconde, fondée sur la sélection de variables par l'élagage des poids du SVM, nous permet de réduire le nombre d'indices actives par un ordre de grandeur avec une réduction minime, voire même une petite augmentation, de la précision du détecteur. Malgré sa simplicité, cette méthode de sélection de variables surpasse toutes les autres approches que nous avons mis à l'essai. – Enfin, nous décrivons notre travail en cours sur une nouvelle variété d'indice visuelle – les « motifs locaux quantifiées » (Local Quantized Patterns, LQP). LQP généralise les indices existantes LBP / LTP en introduisant une étape de quantification vectorielle – ce qui permet une souplesse et une puissance analogue aux celles des approches de reconnaissance visuelle « sac de mots », qui sont basées sur la quantification des régions locales d'image considérablement plus grandes – sans perdre la simplicité et la rapidité qui caractérisent les approches motifs locales actuelles parce que les résultats de la quantification puissent être pré-compilés et stockés dans un tableau. LQP permet une augmentation considérable de la taille du support local de l'indice, et donc de sa puissance discriminatoire. Nos expériences indiquent qu'elle a la meilleure performance de toutes les indices visuelles testés, y compris HOG, LBP et LTP. / The goal of this thesis is to develop better practical methods for detecting common object classes in real world images. We present a family of object detectors that combine Histogram of Oriented Gradient (HOG), Local Binary Pattern (LBP) and Local Ternary Pattern (LTP) features with efficient Latent SVM classifiers and effective dimensionality reduction and sparsification schemes to give state-of-the-art performance on several important datasets including PASCAL VOC2006 and VOC2007, INRIA Person and ETHZ. The three main contributions are as follows. Firstly, we pioneer the use of Local Ternary Pattern features for object detection, showing that LTP gives better overall performance than HOG and LBP, because it captures both rich local texture and object shape information while being resistant to variations in lighting conditions. It thus works well both for classes that are recognized mainly by their structure and ones that are recognized mainly by their textures. We also show that HOG, LBP and LTP complement one another, so that an extended feature set that incorporates all three of them gives further improvements in performance. Secondly, in order to tackle the speed and memory usage problems associated with high-dimensional modern feature sets, we propose two effective dimensionality reduction techniques. The first, feature projection using Partial Least Squares, allows detectors to be trained more rapidly with negligible loss of accuracy and no loss of run time speed for linear detectors. The second, feature selection using SVM weight truncation, allows active feature sets to be reduced in size by almost an order of magnitude with little or no loss, and often a small gain, in detector accuracy. Despite its simplicity, this feature selection scheme outperforms all of the other sparsity enforcing methods that we have tested. Lastly, we describe work in progress on Local Quantized Patterns (LQP), a generalized form of local pattern features that uses lookup table based vector quantization to provide local pattern style pixel neighbourhood codings that have the speed of LBP/LTP and some of the flexibility and power of traditional visual word representations. Our experiments show that LQP outperforms all of the other feature sets tested including HOG, LBP and LTP.

Background: To preserve valuable sources and cultural heritage, digitization of handwritten characters is crucial. For this, Optical Character Recognition (OCR) systems were introduced and most widely used to recognize digital characters. Incase of ancient or historical characters, automatic transcription is more challenging due to lack of data, high complexity and low quality of the resource. To solve these problems, multiple image based handwritten dataset were collected from historicaland modern document images. But these dataset also have some limitations. To overcome the limitations, we were inspired to create a new image-based historical handwritten character and word dataset and evaluate it’s performance using machine learning algorithms. Objectives: The main objective of this thesis is to create a first ever Swedish historical handwritten character and word dataset named CArDIS (Character Arkiv Digital Sweden) which will be publicly available for further research. In addition,verify the correctness of the dataset and perform a quantitative analysis using different machine learning methods. Methods: Initially we searched for existing character dataset to know how modern character dataset differs from the historical handwritten dataset. We have performed literature review to learn about most commonly used dataset for OCR. On the other hand, we have also studied different machine learning algorithms and their applica-tions. Finally, we have trained six different machine learning methods namely Support Vector Machine, k-Nearest Neighbor, Convolutional Neural Network, Recurrent Neural Network, Random Forest, SVM-HOG with existing dataset and newly created dataset to evaluate the performance and efficiency of recognizing ancient handwritten characters. Results: The performance/evaluation results show that the machine learning classifiers struggle to recognise the ancient handwritten characters with less recognition accuracy. Out of which CNN outperforms with highest recognition accuracy. Conclusions: The current thesis introduces first ever newly created historical hand-written character and word dataset in Swedish named CArDIS. The character dataset contains 1,01,500 Latin and Swedish character images belonging to 29 classes while the word dataset contains 10,000 word images containing ten popular Swedish names belonging to 10 classes in RGB color space. Also, the performance of six machine learning classifiers on CArDIS and existing datasets have been reported. The thesis concludes that classifiers when trained on existing dataset and tested on CArDIS dataset show low recognition accuracy proving that, the CArDIS dataset have unique characteristics and features over the existing handwritten datasets. Finally, this re-search provided a first Swedish character and word dataset, which is robust with a proven accuracy; also it is publicly available for further research.

Context: The main purpose of this thesis is to build an automatic handwritten digit recognition method for the recognition of connected handwritten digit strings. To accomplish the recognition task, first, the digits were segmented into individual digits. Then, a digit recognition module is employed to classify each segmented digit completing the handwritten digit string recognition task. In this study, different machine learning methods, which are SVM, ANN and CNN architectures are used to achieve high performance on the digit string recognition problem. In these methods, images of digit strings are trained with the SVM, ANN and CNN model with HOG feature vectors and Deep learning methods structure by sliding a fixed size window through the images labeling each sub-image as a part of a digit or not. After the completion of the segmentation, to achieve the complete recognition of handwritten digits.Objective: The main purpose of this thesis is to find out the recognition performance of the methods. In order to analyze the performance of the methods, data is needed to be used for training using machine learning methods. Then digit data is tested on the desired machine learning technique. In this thesis, the following methods are performed: Implementation of HOG Feature extraction method with SVM Implementation of HOG Feature extraction method with ANN Implementation of Deep Learning methods with CNN Methods: This research will be carried out using two methods. The first research method is the ¨Literature Review¨ and the second ¨Experiment¨. Initially, a literature review is conducted to get a clear knowledge on the algorithms and techniques which will be used to answer the first research question i.e., to know which type of data is required for the machine learning methods and the data analysis is performed. Later on, with the knowledge of RQ1, Experimentation is conducted to answer the RQ2, RQ3, RQ4. Quantitative data is used to perform the experimentation because qualitative data which obtains from case-study and survey cannot be used for this experiment method as it contains non-numerical data. In this research, an experiment is conducted to find the best suitable machine learning method from the existing methods. As mentioned above in the objectives, an experiment is conducted using SVM, ANN, and CNN. By considering the results obtained from the experiment, a comparison is made on the metrics considered which results in CNN as the best method suitable for Documents Images. Results: Compare the results for SVM, ANN with HOG Feature extraction and the CNN method by using segmented results. Based on the Experiment results it is found that SVM and ANN have some drawbacks like low accuracy and low performance in the recognition of documented images. So, the other method i.e., CNN has greater performance with high accuracy. The following are the results of the recognition rates of each method. SVM performance - 39% ANN performance - 37% CNN performance - 71%. Conclusion: This research concentrates on providing an efficient method for recognition of automatic handwritten digits recognition. Here a sample training data is treated with existing machine learning and deep learning methods like SVM, ANN, and CNN. By the results obtained from the experimentation, it clearly is shown that the CNN method is much efficient with 71% performance when compared to ANN and SVM methods. Keywords: Handwritten Digit Recognition, Handwritten Digit Segmentation, Handwritten Digit Classification, Machine Learning Methods, Deep Learning, Image processing on document images, Support Vector Machine, Conventional Neural Networks, Artificial Neural Networks

The power industry has undergone significant restructuring throughout the world since the 1990s. In particular, its traditional, vertically monopolistic structures have been reformed into competitive markets in pursuit of increased efficiency in electricity production and utilization. However, along with market deregulation, power systems presently face severe challenges. One is power system stability, a problem that has attracted widespread concern because of severe blackouts experienced in the USA, the UK, Italy, and other countries. Another is that electricity market operation warrants more effective planning, management, and direction techniques due to the ever expanding large-scale interconnection of power grids. Moreover, many exterior constraints, such as environmental protection influences and associated government regulations, now need to be taken into consideration. All these have made existing challenges even more complex. One consequence is that more advanced power system data analysis methods are required in the deregulated, market-oriented environment. At the same time, the computational power of modern computers and the application of databases have facilitated the effective employment of new data analysis techniques. In this thesis, the reported research is directed at developing computational intelligence based techniques to solve several power system problems that emerge in deregulated electricity markets. Four major contributions are included in the thesis: a newly proposed quantum-inspired particle swarm optimization and self-adaptive learning scheme for radial basis function neural networks; online wavelet denoising techniques; electricity regional reference price forecasting methods in the electricity market; and power system security assessment approaches for deregulated markets, including fault analysis, voltage profile prediction under contingencies, and machine learning based load shedding scheme for voltage stability enhancement. Evolutionary algorithms (EAs) inspired by biological evolution mechanisms have had great success in power system stability analysis and operation planning. Here, a new quantum-inspired particle swarm optimization (QPSO) is proposed. Its inspiration stems from quantum computation theory, whose mechanism is totally different from those of original EAs. The benchmark data sets and economic load dispatch research results show that the QPSO improves on other versions of evolutionary algorithms in terms of both speed and accuracy. Compared to the original PSO, it greatly enhances the searching ability and efficiently manages system constraints. Then, fuzzy C-means (FCM) and QPSO are applied to train radial basis function (RBF) neural networks with the capacity to auto-configure the network structures and obtain the model parameters. The benchmark data sets test results suggest that the proposed training algorithms ensure good performance on data clustering, also improve training and generalization capabilities of RBF neural networks. Wavelet analysis has been widely used in signal estimation, classification, and compression. Denoising with traditional wavelet transforms always exhibits visual artefacts because of translation-variant. Furthermore, in most cases, wavelet denoising of real-time signals is actualized via offline processing which limits the efficacy of such real-time applications. In the present context, an online wavelet denoising method using a moving window technique is proposed. Problems that may occur in real-time wavelet denoising, such as border distortion and pseudo-Gibbs phenomena, are effectively solved by using window extension and window circle spinning methods. This provides an effective data pre-processing technique for the online application of other data analysis approaches. In a competitive electricity market, price forecasting is one of the essential functions required of a generation company and the system operator. It provides critical information for building up effective risk management plans by market participants, especially those companies that generate and retail electrical power. Here, an RBF neural network is adopted as a predictor of the electricity market regional reference price in the Australian national electricity market (NEM). Furthermore, the wavelet denoising technique is adopted to pre-process the historical price data. The promising network prediction performance with respect to price data demonstrates the efficiency of the proposed method, with real-time wavelet denoising making feasible the online application of the proposed price prediction method. Along with market deregulation, power system security assessment has attracted great concern from both academic and industry analysts, especially after several devastating blackouts in the USA, the UK, and Russia. This thesis goes on to propose an efficient composite method for cascading failure prevention comprising three major stages. Firstly, a hybrid method based on principal component analysis (PCA) and specific statistic measures is used to detect system faults. Secondly, the RBF neural network is then used for power network bus voltage profile prediction. Tests are carried out by means of the “N-1” and “N-1-1” methods applied in the New England power system through PSS/E dynamic simulations. Results show that system faults can be reliably detected and voltage profiles can be correctly predicted. In contrast to traditional methods involving phase calculation, this technique uses raw data from time domains and is computationally inexpensive in terms of both memory and speed for practical applications. This establishes a connection between power system fault analysis and cascading analysis. Finally, a multi-stage model predictive control (MPC) based load shedding scheme for ensuring power system voltage stability is proposed. It has been demonstrated that optimal action in the process of load shedding for voltage stability during emergencies can be achieved as a consequence. Based on above discussions, a framework for analysing power system voltage stability and ensuring its enhancement is proposed, with such a framework able to be used as an effective means of cascading failure analysis. In summary, the research reported in this thesis provides a composite framework for power system data analysis in a market environment. It covers advanced techniques of computational intelligence and machine learning, also proposes effective solutions for both the market operation and the system stability related problems facing today’s power industry.

The power industry has undergone significant restructuring throughout the world since the 1990s. In particular, its traditional, vertically monopolistic structures have been reformed into competitive markets in pursuit of increased efficiency in electricity production and utilization. However, along with market deregulation, power systems presently face severe challenges. One is power system stability, a problem that has attracted widespread concern because of severe blackouts experienced in the USA, the UK, Italy, and other countries. Another is that electricity market operation warrants more effective planning, management, and direction techniques due to the ever expanding large-scale interconnection of power grids. Moreover, many exterior constraints, such as environmental protection influences and associated government regulations, now need to be taken into consideration. All these have made existing challenges even more complex. One consequence is that more advanced power system data analysis methods are required in the deregulated, market-oriented environment. At the same time, the computational power of modern computers and the application of databases have facilitated the effective employment of new data analysis techniques. In this thesis, the reported research is directed at developing computational intelligence based techniques to solve several power system problems that emerge in deregulated electricity markets. Four major contributions are included in the thesis: a newly proposed quantum-inspired particle swarm optimization and self-adaptive learning scheme for radial basis function neural networks; online wavelet denoising techniques; electricity regional reference price forecasting methods in the electricity market; and power system security assessment approaches for deregulated markets, including fault analysis, voltage profile prediction under contingencies, and machine learning based load shedding scheme for voltage stability enhancement. Evolutionary algorithms (EAs) inspired by biological evolution mechanisms have had great success in power system stability analysis and operation planning. Here, a new quantum-inspired particle swarm optimization (QPSO) is proposed. Its inspiration stems from quantum computation theory, whose mechanism is totally different from those of original EAs. The benchmark data sets and economic load dispatch research results show that the QPSO improves on other versions of evolutionary algorithms in terms of both speed and accuracy. Compared to the original PSO, it greatly enhances the searching ability and efficiently manages system constraints. Then, fuzzy C-means (FCM) and QPSO are applied to train radial basis function (RBF) neural networks with the capacity to auto-configure the network structures and obtain the model parameters. The benchmark data sets test results suggest that the proposed training algorithms ensure good performance on data clustering, also improve training and generalization capabilities of RBF neural networks. Wavelet analysis has been widely used in signal estimation, classification, and compression. Denoising with traditional wavelet transforms always exhibits visual artefacts because of translation-variant. Furthermore, in most cases, wavelet denoising of real-time signals is actualized via offline processing which limits the efficacy of such real-time applications. In the present context, an online wavelet denoising method using a moving window technique is proposed. Problems that may occur in real-time wavelet denoising, such as border distortion and pseudo-Gibbs phenomena, are effectively solved by using window extension and window circle spinning methods. This provides an effective data pre-processing technique for the online application of other data analysis approaches. In a competitive electricity market, price forecasting is one of the essential functions required of a generation company and the system operator. It provides critical information for building up effective risk management plans by market participants, especially those companies that generate and retail electrical power. Here, an RBF neural network is adopted as a predictor of the electricity market regional reference price in the Australian national electricity market (NEM). Furthermore, the wavelet denoising technique is adopted to pre-process the historical price data. The promising network prediction performance with respect to price data demonstrates the efficiency of the proposed method, with real-time wavelet denoising making feasible the online application of the proposed price prediction method. Along with market deregulation, power system security assessment has attracted great concern from both academic and industry analysts, especially after several devastating blackouts in the USA, the UK, and Russia. This thesis goes on to propose an efficient composite method for cascading failure prevention comprising three major stages. Firstly, a hybrid method based on principal component analysis (PCA) and specific statistic measures is used to detect system faults. Secondly, the RBF neural network is then used for power network bus voltage profile prediction. Tests are carried out by means of the “N-1” and “N-1-1” methods applied in the New England power system through PSS/E dynamic simulations. Results show that system faults can be reliably detected and voltage profiles can be correctly predicted. In contrast to traditional methods involving phase calculation, this technique uses raw data from time domains and is computationally inexpensive in terms of both memory and speed for practical applications. This establishes a connection between power system fault analysis and cascading analysis. Finally, a multi-stage model predictive control (MPC) based load shedding scheme for ensuring power system voltage stability is proposed. It has been demonstrated that optimal action in the process of load shedding for voltage stability during emergencies can be achieved as a consequence. Based on above discussions, a framework for analysing power system voltage stability and ensuring its enhancement is proposed, with such a framework able to be used as an effective means of cascading failure analysis. In summary, the research reported in this thesis provides a composite framework for power system data analysis in a market environment. It covers advanced techniques of computational intelligence and machine learning, also proposes effective solutions for both the market operation and the system stability related problems facing today’s power industry.

Autism Spectrum Disorder (ASD) is part of the developmental disabilities. There are numerous symptoms for ASD patients, including lack of abilities in social interaction, communication obstacle and repeatable behaviors. Meanwhile, the rate of ASD prevalence has kept rising by the past 20 years from 1 out of 150 in 2000 to 1 out of 54 in 2016. In addition, the ASD population is quite large. Specifically, 3.5 million Americans live with ASD in the year of 2014, which will cost U.S. citizens $236-$262 billion dollars annually for autism services. So, it is critical to make an accurate diagnosis for preschool age children with ASD, in order to give them a better life. Instead of using traditional ASD behavioral tests, such as ADI-R, ADOS, and DSM-IV, we applied brain MRI images as input to make diagnosis. We revised 3D-ResNet structure to fit 110 preschool children's brain MRI data, along with Convolution 3D and VGG model. The prediction accuracy with raw data is 65.22%. The accuracy is significantly improved to 82.61% by removing the noise around the brain. We also showed the speed of ML prediction is 308 times faster than behavior tests.

El texto completo de este trabajo no está disponible en el Repositorio Académico UPC por restricciones de la casa editorial donde ha sido publicado. / Protein fold recognition is an important task in the biological area. Different machine learning methods such as multiclass classifiers, one-vs-all and ensemble nested dichotomies were applied to this task and, in most of the cases, multiclass approaches were used. In this paper, we compare classifiers organized in tree structures to classify folds. We used a benchmark dataset containing 125 features to predict folds, comparing different supervised methods and achieving 54% of accuracy. An approach related to tree-structure of classifiers obtained better results in comparison with a hierarchical approach. / Revisión por pares