Made available in DSpace on 2016-03-15T19:32:35Z (GMT). No. of bitstreams: 1 Rafael Longhi Romero.pdf: 3525593 bytes, checksum: 616faacf0965bab3e6af7b3724d6ec9f (MD5) Previous issue date: 2012-03-05 / Due to the fact that we are all subject to make subjective decisions that may undermine the financial health of an organization, the focus of this work consisted in building a decisionmaking model based on decision tree method applicable to everyday decisions of a company,with the goal not only to minimize subjectivity as well as to trace the process. The study was conducted by analyzing data from decisions taken by the department of supply Chain for a company of hidden identity, the choice of suppliers of ingredients for the most significant for this company. For both assigned and estimated the probability of occurrence of supplier change considering each ingredient according to the historical study. taking into account some factors that impact the Supply Chain area, such as: product price, distance from the supplier's production to the company`s facility, the payment terms and the product packaging, this last informed when there was an improvement in the operation. The objective was achieved once we reach a ratio of 81% correlation between the subjective decisions taken and decisions made using this tool for the cases tested. You could say that the model did not have its 100% ratio since although all factors guided the decision maker to choose the best choice but the organizational culture averse to change damaged this change. Other studies in various areas are needed to validate this technique, but for the Supply Chain area this technique has been validated, taking into account actual cases, which approximates the practical means of academia. It should be noted that the model developed has been used in practice in the area of supply chain management of the company in question. / Devido ao fato de estarmos sujeitos a tomar decisões subjetivas e que podem prejudicar a saúde financeira de uma organização, o foco deste trabalho consistiu na construção de um modelo decisório baseado no método de árvore de decisão aplicável a decisões cotidianas de uma empresa, com o objetivo não só de minimizar a subjetividade como também de permitir a rastreabilidade do processo.O trabalho foi desenvolvido analisando-se os dados de decisões tomadas pelo departamento de Supply Chain de uma empresa de identidade oculta, na escolha de fornecedores de ingredientes mais significativos para a mesma. Para tanto, foram atribuídas e estimadas as probabilidades de ocorrência troca de fornecedores para ingredientes diversos de acordo com o histórico estudado, levando-se em conta alguns fatores que impactam a área de supply chain, como por exemplo: preço do produto, distância do fornecedor a unidade produtiva, prazo de pagamento e embalagem do produto, esta última quando houve melhora na operação. O objetivo do trabalho foi atingido uma vez que chegou-se a uma relação de 81% de correlação entre as decisões tomadas de forma subjetiva e as decisões tomadas com o uso desta ferramenta em relação aos casos testados. A explicação para o fato de o modelo não ter sua relação de 100%,muito embora todos os fatores direcionassem o decisor a melhor escolha, deve-se a cultura organizacional da empresa que é avessa a mudança prejudicando assim a troca. Estudos em outras áreas se fazem necessários para validar o uso desta técnica, mas para a área de Supply Chain essa técnica foi validada, levando em consideração casos reais. Por fim, vale me Cabe observar que o modelo desenvolvido vem sendo utilizado na prática na área de supply chain da empresa em questão.

Muitos problemas de classificação descritos na literatura de aprendizado de máquina e mineração de dados dizem respeito à classificação em que cada exemplo pertence a um único rótulo. Porém, vários problemas de classificação, principalmente no campo de Bioinformática são associados a mais de um rótulo; esses problemas são conhecidos como problemas de classificação multirrótulo. O princípio básico da classificação multirrótulo é similar ao da classificação tradicional (que possui um único rótulo), sendo diferenciada no número de rótulos a serem preditos, na qual há dois ou mais rótulos. Na área da Bioinformática muitos problemas são compostos por uma grande quantidade de rótulos em que cada exemplo pode estar associado. Porém, algoritmos de classificação tradicionais são incapazes de lidar com um conjunto de exemplos mutirrótulo, uma vez que esses algoritmos foram projetados para predizer um único rótulo. Uma solução mais simples é utilizar o método conhecido como método Binary Relevance. Porém, estudos mostraram que tal abordagem não constitui uma boa solução para o problema da classificação multirrótulo, pois cada classe é tratada individualmente, ignorando as possíveis relações entre elas. Dessa maneira, o objetivo dessa pesquisa foi propor uma nova adaptação do método Binary Relevance que leva em consideração relações entre os rótulos para tentar minimizar sua desvantagem, além de também considerar a capacidade de interpretabilidade do modelo gerado, não só o desempenho. Os resultados experimentais mostraram que esse novo método é capaz de gerar árvores que relacionam os rótulos correlacionados e também possui um desempenho comparável ao de outros métodos, obtendo bons resultados usando a medida-F. / Many classification problems described in the literature on Machine Learning and Data Mining relate to the classification in which each example belongs to a single class. However, many classification problems, especially in the field of Bioinformatics, are associated with more than one class; these problems are known as multi-label classification problems. The basic principle of multi-label classification is similar to the traditional classification (single label), and distinguished by the number of classes to be predicted, in this case, in which there are two or more labels. In Bioinformatics many problems are composed of a large number of labels that can be associated with each example. However, traditional classification algorithms are unable to cope with a set of multi-label examples, since these algorithms are designed to predict a single label. A simpler solution is to use the method known as Binary Relevance. However, studies have shown that this approach is not a good solution to the problem of multi-label classification because each class is treated individually, ignoring possible relations between them. Thus, the objective of this research was to propose a new adaptation of Binary Relevance method that took into account relations between labels trying to minimize its disadvantage, and also consider the ability of interpretability of the model generated, not just its performance. The experimental results show that this new method is capable of generating trees that relate labels and also has a performance comparable to other methods, obtaining good results using F-measure.

[pt] O reconhecimento de posturas é um dos desafios para o sensoriamento humano, que auxilia no acompanhamento de pessoas em ambientes de moradia assistidos. Estes ambientes, por sua vez, auxiliam médicos no diagnóstico de saúde de seus pacientes, principalmente através do reconhecimento de atividades do dia a dia em tempo real, que é visto na área médica como uma das melhores formas de antecipar situações críticas de saúde. Além disso, o envelhecimento da população mundial, escassez de recursos em hospitais para atender todas as pessoas e aumento dos custos de assistência médica impulsionam o desenvolvimento de sistemas para apoiar os ambientes de moradia assistidos. Preservar a privacidade nestes ambientes monitorados por sensores é um fator crítico para a aceitação do usuário, por isso há uma demanda em soluções que não requerem imagens. Este trabalho evidencia o uso de um sensor térmico de baixa resolução no sensoriamento humano, mostrando que é viável detectar a presença e reconhecer posturas humanas, usando somente os dados deste sensor. / [en] Postures recognition is one of the human sensing challenges, that helps ambient assisted livings in people accompanying. On the other hand, these ambients assist doctors in the diagnosis of their patients health, mainly through activities of daily livings real time recognition, which is seen in the medical field as one of the best ways to anticipate critical health situations. In addition, the world s population aging, lack of hospital resources to meet all people and increased health care costs drive the development of systems to support ambient assisted livings. Preserving privacy in these ambients monitored by sensors is a critical factor for user acceptance, so there is a demand for solutions that does not requires images. This work demonstrates the use of a low resolution thermal array sensor in human sensing, showing that it is feasible to detect the presence and to recognize human postures, using only the data of this sensor.

Wire Electrical Discharge Machining (WEDM) is a nontraditional machining process used for machining intricate shapes in high strength and temperature resistive (HSTR) materials. WEDM provides high accuracy, repeatability, and a better surface finish; however the tradeoff is a very slow machining rate. Due to the slow machining rate in WEDM, machining tasks take many hours depending on the complexity of the job. Because of this, users of WEDM try to predict machining rate beforehand so that input parameter values can be pre-programmed to achieve automated machining. However, partial success with traditional methodologies such as thermal modeling, artificial neural networks, mathematical, statistical, and empirical models left this problem still open for further research and exploration of alternative methods. Also, earlier efforts in applying the decision tree rule induction algorithms for predicting the machining rate in WEDM had limitations such as use of coarse grained method of discretizing the target and exploration of only C4.5 as the learning algorithm. The goal of this dissertation was to address the limitations reported in literature in using decision tree rule induction algorithms for WEDM. In this study, the three decision tree inductive algorithms C5.0, CART and CHAID have been applied for predicting material removal rate when the target was discretized into varied number of classes (two, three, four, and five classes) by three discretization methods. There were a total of 36 distinct combinations when learning algorithms, discretization methods, and number of classes in the target are combined. All of these 36 models have been developed and evaluated based on the prediction accuracy. From this research, a total of 21 models found to be suitable for WEDM that have prediction accuracy ranging from 71.43% through 100%. The models indentified in the current study not only achieved better prediction accuracy compared to previous studies, but also allows the users to have much better control over WEDM than what was previously possible. Application of inductive learning and development of suitable predictive models for WEDM by incorporating varied number of classes in the target, different learning algorithms, and different discretization methods have been the major contribution of this research.

This report aims to solve a problem for the   waxers in the Swedish National Cross-country Ski Team, which hereafter will   be referred to as the national team. The problem in hand is that currently,   the national team lacks a system for book-keeping of ski pairs and ski tests.   Also, the project intends to provide a tool for predicting the best ski pairs   in given conditions. The report describes cross-country skis and factors that   affect the performance of these skis. Moreover, this report presents the   testing procedure of the national team. The project provides a solution to   the problem in hand by developing a web service based on Django and Django   REST Framework and an iOS application to handle the user interaction. The app   was tested and approved by the waxers of the national team. To predict the   best performing skis in given conditions, the three Machine Learning   algorithms Support Vector Machine (SVM), Decision Tree, and Artificial Neural   Network (ANN) is implemented and evaluated. Experimental results indicate   that the ANN algorithm has better accuracy than the Decision Tree, and that   the SVM algorithms and that the SVM was performing slightly worse than the   other two, when applied on test data which is artificially generated based on   the experience of the national team. All three Machine Learning algorithms   perform better in terms of mean accuracy which is significantly higher   compared to the accuracy of a baseline algorithm. The report suggests that   the accuracy of the ANN algorithm is high enough to be useful for the   national team.

This thesis is divided into a theoretical part, aimed at developing statements around the newly introduced concept of pattern morphisms, and a practical part, where we present use cases of pattern structures. A first insight of our work clarifies the facts on projections of pattern structures. We discovered that a projection of a pattern structure does not always lead again to a pattern structure. A solution to this problem, and one of the most important points of this thesis, is the introduction of pattern morphisms in Chapter4. Pattern morphisms make it possible to describe relationships between pattern structures, and thus enable a deeper understanding of pattern structures in general. They also provide the means to describe projections of pattern structures that lead to pattern structures again. In Chapter5 and Chapter6, we looked at the impact of morphisms between pattern structures on concept lattices and on their representations and thus clarified the theoretical background of existing research in this field. The application part reveals that random forests can be described through pattern structures, which constitutes another central achievement of our work. In order to demonstrate the practical relevance of our findings, we included a use case where this finding is used to build an algorithm that solves a real world classification problem of red wines. The prediction accuracy of the random forest is better, but the high interpretability makes our algorithm valuable. Another approach to the red wine classification problem is presented in Chapter 8, where, starting from an elementary pattern structure, we built a classification model that yielded good results.

My master's thesis on the topic of "Design of exercises for data mining - Classification and prediction" deals with the most frequently used methods classification and prediction. There are association rules, Bayesian classification, genetic algorithms, the nearest method neighbor, neural network and decision trees on the classification. There are linear and non-linear prediction on the prediction. This work also contains a summary of detail the issue of decision trees and a detailed algorithm for creating the decision tree, including development of individual diagrams. The proposed algorithm for creating the decision tree is tested through two tests of data dowloaded from Internet. The results are mutually compared and described differences between the two implementations. The work is written in a way that would provide the reader with a notion of the individual methods and techniques for data mining, their advantages, disadvantages and some of the issues that directly relate to this topic.

Tato diplomová práce pojednává o dvou algoritmech pro dolování z proudu dat - Very Fast Decision Tree (VFDT) a Concept-adapting Very Fast Decision Tree (CVFDT). Je vysvětlen princip klasifikace rozhodovacím stromem. Je popsána základní myšlenka konstrukce stromu Hoeffding Tree, který je základem pro algoritmy VFDT a CVFDT. Tyto algoritmy jsou poté rozebrány detailněji. Dále se tato práce zabývá návrhem algoritmu Genetického Programování (GP), který je použit pro vytváření klasifikátoru obrazových dat. Vytvořený klasifikátor je použit jako alternativní způsob klasifikace objektů v obraze ve frameworku Viola-Jones. V práci je rozebrána implementace algoritmů, které jsou implementovány v jazyce Java. Algoritmus GP je integrován do knihovny “Image Processing Extension” programu RapidMiner. Algoritmy VFDT a CVFDT jsou testovány na syntetických a reálných textových datech. Algoritmus GP je testován na klasifikaci obrazových dat a následně vytvořený klasifikátor je otestován na detekci obličejů v obraze.

This work deals with creating a module for existing ERP system. Module should be able to produce dataprogress of production, monitor productivity of production and warn if some issue will happen. This work evaluates a processing of a large amount of data and it shows different possibilities how to precalculate data. It also deals with a draft how to predict information from known data.

An understanding of what influences sinkhole formation and the ability to accurately predict sinkhole hazards is critical to environmental management efforts in the karst lands of southeastern Minnesota. Based on the distribution of distances to the nearest sinkhole, sinkhole density, bedrock geology and depth to bedrock in southeastern Minnesota and northwestern Iowa, a decision tree model has been developed to construct maps of sinkhole probability in Minnesota. The decision tree model was converted as cartographic models and implemented in ArcGIS to create a preliminary sinkhole probability map in Goodhue, Wabasha, Olmsted, Fillmore, and Mower Counties. This model quantifies bedrock geology, depth to bedrock, sinkhole density, and neighborhood effects in southeastern Minnesota but excludes potential controlling factors such as structural control, topographic settings, human activities and land-use. The sinkhole probability map needs to be verified and updated as more sinkholes are mapped and more information about sinkhole formation is obtained.