2018
DOI: 10.1007/s12652-018-1160-1
|View full text |Cite
|
Sign up to set email alerts
|

A new complement naïve Bayesian approach for biomedical data classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(14 citation statements)
references
References 11 publications
0
14
0
Order By: Relevance
“…Classification of biomedical data is crucial in the drug discovery process, especially in the target discovery subset. NB algorithms have shown great promise as classification tools for biomedical data, often filled with non-related information and data, known as noise [ 47 ]. NB techniques could also serve important roles in predicting ligand-target interactions, which could be a massive step forward in lead discovery [ 48 ].…”
Section: Naive Bayesian (Nb)mentioning
confidence: 99%
“…Classification of biomedical data is crucial in the drug discovery process, especially in the target discovery subset. NB algorithms have shown great promise as classification tools for biomedical data, often filled with non-related information and data, known as noise [ 47 ]. NB techniques could also serve important roles in predicting ligand-target interactions, which could be a massive step forward in lead discovery [ 48 ].…”
Section: Naive Bayesian (Nb)mentioning
confidence: 99%
“…The technique presented in this article can decrease the detection time in half, to 0.5 seconds, while increasing the detection rate to 91.06 percent. In [13], A. Anagram and Y.-L. Chang, 2019, the basic goal of this research is to build a model from noisy examples. By decreasing instances and enhancing classification performance, this method reduces model training time.…”
Section: Related Workmentioning
confidence: 99%
“…The k-means algorithm is part of the "hard clustering" techniques and we exploited the kmeans function in the r package "cluster". 2 It is a partition clustering algorithm that allows to subdivide a set of objects in K groups based on their attributes, by partitioning the data set into unique homogeneous clusters whose observations are similar but different from other clusters. The k-means iteratively improves the initial centroids by minimizing the total intracluster variance, i.e., maximizing the similarity between the documents.…”
Section: The Analysis Of Correlating Informationmentioning
confidence: 99%