• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 144
  • 60
  • 27
  • 14
  • 11
  • 11
  • 9
  • 8
  • 6
  • 4
  • 2
  • 2
  • 1
  • 1
  • Tagged with
  • 333
  • 333
  • 105
  • 90
  • 87
  • 67
  • 57
  • 49
  • 46
  • 44
  • 41
  • 40
  • 38
  • 36
  • 35
  • 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.
111

[en] A DECISION TREE LEARNER FOR COST-SENSITIVE BINARY CLASSIFICATION / [pt] UMA ÁRVORE DE DECISÃO PARA CLASSIFICAÇÃO BINÁRIA SENSÍVEL AO CUSTO

DANIEL DOS SANTOS MARQUES 30 November 2016 (has links)
[pt] Problemas de classificação foram amplamente estudados na literatura de aprendizado de máquina, gerando aplicações em diversas áreas. No entanto, em diversos cenários, custos por erro de classificação podem variar bastante, o que motiva o estudo de técnicas de classificação sensível ao custo. Nesse trabalho, discutimos o uso de árvores de decisão para o problema mais geral de Aprendizado Sensível ao Custo do Exemplo (ASCE), onde os custos dos erros de classificação variam com o exemplo. Uma das grandes vantagens das árvores de decisão é que são fáceis de interpretar, o que é uma propriedade altamente desejável em diversas aplicações. Propomos um novo método de seleção de atributos para construir árvores de decisão para o problema ASCE e discutimos como este pode ser implementado de forma eficiente. Por fim, comparamos o nosso método com dois outros algoritmos de árvore de decisão propostos recentemente na literatura, em 3 bases de dados públicas. / [en] Classification problems have been widely studied in the machine learning literature, generating applications in several areas. However, in a number of scenarios, misclassification costs can vary substantially, which motivates the study of Cost-Sensitive Learning techniques. In the present work, we discuss the use of decision trees on the more general Example-Dependent Cost-Sensitive Problem (EDCSP), where misclassification costs vary with each example. One of the main advantages of decision trees is that they are easy to interpret, which is a highly desirable property in a number of applications. We propose a new attribute selection method for constructing decision trees for the EDCSP and discuss how it can be efficiently implemented. Finally, we compare our new method with two other decision tree algorithms recently proposed in the literature, in 3 publicly available datasets.
112

Using Transcriptomic Data to Predict Biomarkers for Subtyping of Lung Cancer

Daran, Rukesh January 2021 (has links)
Lung cancer is one the most dangerous types of all cancer. Several studies have explored the use of machine learning methods to predict and diagnose this cancer. This study explored the potential of decision tree (DT) and random forest (RF) classification models, in the context of a small transcriptome dataset for outcome prediction of different subtypes on lung cancer. In the study we compared the three subtypes; adenocarcinomas (AC), small cell lung cancer (SCLC) and squamous cell carcinomas (SCC) with normal lung tissue by applying the two machine learning methods from caret R package. The DT and RF model and their validation showed different results for each subtype of the lung cancer data. The DT found more features and validated them with better metrics. Analysis of the biological relevance was focused on the identified features for each of the subtypes AC, SCLC and SCC. The DT presented a detailed insight into the biological data which was essential by classifying it as a biomarker. The identified features from this research may serve as potential candidate genes which could be explored further to confirm their role in corresponding lung cancer types and contribute to targeted diagnostics of different subtypes.
113

Development Of The Strategy To Select Optimum Reflective Cracking Mitigation Methods For The Hot-mix Asphalt Overlays In Florida

Maherinia, Hamid 01 January 2013 (has links)
Hot Mix Asphalt (HMA) overlay is a major rehabilitation treatment for the existing deteriorated pavements (both flexible and rigid pavements). Reflective cracking (RC) is the most common distress type appearing in the HMA overlays which structurally and functionally degrades the whole pavement structure, especially under high traffic volume. Although many studies have been conducted to identify the best performing RC mitigation technique, the level of success varies from premature failure to good performance in the field. In Florida, Asphalt Rubber Membrane Interlayers (ARMIs) have been used as a RC mitigation technique but its field performance has not been successful. In this study, the best performing means to mitigate RC in the overlays considering Florida’s special conditions have been investigated. The research methodology includes (1) extensive literature reviews regarding the RC mechanism and introduced mitigation options, (2) nationwide survey for understanding the current practice of RC management in the U.S., and (3) the development of decision trees for the selection of the best performing RC mitigation method. Extensive literature reviews have been conducted to identify current available RC mitigation techniques and the advantages and disadvantages of each technique were compared. Lesson learned from the collected case studies were used as input for the selection of the best performing RC mitigation techniques for Florida’s roads. The key input parameters in selecting optimum mitigation techniques are: 1) overlay characterization, 2) existing pavement condition, 3) base and subgrade structural condition, 4) environmental condition and 5) traffic level. In addition, to understand the current iv practices how reflective cracking is managed in each state, a nationwide survey was conducted by distributing the survey questionnaire (with the emphasis on flexible pavement) to all other highway agencies. Based on the responses, the most successful method of treatment is to increase the thickness of HMA overlay. Crack arresting layer is considered to be in the second place among its users. Lack of cost analysis and low rate of successful practices raise the necessity of conducting more research on this subject. Considering Florida’s special conditions (climate, materials, distress type, and geological conditions) and the RC mechanism, two RC mitigation techniques have been proposed: 1) overlay reinforcement (i.e. geosynthetic reinforcement) for the existing flexible pavements and 2) Stress Absorbing Membrane Interlayer (SAMI) for the existing rigid pavements. As the final products of this study, decision trees to select an optimum RC mitigation technique for both flexible and rigid pavements were developed. The decision trees can provide a detailed guideline to pavement engineer how to consider the affecting parameters in the selection of RC mitigation technique.
114

A Statistical Analysis of Motor Vehicle Fatalities in the United States

Munyon, James 18 April 2017 (has links)
No description available.
115

Data Analytics using Regression Models for Health Insurance Market place Data

Killada, Parimala January 2017 (has links)
No description available.
116

A New Measure of Classifiability and its Applications

Dong, Ming 08 November 2001 (has links)
No description available.
117

AN IMPROVED METHODOLOGY FOR LAND-COVER CLASSIFICATION USING ARTIFICIAL NEURAL NETWORKS AND A DECISION TREE CLASSIFIER

ARELLANO-NERI, OLIMPIA 01 July 2004 (has links)
No description available.
118

AN ALL-ATTRIBUTES APPROACH TO SUPERVISED LEARNING

VANCE, DANNY W. January 2006 (has links)
No description available.
119

Bayesian Nonparametric Methods with Applications in Longitudinal, Heterogeneous and Spatiotemporal Data

Duan, Li 19 October 2015 (has links)
No description available.
120

Empirical Investigation of CART and Decision Tree Extraction from Neural Networks

Hari, Vijaya 27 April 2009 (has links)
No description available.

Page generated in 0.07 seconds