Methodology For Generating High-Confidence Cost-Sensitive Rules For Classification
Main Author: | |
---|---|
Language: | English |
Published: |
University of Cincinnati / OhioLINK
2013
|
Subjects: | |
Online Access: | http://rave.ohiolink.edu/etdc/view?acc_num=ucin1377868085 |
id |
ndltd-OhioLink-oai-etd.ohiolink.edu-ucin1377868085 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-OhioLink-oai-etd.ohiolink.edu-ucin13778680852021-08-03T06:19:24Z Methodology For Generating High-Confidence Cost-Sensitive Rules For Classification Bakshi, Arjun Computer Science Cost sensitive High Confidence Association Rules Classification Non forced Rule based classifiers are often used to make crucial decision in domains like medicine and business intelligence, where there is a need to build insightful models that are quick to train, perform accurate classification, and take the costs of mistakes into account while making or helping with predictions. The existing techniques that address these requirements suffer from some disadvantages that cause them to generate overly complicated rule sets that sometimes do not perform well on new data, or do not take differing misclassification costs into account. The work proposed here aims to build a rule based classifier that extracts rules that have higher support and confidence than existing techniques as well as a classification model that minimizes the cost incurred from misclassifications by making cost sensitive decisions and flagging instances that are likely to be misclassified. 2013-10-21 English text University of Cincinnati / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=ucin1377868085 http://rave.ohiolink.edu/etdc/view?acc_num=ucin1377868085 unrestricted This thesis or dissertation is protected by copyright: some rights reserved. It is licensed for use under a Creative Commons license. Specific terms and permissions are available from this document's record in the OhioLINK ETD Center. |
collection |
NDLTD |
language |
English |
sources |
NDLTD |
topic |
Computer Science Cost sensitive High Confidence Association Rules Classification Non forced |
spellingShingle |
Computer Science Cost sensitive High Confidence Association Rules Classification Non forced Bakshi, Arjun Methodology For Generating High-Confidence Cost-Sensitive Rules For Classification |
author |
Bakshi, Arjun |
author_facet |
Bakshi, Arjun |
author_sort |
Bakshi, Arjun |
title |
Methodology For Generating High-Confidence Cost-Sensitive Rules For Classification |
title_short |
Methodology For Generating High-Confidence Cost-Sensitive Rules For Classification |
title_full |
Methodology For Generating High-Confidence Cost-Sensitive Rules For Classification |
title_fullStr |
Methodology For Generating High-Confidence Cost-Sensitive Rules For Classification |
title_full_unstemmed |
Methodology For Generating High-Confidence Cost-Sensitive Rules For Classification |
title_sort |
methodology for generating high-confidence cost-sensitive rules for classification |
publisher |
University of Cincinnati / OhioLINK |
publishDate |
2013 |
url |
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1377868085 |
work_keys_str_mv |
AT bakshiarjun methodologyforgeneratinghighconfidencecostsensitiverulesforclassification |
_version_ |
1719434720956121088 |