• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 28
  • 18
  • 3
  • 3
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 65
  • 65
  • 21
  • 20
  • 18
  • 15
  • 11
  • 9
  • 9
  • 8
  • 8
  • 8
  • 8
  • 7
  • 7
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
61

Machine learning in complex networks: modeling, analysis, and applications / Aprendizado de máquina em redes complexas: modelagem, análise e aplicações

Silva, Thiago Christiano 13 December 2012 (has links)
Machine learning is evidenced as a research area with the main purpose of developing computational methods that are capable of learning with their previously acquired experiences. Although a large amount of machine learning techniques has been proposed and successfully applied in real systems, there are still many challenging issues, which need be addressed. In the last years, an increasing interest in techniques based on complex networks (large-scale graphs with nontrivial connection patterns) has been verified. This emergence is explained by the inherent advantages provided by the complex network representation, which is able to capture the spatial, topological and functional relations of the data. In this work, we investigate the new features and possible advantages offered by complex networks in the machine learning domain. In fact, we do show that the network-based approach really brings interesting features for supervised, semisupervised, and unsupervised learning. Specifically, we reformulate a previously proposed particle competition technique for both unsupervised and semisupervised learning using a stochastic nonlinear dynamical system. Moreover, an analytical analysis is supplied, which enables one to predict the behavior of the proposed technique. In addition to that, data reliability issues are explored in semisupervised learning. Such matter has practical importance and is found to be of little investigation in the literature. With the goal of validating these techniques for solving real problems, simulations on broadly accepted databases are conducted. Still in this work, we propose a hybrid supervised classification technique that combines both low and high orders of learning. The low level term can be implemented by any classification technique, while the high level term is realized by the extraction of features of the underlying network constructed from the input data. Thus, the former classifies the test instances by their physical features, while the latter measures the compliance of the test instances with the pattern formation of the data. Our study shows that the proposed technique not only can realize classification according to the semantic meaning of the data, but also is able to improve the performance of traditional classification techniques. Finally, it is expected that this study will contribute, in a relevant manner, to the machine learning area / Aprendizado de máquina figura-se como uma área de pesquisa que visa a desenvolver métodos computacionais capazes de aprender com a experiência. Embora uma grande quantidade de técnicas de aprendizado de máquina foi proposta e aplicada, com sucesso, em sistemas reais, existem ainda inúmeros problemas desafiantes que necessitam ser explorados. Nos últimos anos, um crescente interesse em técnicas baseadas em redes complexas (grafos de larga escala com padrões de conexão não triviais) foi verificado. Essa emergência é explicada pelas inerentes vantagens que a representação em redes complexas traz, sendo capazes de capturar as relações espaciais, topológicas e funcionais dos dados. Nesta tese, serão investigadas as possíveis vantagens oferecidas por redes complexas quando utilizadas no domínio de aprendizado de máquina. De fato, será mostrado que a abordagem por redes realmente proporciona melhorias nos aprendizados supervisionado, semissupervisionado e não supervisionado. Especificamente, será reformulada uma técnica de competição de partículas para o aprendizado não supervisionado e semissupervisionado por meio da utilização de um sistema dinâmico estocástico não linear. Em complemento, uma análise analítica de tal modelo será desenvolvida, permitindo o entendimento evolucional do modelo no tempo. Além disso, a questão de confiabilidade de dados será investigada no aprendizado semissupervisionado. Tal tópico tem importância prática e é pouco estudado na literatura. Com o objetivo de validar essas técnicas em problemas reais, simulações computacionais em bases de dados consagradas pela literatura serão conduzidas. Ainda nesse trabalho, será proposta uma técnica híbrica de classificação supervisionada que combina tanto o aprendizado de baixo como de alto nível. O termo de baixo nível pode ser implementado por qualquer técnica de classificação tradicional, enquanto que o termo de alto nível é realizado pela extração das características de uma rede construída a partir dos dados de entrada. Nesse contexto, aquele classifica as instâncias de teste segundo qualidades físicas, enquanto que esse estima a conformidade da instância de teste com a formação de padrões dos dados. Os estudos aqui desenvolvidos mostram que o método proposto pode melhorar o desempenho de técnicas tradicionais de classificação, além de permitir uma classificação de acordo com o significado semântico dos dados. Enfim, acredita-se que este estudo possa gerar contribuições relevantes para a área de aprendizado de máquina.
62

Information fusion and decision-making using belief functions : application to therapeutic monitoring of cancer / Fusion de l’information et prise de décisions à l’aide des fonctions de croyance : application au suivi thérapeutique du cancer

Lian, Chunfeng 27 January 2017 (has links)
La radiothérapie est une des méthodes principales utilisée dans le traitement thérapeutique des tumeurs malignes. Pour améliorer son efficacité, deux problèmes essentiels doivent être soigneusement traités : la prédication fiable des résultats thérapeutiques et la segmentation précise des volumes tumoraux. La tomographie d’émission de positrons au traceur Fluoro- 18-déoxy-glucose (FDG-TEP) peut fournir de manière non invasive des informations significatives sur les activités fonctionnelles des cellules tumorales. Les objectifs de cette thèse sont de proposer: 1) des systèmes fiables pour prédire les résultats du traitement contre le cancer en utilisant principalement des caractéristiques extraites des images FDG-TEP; 2) des algorithmes automatiques pour la segmentation de tumeurs de manière précise en TEP et TEP-TDM. La théorie des fonctions de croyance est choisie dans notre étude pour modéliser et raisonner des connaissances incertaines et imprécises pour des images TEP qui sont bruitées et floues. Dans le cadre des fonctions de croyance, nous proposons une méthode de sélection de caractéristiques de manière parcimonieuse et une méthode d’apprentissage de métriques permettant de rendre les classes bien séparées dans l’espace caractéristique afin d’améliorer la précision de classification du classificateur EK-NN. Basées sur ces deux études théoriques, un système robuste de prédiction est proposé, dans lequel le problème d’apprentissage pour des données de petite taille et déséquilibrées est traité de manière efficace. Pour segmenter automatiquement les tumeurs en TEP, une méthode 3-D non supervisée basée sur le regroupement évidentiel (evidential clustering) et l’information spatiale est proposée. Cette méthode de segmentation mono-modalité est ensuite étendue à la co-segmentation dans des images TEP-TDM, en considérant que ces deux modalités distinctes contiennent des informations complémentaires pour améliorer la précision. Toutes les méthodes proposées ont été testées sur des données cliniques, montrant leurs meilleures performances par rapport aux méthodes de l’état de l’art. / Radiation therapy is one of the most principal options used in the treatment of malignant tumors. To enhance its effectiveness, two critical issues should be carefully dealt with, i.e., reliably predicting therapy outcomes to adapt undergoing treatment planning for individual patients, and accurately segmenting tumor volumes to maximize radiation delivery in tumor tissues while minimize side effects in adjacent organs at risk. Positron emission tomography with radioactive tracer fluorine-18 fluorodeoxyglucose (FDG-PET) can noninvasively provide significant information of the functional activities of tumor cells. In this thesis, the goal of our study consists of two parts: 1) to propose reliable therapy outcome prediction system using primarily features extracted from FDG-PET images; 2) to propose automatic and accurate algorithms for tumor segmentation in PET and PET-CT images. The theory of belief functions is adopted in our study to model and reason with uncertain and imprecise knowledge quantified from noisy and blurring PET images. In the framework of belief functions, a sparse feature selection method and a low-rank metric learning method are proposed to improve the classification accuracy of the evidential K-nearest neighbor classifier learnt by high-dimensional data that contain unreliable features. Based on the above two theoretical studies, a robust prediction system is then proposed, in which the small-sized and imbalanced nature of clinical data is effectively tackled. To automatically delineate tumors in PET images, an unsupervised 3-D segmentation based on evidential clustering using the theory of belief functions and spatial information is proposed. This mono-modality segmentation method is then extended to co-segment tumor in PET-CT images, considering that these two distinct modalities contain complementary information to further improve the accuracy. All proposed methods have been performed on clinical data, giving better results comparing to the state of the art ones.
63

Reconhecimento de padrões em sistemas de energia elétrica através de uma abordagem geométrica aprimorada para a construção de redes neurais artificiais

Valente, Wander Antunes Gaspar 09 February 2015 (has links)
Submitted by Renata Lopes (renatasil82@gmail.com) on 2016-01-08T10:36:58Z No. of bitstreams: 1 wanderantunesgasparvalente.pdf: 4197156 bytes, checksum: 5b667869c3bb237e570559ddf4cbb30d (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2016-01-25T16:56:26Z (GMT) No. of bitstreams: 1 wanderantunesgasparvalente.pdf: 4197156 bytes, checksum: 5b667869c3bb237e570559ddf4cbb30d (MD5) / Made available in DSpace on 2016-01-25T16:56:26Z (GMT). No. of bitstreams: 1 wanderantunesgasparvalente.pdf: 4197156 bytes, checksum: 5b667869c3bb237e570559ddf4cbb30d (MD5) Previous issue date: 2015-02-09 / O presente trabalho fundamenta-se no método das segmentações geométricas sucessivas (MSGS) para a construção de uma rede neural artificial capaz de gerar tanto a topologia da rede quanto o peso dos neurônios sem a especificação de parâmetros iniciais. O MSGS permite identificar um conjunto de hiperplanos no espaço Rn que, quando combinados adequadamente, podem separar duas ou mais classes de dados. Especificamente neste trabalho é empregado um aprimoramento ao MSGS com base em estimativas de densidade por kernel. Utilizando-se KDE, é possível encontrar novos hiperplanos de separação de forma mais consistente e, a partir daí, conduzir à classificação de dados com taxas de acerto superiores à técnica originalmente empregada. Neste trabalho, o MSGS aprimorado é empregado satisfatoriamente pela primeira vez para a identificação de padrões em sistemas de energia elétrica. O método foi ajustado para a classificação de faltas incipientes em transformadores de potência e os resultados apresentam índices de acerto superiores a trabalhos correlatos. O MSGS aprimorado também foi adaptado para classificar e localizar faltas inter-circuitos em linhas áreas de transmissão em circuito duplo, obtendo resultados positivos em comparação com a literatura científica. / This work is based on the method of successive geometric segmentations (SGSM) for the construction of an artificial neural network capable of generating both the network topology as the weight of neurons without specifying initial parameters. The MSGS allows to identify a set of hyperplanes in the Rn space that when properly combined, can separate two or more data classes. Specifically in this work is used an improvement to SGSM based on kernel density estimates (KDE). Using KDE, it is possible to find new hyperplanes of separation more consistently and, from there, lead to data classification with accuracy rates higher than originally technique. In this paper, the improved SGSM is first used satisfactorily to identify patterns in electrical power systems. The method has been adjusted to the classification of incipient faults in power transformers and the results have achieved rates above related work. The improved SGSM has also been adapted to classify and locate inter-circuit faults on double circuit overhead transmission lines with positive results compared with the scientific literature.
64

Machine learning in complex networks: modeling, analysis, and applications / Aprendizado de máquina em redes complexas: modelagem, análise e aplicações

Thiago Christiano Silva 13 December 2012 (has links)
Machine learning is evidenced as a research area with the main purpose of developing computational methods that are capable of learning with their previously acquired experiences. Although a large amount of machine learning techniques has been proposed and successfully applied in real systems, there are still many challenging issues, which need be addressed. In the last years, an increasing interest in techniques based on complex networks (large-scale graphs with nontrivial connection patterns) has been verified. This emergence is explained by the inherent advantages provided by the complex network representation, which is able to capture the spatial, topological and functional relations of the data. In this work, we investigate the new features and possible advantages offered by complex networks in the machine learning domain. In fact, we do show that the network-based approach really brings interesting features for supervised, semisupervised, and unsupervised learning. Specifically, we reformulate a previously proposed particle competition technique for both unsupervised and semisupervised learning using a stochastic nonlinear dynamical system. Moreover, an analytical analysis is supplied, which enables one to predict the behavior of the proposed technique. In addition to that, data reliability issues are explored in semisupervised learning. Such matter has practical importance and is found to be of little investigation in the literature. With the goal of validating these techniques for solving real problems, simulations on broadly accepted databases are conducted. Still in this work, we propose a hybrid supervised classification technique that combines both low and high orders of learning. The low level term can be implemented by any classification technique, while the high level term is realized by the extraction of features of the underlying network constructed from the input data. Thus, the former classifies the test instances by their physical features, while the latter measures the compliance of the test instances with the pattern formation of the data. Our study shows that the proposed technique not only can realize classification according to the semantic meaning of the data, but also is able to improve the performance of traditional classification techniques. Finally, it is expected that this study will contribute, in a relevant manner, to the machine learning area / Aprendizado de máquina figura-se como uma área de pesquisa que visa a desenvolver métodos computacionais capazes de aprender com a experiência. Embora uma grande quantidade de técnicas de aprendizado de máquina foi proposta e aplicada, com sucesso, em sistemas reais, existem ainda inúmeros problemas desafiantes que necessitam ser explorados. Nos últimos anos, um crescente interesse em técnicas baseadas em redes complexas (grafos de larga escala com padrões de conexão não triviais) foi verificado. Essa emergência é explicada pelas inerentes vantagens que a representação em redes complexas traz, sendo capazes de capturar as relações espaciais, topológicas e funcionais dos dados. Nesta tese, serão investigadas as possíveis vantagens oferecidas por redes complexas quando utilizadas no domínio de aprendizado de máquina. De fato, será mostrado que a abordagem por redes realmente proporciona melhorias nos aprendizados supervisionado, semissupervisionado e não supervisionado. Especificamente, será reformulada uma técnica de competição de partículas para o aprendizado não supervisionado e semissupervisionado por meio da utilização de um sistema dinâmico estocástico não linear. Em complemento, uma análise analítica de tal modelo será desenvolvida, permitindo o entendimento evolucional do modelo no tempo. Além disso, a questão de confiabilidade de dados será investigada no aprendizado semissupervisionado. Tal tópico tem importância prática e é pouco estudado na literatura. Com o objetivo de validar essas técnicas em problemas reais, simulações computacionais em bases de dados consagradas pela literatura serão conduzidas. Ainda nesse trabalho, será proposta uma técnica híbrica de classificação supervisionada que combina tanto o aprendizado de baixo como de alto nível. O termo de baixo nível pode ser implementado por qualquer técnica de classificação tradicional, enquanto que o termo de alto nível é realizado pela extração das características de uma rede construída a partir dos dados de entrada. Nesse contexto, aquele classifica as instâncias de teste segundo qualidades físicas, enquanto que esse estima a conformidade da instância de teste com a formação de padrões dos dados. Os estudos aqui desenvolvidos mostram que o método proposto pode melhorar o desempenho de técnicas tradicionais de classificação, além de permitir uma classificação de acordo com o significado semântico dos dados. Enfim, acredita-se que este estudo possa gerar contribuições relevantes para a área de aprendizado de máquina.
65

Μέθοδοι διάγνωσης με βάση προηγμένες τεχνικές επεξεργασίας και ταξινόμησης δεδομένων. Εφαρμογές στη μαιευτική / Advanced data processing and classification techniques for diagnosis methods. Application in obstetrics

Γεωργούλας, Γεώργιος Κ. 13 February 2009 (has links)
Αντικείμενο της διατριβής ήταν η ανάπτυξη υπολογιστικών μεθόδων διάγνωσης και εκτίμησης της κατάστασης της υγείας του εμβρύου. Οι προτεινόμενες μεθοδολογίες αναλύουν και εξάγουν πληροφορίες από το σήμα της ΕΚΣ καθώς το συγκεκριμένο σήμα αποτελεί ένα από τα λιγοστά διαθέσιμα εργαλεία για την εκτίμηση της οξυγόνωσης του εμβρύου και της αξιολόγησης της κατάστασης της υγείας του κατά τη διάρκεια του τοκετού. Για την αξιολόγηση των μεθόδων εξετάστηκε η συσχέτιση της Εμβρυϊκής Καρδιακής Συχνότητας (ΕΚΣ) με βραχυπρόθεσμες αξιόπιστες ενδείξεις για την κατάσταση του εμβρύου και πιο συγκεκριμένα χρησιμοποιήθηκε η συσχέτιση της τιμής του pH του αίματος του εμβρύου η οποία αποτελεί μια έμμεση ένδειξη για την ανάπτυξη υποξίας κατά τη διάρκεια του τοκετού. Στα πλαίσια της διατριβής χρησιμοποιήθηκε για πρώτη φορά η μέθοδος της ανάλυσης σε ανεξάρτητες συνιστώσες για την εξαγωγή χαρακτηριστικών από το σήμα της ΕΚΣ. Επίσης προτάθηκαν και χρησιμοποιήθηκαν Κρυφά Μοντέλα Markov σε μια προσπάθεια να «συλληφθεί» η χρονική εξέλιξη του φαινομένου της μεταβολής της κατάστασης του εμβρύου. Επιπλέον προτάθηκαν νέα χαρακτηριστικά εξαγόμενα με τη χρήση του Διακριτού Μετασχηματισμού Κυματιδίου. Με χρήση μιας υβριδική μέθοδος, που βασίζεται στη χρήση εξελικτικής γραμματικής «κατασκευάστηκαν» νέα χαρακτηριστικά παραγόμενα από τα χαρακτηριστικά που είχαν ήδη εξαχθεί με συμβατικές μεθόδους. Επιπρόσθετα στα πλαίσια της διατριβής χρησιμοποιήθηκαν για πρώτη φορά (και η μόνη μέχρι στιγμής) μηχανές διανυσμάτων υποστήριξης για την ταξινόμηση και προτάθηκε και χρησιμοποιήθηκε για πρώτη φορά η μέθοδος βελτιστοποίησης με σμήνος σωματιδίων για τη ρύθμιση των παραμέτρων τους. Τέλος προτάθηκε και χρησιμοποιήθηκε για πρώτη φορά η μέθοδος βελτιστοποίησης με σμήνος σωματιδίων για την εκπαίδευση μιας νέας οικογένειας νευρωνικών δικτύων, των νευρωνικών δικτύων κυματιδίου. Μέσα από τα πειράματα τα οποία διεξήγαμε καταφέραμε να δείξουμε ότι τα δεδομένα της ΕΚΣ διαθέτουν σημαντική πληροφορία η οποία με τη χρήση κατάλληλων προηγμένων μεθόδων επεξεργασίας και ταξινόμησης μπορεί να συσχετιστεί με την τιμή του pH του εμβρύου, κάτι το οποίο θεωρούνταν ουτοπικό στη δεκαετία του 90. / This Dissertation dealt with the development of computational methods for the diagnosis and estimation of fetal condition. The proposed methods analyzed and extracted information from the Fetal Heart Rate (FHR) signal, since this is one of the few available tools for the estimation of fetal oxygenation and the assessment of fetal condition during labor. For the evaluation of the proposed methods the correlation of the FHR signal with short term indices were employed and to be more specific, its correlation with the pH values of fetal blood, which is an indirect sign of the development of fetal hypoxia during labor. In the context of this Dissertation, Independent Component Analysis (ICA) for feature extraction from the FHR signal was used for the first time. Moreover we used Hidden Markov Models in an attempt to “capture” the evolution in time of the fetal condition. Furthermore, new features based on the Discrete Wavelet Transform were proposed and used. Using a new hybrid method based on grammatical evolution new features were constructed based on already extracted features by conventional methods. Moreover, for the first (and only) time, Support Vector Machine (SVM) classifiers were employed in the field of FHR processing and the Particle Swarm Optimization (PSO) method was proposed for tuning their parameters. Finally, a new family of neural networks, the Wavelet Neural Networks (WNN) was proposed and used, trained using the PSO method. By conducting a number of experiments we managed to show that the FHR signal conveys valuable information, which by the use of advanced data processing and classification techniques can be associated with fetal pH, something which was not regarded feasible during the 90’s.

Page generated in 0.1028 seconds