Optimal partition of feature using Bayesian classifier

The Naive Bayesian classifier is a popular classification method employing the Bayesian paradigm. The concept of having conditional dependence among input variables sounds good in theory but can lead to a majority vote style behaviour. Achieving conditional independence is often difficult, and they...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Vishwakarma, Sanjay, Ganguly, Srinjoy
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Vishwakarma, Sanjay
Ganguly, Srinjoy
description The Naive Bayesian classifier is a popular classification method employing the Bayesian paradigm. The concept of having conditional dependence among input variables sounds good in theory but can lead to a majority vote style behaviour. Achieving conditional independence is often difficult, and they introduce decision biases in the estimates. In Naive Bayes, certain features are called independent features as they have no conditional correlation or dependency when predicting a classification. In this paper, we focus on the optimal partition of features by proposing a novel technique called the Comonotone-Independence Classifier (CIBer) which is able to overcome the challenges posed by the Naive Bayes method. For different datasets, we clearly demonstrate the efficacy of our technique, where we achieve lower error rates and higher or equivalent accuracy compared to models such as Random Forests and XGBoost.
doi_str_mv 10.48550/arxiv.2304.14537
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2304_14537</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2304_14537</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-c0992907c40b0f9d1f7de49bd6c7f21f8b90ed3f8c85dada7a092a1af12478c3</originalsourceid><addsrcrecordid>eNotzrtuwjAUgGEvDBX0ATrVL5D0-JLYHgH1JiEx0D06sX2QpRAiO1Tl7dvSTv_262PsQUCtbdPAE-av9FlLBboWulHmjrX7aU4nHPiEeU5zOo_8TJwizpcc-aWk8cg3eI0l4cj9gKUkSjGv2IJwKPH-v0t2eHn-2L5Vu_3r-3a9q7A1pvLgnHRgvIYeyAVBJkTt-tB6Q1KQ7R3EoMh62wQMaBCcRIEkpDbWqyV7_Lve3N2Uf6T52v36u5tffQMYQkDH</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Optimal partition of feature using Bayesian classifier</title><source>arXiv.org</source><creator>Vishwakarma, Sanjay ; Ganguly, Srinjoy</creator><creatorcontrib>Vishwakarma, Sanjay ; Ganguly, Srinjoy</creatorcontrib><description>The Naive Bayesian classifier is a popular classification method employing the Bayesian paradigm. The concept of having conditional dependence among input variables sounds good in theory but can lead to a majority vote style behaviour. Achieving conditional independence is often difficult, and they introduce decision biases in the estimates. In Naive Bayes, certain features are called independent features as they have no conditional correlation or dependency when predicting a classification. In this paper, we focus on the optimal partition of features by proposing a novel technique called the Comonotone-Independence Classifier (CIBer) which is able to overcome the challenges posed by the Naive Bayes method. For different datasets, we clearly demonstrate the efficacy of our technique, where we achieve lower error rates and higher or equivalent accuracy compared to models such as Random Forests and XGBoost.</description><identifier>DOI: 10.48550/arxiv.2304.14537</identifier><language>eng</language><subject>Computer Science - Artificial Intelligence ; Computer Science - Learning</subject><creationdate>2023-04</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2304.14537$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2304.14537$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Vishwakarma, Sanjay</creatorcontrib><creatorcontrib>Ganguly, Srinjoy</creatorcontrib><title>Optimal partition of feature using Bayesian classifier</title><description>The Naive Bayesian classifier is a popular classification method employing the Bayesian paradigm. The concept of having conditional dependence among input variables sounds good in theory but can lead to a majority vote style behaviour. Achieving conditional independence is often difficult, and they introduce decision biases in the estimates. In Naive Bayes, certain features are called independent features as they have no conditional correlation or dependency when predicting a classification. In this paper, we focus on the optimal partition of features by proposing a novel technique called the Comonotone-Independence Classifier (CIBer) which is able to overcome the challenges posed by the Naive Bayes method. For different datasets, we clearly demonstrate the efficacy of our technique, where we achieve lower error rates and higher or equivalent accuracy compared to models such as Random Forests and XGBoost.</description><subject>Computer Science - Artificial Intelligence</subject><subject>Computer Science - Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrtuwjAUgGEvDBX0ATrVL5D0-JLYHgH1JiEx0D06sX2QpRAiO1Tl7dvSTv_262PsQUCtbdPAE-av9FlLBboWulHmjrX7aU4nHPiEeU5zOo_8TJwizpcc-aWk8cg3eI0l4cj9gKUkSjGv2IJwKPH-v0t2eHn-2L5Vu_3r-3a9q7A1pvLgnHRgvIYeyAVBJkTt-tB6Q1KQ7R3EoMh62wQMaBCcRIEkpDbWqyV7_Lve3N2Uf6T52v36u5tffQMYQkDH</recordid><startdate>20230427</startdate><enddate>20230427</enddate><creator>Vishwakarma, Sanjay</creator><creator>Ganguly, Srinjoy</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230427</creationdate><title>Optimal partition of feature using Bayesian classifier</title><author>Vishwakarma, Sanjay ; Ganguly, Srinjoy</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-c0992907c40b0f9d1f7de49bd6c7f21f8b90ed3f8c85dada7a092a1af12478c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Artificial Intelligence</topic><topic>Computer Science - Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Vishwakarma, Sanjay</creatorcontrib><creatorcontrib>Ganguly, Srinjoy</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Vishwakarma, Sanjay</au><au>Ganguly, Srinjoy</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal partition of feature using Bayesian classifier</atitle><date>2023-04-27</date><risdate>2023</risdate><abstract>The Naive Bayesian classifier is a popular classification method employing the Bayesian paradigm. The concept of having conditional dependence among input variables sounds good in theory but can lead to a majority vote style behaviour. Achieving conditional independence is often difficult, and they introduce decision biases in the estimates. In Naive Bayes, certain features are called independent features as they have no conditional correlation or dependency when predicting a classification. In this paper, we focus on the optimal partition of features by proposing a novel technique called the Comonotone-Independence Classifier (CIBer) which is able to overcome the challenges posed by the Naive Bayes method. For different datasets, we clearly demonstrate the efficacy of our technique, where we achieve lower error rates and higher or equivalent accuracy compared to models such as Random Forests and XGBoost.</abstract><doi>10.48550/arxiv.2304.14537</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2304.14537
ispartof
issn
language eng
recordid cdi_arxiv_primary_2304_14537
source arXiv.org
subjects Computer Science - Artificial Intelligence
Computer Science - Learning
title Optimal partition of feature using Bayesian classifier
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T15%3A58%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20partition%20of%20feature%20using%20Bayesian%20classifier&rft.au=Vishwakarma,%20Sanjay&rft.date=2023-04-27&rft_id=info:doi/10.48550/arxiv.2304.14537&rft_dat=%3Carxiv_GOX%3E2304_14537%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true