 Research article
 Open Access
 Published:
Verifying the fully “Laplacianised” posterior Naïve Bayesian approach and more
Journal of Cheminformatics volume 7, Article number: 27 (2015)
Abstract
Background
In a recent paper, Mussa, Mitchell and Glen (MMG) have mathematically demonstrated that the “Laplacian Corrected Modified Naïve Bayes” (LCMNB) algorithm can be viewed as a variant of the socalled Standard Naïve Bayes (SNB) scheme, whereby the role played by absence of compound features in classifying/assigning the compound to its appropriate class is ignored. MMG have also proffered guidelines regarding the conditions under which this omission may hold. Utilising three data sets, the present paper examines the validity of these guidelines in practice. The paper also extends MMG’s work and introduces a new version of the SNB classifier: “Tapered Naïve Bayes” (TNB). TNB does not discard the role of absence of a feature out of hand, nor does it fully consider its role. Hence, TNB encapsulates both SNB and LCMNB.
Results
LCMNB, SNB and TNB performed differently on classifying 4,658, 5,031 and 1,149 ligands (all chosen from the ChEMBL Database) distributed over 31 enzymes, 23 membrane receptors, and one ionchannel, four transporters and one transcription factor as their target proteins. When the number of features utilised was equal to or smaller than the “optimal” number of features for a given data set, SNB classifiers systematically gave better classification results than those yielded by LCMNB classifiers. The opposite was true when the number of features employed was markedly larger than the “optimal” number of features for this data set. Nonetheless, these LCMNB performances were worse than the classification performance achieved by SNB when the “optimal” number of features for the data set was utilised. TNB classifiers systematically outperformed both SNB and LCMNB classifiers.
Conclusions
The classification results obtained in this study concur with the mathematical based guidelines given in MMG’s paper—that is, ignoring the role of absence of a feature out of hand does not necessarily improve classification performance of the SNB approach; if anything, it could make the performance of the SNB method worse. The results obtained also lend support to the rationale, on which the TNB algorithm rests: handled judiciously, taking into account absence of features can enhance (not impair) the discriminatory classification power of the SNB approach.
Background
Pattern classification techniques are indispensable in cheminformatics. For example, a cheminformatian might be interested in knowing whether: a particular small compound (ligand) is capable of inducing a desirable biological effect on a specific target protein [1, 2]; an enzyme catalyses a certain chemical reaction, or a catalytic mechanism of an enzyme is appropriate for a chemical reaction [3]; a substructure of a substrate is a site of metabolism [4]; a ligand is structurally similar to a reference set of ligands known to possess desirable physical, chemical and biological properties [2, 5, 6]; a protein is a potential target for a given ligand [2, 7]; etc.
In all these examples, the underlying task can be viewed as a classification problem hinging on the assumption that there are inherently underlying characteristic patterns in the proteins, ligands, substrates, etc. It should, therefore, come as no surprise that a considerable body of literature exists highlighting and expounding on the important role pattern classification methods have in cheminformatics—summarised in many articles, such as these recent Refs. [8–10].
Formally, a pattern classification problem deals with the optimal assignment of an object to one of \(J\) predefined classes/categories, \((\omega _1,\omega _2,\ldots,\omega _J)\), whereby it is assumed that the object is adequately (or even better, uniquely) characterized by L features x\(_{l}\), with \(l=1,2,\ldots,L\). Typically, the object (or simply the pattern) is represented by an Ldimensional vector x, whose elements x\(_{l}\) are discriminating features that ideally codify the pattern. Thus, mathematically, the classification problem may be cast as establishing a mapping from pattern feature space \(\mathcal {X}\), in which pattern vectors x reside, into class space \(\Omega \) comprising our predefined set of classes:
such that any pattern x \(\in \mathcal {X}\) can be assigned to its appropriate class/label \(\omega _j\), where \(\omega _j\in \Omega = (\omega _1,\omega _2,\ldots,\omega _J)\).
To this end, it is desirable to identify L underlying characteristics of the pattern to render the mapping in Eq. 1 a simple lookup table. In practice, however, identifying L relevant features to classify new patterns without classification errors is generally impossible. In this scenario, the classification problem becomes finding a mapping between \(\mathcal {X}\) and \(\Omega \) that minimises the misclassification rate [11–15]. One way of achieving this objective is to treat both the pattern vector x and \(\omega _{j}\) as random variables; compute the class \(\omega _{j}\) probabilities for a given pattern x, \(p(\omega _{j}\mathbf{x})\); and then assign x \(\in \mathcal {X}\) to the class \(\omega _{j}\in \Omega \) for which the \(p(\omega _{j}\mathbf{x})\) value is maximum [11–14]. (In the last step it is being assumed that all misclassification errors are equally bad [11, 13, 14].)
More often than not, \(p(\omega _{j}\mathbf{x})\) is unknown. Instead, one has access to a representative data set comprising \(N\) prototype pairs, \(\mathcal{D}=\{(\mathbf{x}_{i},y_{i})\}^{N}_{i=1}\), drawn from the joint probability density function \(p(\omega _{j},\mathbf{x})\) over \(\omega _{j}\) and x, where \(y_{i}\in \{\omega _{j}\}^{J}_{j=1}\) and x \(_{i}\) denotes pattern i whose class label is y\(_{i}\). This means Eq. 1 can amount to approximating \(p(\omega _{j}\mathbf{x})\) from \(\mathcal{D}\). In other words, the pattern classification problem now becomes a statistical problem. In any event, in practice, it is not always an easy task to estimate \(p(\omega _{j}\mathbf{x})\) nor \(p(\omega _{j},\mathbf{x})\) from \(\mathcal{D}\) (the socalled training set) [5, 11, 13–15]. However, probability rules and Bayes’ theorem allow one to modularize the problem and estimate \(p(\omega _{j}\mathbf{x})\) in terms of probability density functions that we may have a better chance of being able to estimate utilising \(\mathcal{D}\). To this end, \(p(\omega _{j}\mathbf{x})\) is defined as [5, 11, 13],
where estimating \(p(\mathbf{x}\omega _{j})\) and \(p(\omega _{j})\) from the available training set can be easier than estimating \(p(\omega _{j}\mathbf{x})\)—or for that matter, \(p(\omega _{j},\mathbf{x})\) and \(p(\mathbf{x})\)—directly from \(\mathcal{D}\). In Bayesian statistics settings, \(p(\omega _{j})\) is referred to as the class prior probability function, which is the probability that a member of class \(\omega _{j}\) will occur. The function \(p(\mathbf{x}\omega _{j})\) is called the classconditional probability density function, i.e., the probability density of observing pattern x given that x is a member of class \(\omega _{j}\). The denominator term in Eq. 2 is often called the “evidence”, “prior predictive”, “marginal likelihood”, and others. As far as this paper is concerned, suffice it to say this term can be viewed as a normalisation factor.
Typically, \(p(\omega _{j})\) is assumed to be uniform, i.e., \(p(\omega _{j})=\frac{1}{J}\), where J is as defined before. If, however, there is convincing evidence that the number of pairs \((\mathbf{x}_{i},\omega _{j})\) per class in the training data set is an indication of the importance of that class, then a sensible approximation of \(p(\omega _{j})\) can be
where \(N_{\omega _{j}}\) denotes the number of patterns in \(\mathcal{D}\) that belong to class \(\omega _{j}\), and N is as described before.
Direct computation of \(p(\mathbf{x}\omega _{j})\) from the training data set is not so straightforward as estimating \(p(\omega _{j})\) [5, 11–15], especially for L ≥ 100, as modeling a joint probability distribution that captures the relationship among the L features \(x_{l}\) given \(\omega _{j}\) can become quite involved. The main difficulty is that the required size of \(\mathcal{D}\) increases exponentially with L [11, 16].
Over the past six decades, a plethora of methods have been proposed to estimate \(p(\mathbf{x}\omega _{j})\) from a given training data set [13, 17, 18]. In this paper we are concerned with one particular method that is widely utilised in cheminformatics (and elsewhere): the socalled Naïve Bayes approach [5, 11, 13, 15]. It is based on the simplistic assumption that the L features \(x_{l}\) are statistically independent given \(\omega _{j}\). This Naïve assumption (hence: the name “Naïve Bayes”) significantly mitigates the difficulty of estimating the fully joint classconditional probability density function \(p(\mathbf{x}\omega _{j})\) to that of estimating \(L\) statistically independent classconditional univariate probability density functions \(p(x_{l}\omega _{j})\). In other words, this simplistic scheme ignores possible dependencies, i.e., correlations, among the L pattern features \(x_{l}\) given \(\omega _{j}\), and approximates \(p(\mathbf{x}\omega _{j})\) as a product of L classconditional univariate density functions \(p(x_{l}\omega _{j})\):
A decade ago, Xia et al. [19] further “simplified” this Naïve scheme itself, in particular when the features are binary, i.e., \(x_{l}\) = 0 or 1 denoting an absence or presence of feature \(x_{l}\) in the pattern vector x, respectively. Instead of the conventional \(p(x_{l}\omega _{j})\), the authors estimated \(p(\omega _{j}x_{l})\), though—as we will see shortly, the two functions are related.
Using clever heuristic arguments, these authors deemed absence of features, i.e., \(x_{l}=0\), unimportant or even problematic for estimating \(p(\omega _{j}\mathbf{x})\), the probability density function that we are ultimately concerned with. That is to say, in their approach, which they termed the “Laplacian Corrected Modified Naïve Bayes” (LCMNB), only \(p(\omega _{j}x_{l})\) for \(x_{l}=1\) were judged pertinent and relevant for estimating \(p(\omega _{j}\mathbf{x})\). In passing, there are many interesting and useful aspects of LCMNB [5–7, 19], with which we are not concerned in this paper. Since its introduction, the LCMNB approach has been employed in cheminformatics for both in silico ligandbased virtual screening and target protein prediction approaches [6, 7, 20–22].
Before proceeding further, it is worth noting that LCMNB should not be confused with the socalled Multinomial Naïve Bayes, another variant of the Naïve Bayes algorithm [23]. LCMNB is closely related to the Naïve Bayes variant called the Bernoulli Naïve Bayes [23], henceforth referred to as the Standard Naïve Bayes (SNB). In a recent paper, henceforth referred to as MMG, Mussa et al. [5] have demonstrated the relationship between the LCMNB and SNB algorithms. In MMG it has been explicated that LCMNB can be viewed as an instance of SNB, under certain conditions. In broader terms, MMG questioned, albeit tacitly, whether it would be justifiable to discard absence of a feature out of hand.
Using three data sets, the present paper examines whether these theory based conditions and questions—regarding the application of LCMNB based classifiers—have any practical use or are just merely a mathematical exercise and curiosity.
In this study, we also extend the work presented in MMG to introduce a novel classification scheme termed “Tapered Naïve Bayes” (TNB). In TNB, unlike LCMNB and SNB, the absence of a feature is neither completely discarded nor is it fully considered. In other words, TNB subsumes both SNB and LCMNB as illustrated in the following section. In that section, we set the scene and briefly describe the SNB, LCMNB and TNB algorithms. The section also presents a description of the three data sets employed to construct, test and compare classifiers based on SNB, LCMNB and TNB. Our findings and analyses, and concluding remarks are given in "Results and conclusion", respectively.
In the following discussions, x, \({\omega }_{j}\), and \(\mathbf{x}_{l}\) denote both random variables and their instantiations. Again to keep notations less cluttered, the estimated density functions and their corresponding true density functions are not distinguished. We follow—in line with the current trend in machine learning and statistics—the convenient, although strictly not accurate, practice of using the term “density” for both a discrete random variable’s probability function and for the probability function of a continuous random variable [24]. The terms “category”, “class”, “label”, and “class label” are used interchangeably.
Finally, in this work, we are only concerned with patterns represented by binary feature vectors x residing in binary feature space: x \(\in \mathcal{{X}} =\{0,1\}^{L}\), i.e., \(x_{l}\in ~\{0,1\}\).
Methods
For completeness, the mathematical relationship between the SNB and LCMNB approaches is described first and then the conditions, under which LCMNB can be considered as a variant of SNB, are stated. This material has been covered in great detail in MMG. Finally we give the formulae that describe the TNB algorithm.
In "Background", it has been noted that \(p(\omega _{j}\mathbf{x})\) can be expressed in terms of \(p(\mathbf{x}\omega _{j})\) and \(p(\omega _{j})\) that can be estimated from a given training data set. One way of mitigating the difficulty of computing \(p(\mathbf{x}\omega _{j})\) has also been discussed: introducing the socalled Naïve Bayes assumption, which allows one to approximate \(p(\mathbf{x}\omega _{j})\) as a product of L classconditional univariate density functions, see Eq. 4.
Bernoulli Naïve Bayes: standard Naïve Bayes
Since we are concerned with patterns whose features are binary, i.e., \(x_{l}\) = 0 or 1, Eq. 4 can be expressed in a more compact form:
whereby, in the second line on the right hand side of Eq. 5, we made use of Bayes’ theorem: \(p(x_{l}\omega _{j}) = \frac{p(\omega _{l}x_{l})p(x_{l})}{p(\omega _{j})}\), with \(p(\omega _{j})\) and \(p(x_{l}\omega _{j})\) being as defined before, whereas \(p(x_{l}) = \sum ^{J}_{j=1}p(x_{l}\omega _{j})p(\omega _{j})\) with J denoting the total number of classes. Inserting the second line of Eq. 5 into Eq. 2 and then taking logarithm of the resultant equation, we obtain
where all the terms and variables are as defined before, and the subscript “SNB” in \(\log p(\omega _j\mathbf{x})_{SNB}\) indicates that the equation represents the SNB algorithm. The third line of Eq. 6 can be ignored as the terms in this line are class independent and play no role in classifying the pattern x; for more technical details, the reader is referred to ref [5]. Thus, in practice, Eq. 6 reduces to
(Note that it is better to perform the computation by adding logarithms of probabilities because multiplying many conditional probabilities can lead to a floating point underflow.)
As a side, but important, note: recall that, when one utilises a 0/1 function (i.e., all misclassification errors are assumed to be equally bad), Bayes’ decision rule assigns \(\mathbf{x}\) to class \(\omega _{j}\) if [11, 15]
In this scenario, Eq. 7 combined with Eq. 8 constitutes the SNB classifier [5].
Laplacian corrected modified Naïve Bayes
Using heuristic arguments, Xia et al. [19] estimated \(p(\omega _{j}\mathbf{x})\) in terms of only \(p(\omega _{j}x_{l}=1)\) and \(p(\omega _{j})\), and then took the logarithm of the estimated \(p(\omega _{j}\mathbf{x})\) obtaining
where the terms and variables are as defined before, and and the subscript “LCMNB” in \(\log p(\omega _j\mathbf{x})_{LCMNB}\) indicates that the equation is for the LCMNB algorithm. Once again, Eq. 9 and the decision rule that assigns \(\mathbf{x}\) to class \(\omega _{j}\) if
define the LCMNB classifier [19].
Clearly Eqs. 7 and 9 are the same with one notable difference: the term \(\sum ^{L}_{l=1}(1x_{l})\log p(\omega _jx_l=0)\) is missing in Eq. 9, which is clearly the term concerned with absence of features \(x_{l}\) in Eq. 7. The omission of this term from Eq. 9 embodies the central tenet of the SNB simplification proposed by Xia et al.
The conditions
Now we come to the nub of this paper: testing the conditions under which LCMNB can be considered as a simpler version of SNB [5] in principle, or in practice (or both).
It is clear from Eqs. 7 and 9 that ignoring
may not matter so long as \(\log p(\omega _j\mathbf{x})_{LCMNB}> \log p(\omega _k\mathbf{x})_{LCMNB}\) whenever \(\log p(\omega _{j}\mathbf{x})_{SNB}> \log p(\omega _{k}\mathbf{x})_{SNB}\) for any given pattern x. For all practical purposes, this requirement may amount to meeting the following two conditions:;

1.
For any pattern vector x, the value of \(\sum ^{L}_{l=1}(1x_{l})\log p(\omega _jx_l=0)\) is the same (or can be made so) in all classes;

2.
For any pattern vector x
$$\begin{aligned} \left \sum ^{L}_{l=1}x_{l}\log p(\omega _jx_l=1)\right \gg \left \sum ^{L}_{l=1}(1x_{l})\log p(\omega _jx_l=0)\right  \end{aligned}$$in all classes.
Naturally it raises the question of whether LCMNB can perform better than SNB even if Conditions 1 and 2 do not hold. In this paper, it is sought to answer this question as well.
Tapered Naïve Bayes
Equations 7 and 9 are written in a suggestive manner, such that the two equations can be combined into a single equation:
where \(\lambda \) is a parameter. By setting \(\lambda \) to 1 or 0, we recover SNB or LCMNB, respectively. This equation combined with the Bayes’ decision rule defined in Eq. 8—mutatis mutandis—constitutes the “Tapered Naïve Bayes” algorithm.
Clearly \(\log p(\omega _j\mathbf{x})_{TNB}\) are discriminant functions linear in the x [11, Chapter 2; 25]. In TNB, unlike SNB and LCMNB, these discriminant functions can be tuned to maximize the classification ability of the TNB based classifiers by tweaking the value of the \(\lambda \) parameter in the interval [0,1]. Confining the value of \(\lambda \) to the range \(0\le \lambda \le 1\) means the parameter attenuates/tapers the contribution of the second term in Eq. 11 to estimating \(\log p(\omega _j\mathbf{x})\)—hence, the acronym “Tapered Naïve Bayes”. The reason why the \(\lambda \) value is being confined to the interval [0,1] is touched upon in the following paragraph. A full mathematical description of TNB will be given elsewhere.
One particular consequence of the simplistic assumption (SA) that makes the central tenet of the Naïve Bayes approach is that the SNB algorithm becomes intrinsically simple with high bias (but low variance) in its probability density estimates [26]. This bias increases with the value of L because the larger the value of L is the higher the chance of the L features becoming correlated. The fundamental reason for this increase of the chance of correlation among features is that in a highdimensional feature vector there is the potential of many of its components being zero. That is to say, x\(_{l}\) is more likely to assume 0 instead of 1 [19] which can lead to high correlation among features, which in turn can obviously render SA untenable—i.e., the Naive Bayes model severely misrepresents the data. This is the reason why, in our context, attenuation (not amplification) of the second term in Eq. 11 is required. This the main reason for limiting the allowed value of the \(\lambda \) parameter to [0,1].
Of course, feature selection may help to address the bias problem—attributable to the contributions from absence of features—by removing the irrelevant and redundant features and in doing so reduce the size of the feature space, which in turn may decrease the chance of the features becoming correlated. However, this is a slightly different issue as LCMNB was arguably concerned with reducing the chance of correlations among features by simply discarding contributions from absence of features to the estimation of \(p(\omega _{j}\mathbf{x})\).
In any event, in the light of the preceding discussion, the LCMNB algorithm can clearly now be viewed as a severely penalised SNB algorithm.
Before we embark on testing the validity of Conditions (1) and (2), and also answer the question raised in "The conditions", we describe how to compute \(p(\omega _{j}x_{l}=0)\) and \(p(\omega _{j}x_{l}=1)\). We also outline the performance measures and statistics tests utilised to compare the three methods: TNB, SNB and LCMNB.
Implementation and computation details
In this work the estimators of \(p(\omega _jx_l=1)\) and \(p(\omega _jx_l= 0)\) were computed using the following equations:
where
where
Both in Eqs. 12 and 14: \(p(x_{l}) = \sum ^{J}_{j=1}p(x_{l}\omega _j)p(\omega _{j})\). \(N_{lj}\) denotes the number of times feature x\(_{l}\) is present in class \(\omega _{j}\), i.e., \(x_l = 1\). The variables \(\alpha _{j}\) and \(\beta _{j}\) are Beta distribution parameters [5], both were set to 1; \(N_{\omega _{j}}\), N and J are as described before.
Data set
Bioactivity data were extracted from the ChEMBL17 database [27] for us to test: (a) the conditions under which SNB and LCMNB are equivalent, (b) whether LCMNB can yield better classification performance than SNB, and (c) the validity of the concept, on which the TNB algorithm, is based.
At the time accessed, the database comprised more than 1.3 million annotated compounds and more than 12 million bioactivity records covering 9,356 targets. To obtain the appropriate data points for our objective, we prioritised targets with the highest number of small ligands (≤1 kDa) annotated with IC50 or Ki inhibitory binding values on single human proteins with high confidence scores of 9. Duplicates were removed by comparing the first level (nonstereochemistry) value of the InChI keys of each compound and then retaining the lowest annotated value in cases were more than one value was measured for the same compound. Since different targets have different activity value ranges, the minimal activity threshold to locate an active set was computed as the average of the negative logarithmic activity values (i.e., \({{}{\log}} {Ki}\) or \({}{\log} {IC50}\)) plus one standard deviation above that activity value for each target. In cases where both IC50 and Ki values were measured for the same target, we retained only the values sampled from the most abundant measured type in order to avoid mixing IC50 and Ki values. The top 60 targets with the largest number of active ligands per target were then compiled and prepared for fingerprints calculations. ChemAxon’s Standardizer software [28] was utilised to remove fragments such as salts and ions; and explicit hydrogen atoms, and neutralising their structures.
This resulted in 10,838 small molecules (ligands) annotated over 60 target proteins. A closer look at this dataset revealed that it consisted of: 4,658 ligands annotated over 31 enzymes, Table 1; 5,031 ligands distributed over 23 membrane receptors, Table 2; and 1,149 ligands annotated over four transporters, one ionchannel and one transcription factor, Table 3. It was these three datasets that were utilised in this study.
Compound fingerprints
Extended Connectivity Fingerprints (ECFP) were calculated in RDKit using a Python based script to generate fixedlength ECFP4 binary fingerprints with a length of 1,024 bits—counting each bit once [29].
The compounds were put together in one dataset and duplicated structures reported as being active against more than one target were removed in order to have unique active compounds on each target class. All the fingerprints were then read and binary values were set to the value 1 if the fingerprint was present in a compound and 0 if it was absent. The total number of fingerprints is set by the numbers of fingerprints in each dataset to avoid columns with 0 values for all compounds in the dataset. This gave a fingerprint of 1’s and 0’s, with an string length of 23,324, to represent each ligand in our dataset.
In the context discussed in the "Background" and "Methods" sections: ligands in these datasets are the patterns x; the fingerprint denotes feature \(x_{l}\), while L = 23,324; proteins denote the classes (class labels) \(\omega _{j}\), i.e., J = 60; N is 4,658 (for the enzymes dataset), 5,031 (for the receptors dataset), and 1,149 (for transporters, ionchannel and transcription factor dataset, henceforth referred to as the mixed dataset).
Copies of the source code and the data sets utilised in this work can be obtained by sending a request to mussax021@gmail.com.
Model constructions and evaluation measures
A mutual information method (MIM) [30–32] was utilised to compute the pertinence of feature x\(_{l}\) for pattern classification. MIM basically measures how much relevant information feature x\(_{l}\) contributes to making the correct classification decision on a pattern belonging to class \(\omega _j.\) Ideally the bigger this information (the socalled mutual information between feature x\(_{l}\) and class \(\omega _{j}\)) the more useful the feature becomes for accurately classifying patterns.
Based on the mutual information measure returned by MIM for each pattern feature, the L pattern features were ranked in descending order of importance. Then the top 1, 2, 4, 6,…,98 and 100% of the ranked L pattern features—denoted in the following as L \(^{s}\)—were utilised to construct and test classifiers.
A stratified tenfold crossvalidation method was used to validate classifiers. In each fold, nine portions of the data set were utilised as a training data set to construct the classifier employing Eqs. 7, 9, 11, 12 and 14. The remaining 10th portion was used as a test set.
The performances of SNB, LCMNB and TNB classifiers on a given dataset were compared by using McNemar’s test statistics and a multiclass Matthews correlation coefficient (MCC) measure [33].
To generate a TNB classifier, it was necessary to optimize the \(\lambda \) parameter (in Eq. 11). In this work, the MCC measure metric and the tenfold crossvalidation scheme were employed to optimise the value of \(\lambda \).
Results and discussion
We should state from the outset that the classification results presented in this study were retrospective in the sense that the classes predicted for the test ligands were known beforehand.
Note that, although the xaxes in the figures below show the total number of features employed, in the LCMNB case only the presence of features was considered.
Testing: conditions 1 and 2
The enzymes dataset: 4,658 ligands distributed over 31 enzymes
Figure 1a shows a plot of MCC values returned by the SNB (red line) and LCMNB (blue line) classifiers vs the number of features selected to construct and test the classifiers.
The SNB model performed best when the value of L \(^{s}\) was 4,665 (i.e., the top 20% of the L ranked features were utilised); the MCC value obtained was 0.801. The corresponding MCC value returned by the LCMNB model using this set of features was 0.791. The pair of MCC values were similar, within 1.2% of each other. However, looking into the statistics of the two classification results obtained by the two approaches revealed that at the significance level of 0.05 and one degree of freedom a McNemar’s test yielded a \(\chi ^{2}\) value of 4.290. This means the two algorithms performed differently, whereby the SNB classifier outperformed the LCMNB classifier for the data set employed when \(L_{s}=4,665\) (see Figure 1a). Furthermore, the SNB classifiers systematically outperformed their LCMNB counterparts whenever L _{ s } < 5,131. However, the two methods performed similarly when the value of \(L_{s}\) was between 5,131 and 6,531. When the value of L _{ s } > 6,531, Figure 1a clearly illustrates that the LCMNB approach systematically outperformed the SNB algorithm. In fact, as the value of \(L_{s}\) was increased, the classification performance of the SNB model plunged, whereas the classification performance of the LCMNB remained less “sensitive” (in comparison to SNB) to the notably high values of \(L^{s}\).
This observation is not surprising and dovetails well with the explanations given in "Methods"—in that section, it was described the reason why the SNB model becomes more biased as the value of L \(^{s}\) considerably increases beyond the value of L \(^{s}\) with which the SNB model performs best, based on the the dataset utilised.
The receptors dataset: 5,031 ligands annotated against 23 membranereceptors
Figure 1b depicts the MCC values returned by the SNB (red line) and LCMNB (blue line) classifiers plotted against the number of features utilised, L \(^{s}\), to define the binary feature space, on which the classifiers were constructed. The SNB classifiers systematically outperformed their LCMNB counterparts whenever L _{ s } ≤ 6,531. The SNB model performed best when \(L_{s}\) was equal 5,131 (that is, when the top 22% of the ranked L features were employed); the MCC value obtained was 0.786. The corresponding MMC value returned by the LCMNB model based on this set of features was 0.777. The two MCC values are within 1% of each other. However, looking into the statistics of the two classification results obtained by the two models, once again, revealed otherwise: at the significance level of 0.05 and one degree of freedom, a McNemar’s test yielded a \(\chi ^{2}\) value of 5.693 in favour of the SNB algorithm. (Here, “in favour” means the number of test ligands misclassified by the SNB model but not the LCMNB model is smaller than the number of test compounds misclassified by the LCMNB model but not the SNB model for the test dataset.) When \(L_{s}\) was between 6,064 and 8,397, the two models performed similarly according to McNemar’s test. Figure 1b demonstrates that the LCMNB classifier systematically outperforms its corresponding SNB classifier when the value of L _{ s } > 8,397. This discrepancy became prominent when \(L_{s}\) is notably larger than 8,397: the performance of the SNB model markedly deteriorated, while performance of the LCMNB approach barely changed. The reason behind this observation is as explained before.
The mixed dataset: 1,149 ligands (four transporters, one transcription factor and one ionchannel)
Figure 1c illustrates a plot of MCC values returned by SNB (red line) and LCMNB (blue line) classifiers against the number of features employed to construct and test these classifiers.
For this dataset, the SNB classifier performed best when the top 2,332—i.e., 10% of the L—features were utilised. The MCC value returned was 0.917. The corresponding MCC value yielded by the LCMNB classifier returned was 0.884. Here, at a significance level of 0.05 and one degree of freedom, a McNemar’s test performed on the two sets of classifications results returned by the two models gave a \(\chi ^{2}\) value of 17.647 in favour of the SNB approach—in favour in the sense described in the previous section. The two algorithms performed similarly (albeit statistically) when the top number of features employed was not markedly different from 2,332. However, as the top number of features selected drifted away upwards from 2,332, the classification performance of the SNB approach deteriorated, while the LCMNB scheme performance showed lesser “sensitivity” (in comparison to SNB) to significantly increasing the value of L \(^{s}\), see Figure 1c. The explanation for this phenomenon is as given above.
One immediately observes that the best classification performances for all three data sets were achieved by the SNB approach. Furthermore, these best performances, which were supported by statistical tests, were notably obtained only when particular subsets of the L ranked features were employed.
From these analyses, based on our three datasets, we can surmise two main points. First, Conditions 1 and 2 do not always hold. Had they held, the two sets of results would have been (statistically or otherwise) similar. Hence, one should pay careful attention to these facts when it comes to applying LCMNB as a substitute for SNB. Secondly, the best classification performances were returned by the SNB approach for all three data sets. This suggests that taking into account absence of features—provided one does not utilise them in a slipshod manner—can have discriminatory powers, capable of enhancing the classification ability of the SNB algorithm.
In summary, our analyses indicate that feature selection is a better option than severely penalising out absence of features.
Comparing the LCMNB, SNB and TNB approaches
Here we present what happens when one judiciously combines both feature selection and penalising out absence of features.
For all three data sets, \(\lambda \) was varied from 0 to 1. For a dataset, the \(\lambda \) value that results in the best MCC value was considered “optimal” for that dataset.
The enzymes dataset: 4,658 ligands distributed over 31 enzymes
Figure 2a depicts plots of MCC values returned by TNB vs \(L_{s}\) for different \(\lambda \) values varied from 0 to 1.0 in steps of 0.2. Neither LCMNB (\(\lambda \) = 0.0; blue line) classifiers nor SNB (red line; \(\lambda \) = 1.0) classifiers performed best. The best classification performance, MCC value of 0.820, was yielded by a TNB classifier whereby the value of \(\lambda \) was 0.2; with \(L_{s}\) being equal to 8,863—that is, the top 38% of the total number of features were utilised. Then the value of \(\lambda \) was varied in the range [0.05,0.35] in steps of 0.05, but this did not improve on the MCC value yielded by the TNB classifier where the value of \(\lambda \) was 0.2.
This TNB classifier systematically outperformed all the other classifiers including those based on SNB and LCMNB. Thus, it was not essential to statistically validate our findings. However, suffice it to say at a significance level of 0.05 and one degree of freedom, a McNemar’s test performed on any two corresponding sets of classifications results returned by TNB and SNB (or LCMNB) gave no \(\chi ^{2}\) value smaller than 3.84. This meant that the TNB and SNB (or LCMNB) classifiers performed differently, with the TNB classifier systematically outperforming both SNB and LCMNB classifiers.
For completeness we also looked into the classification performances of the TNB and LCMNB classifiers on classifying test ligands for each of the 31 target proteins in this dataset. The results are shown in Columns 2–3 of Table 4, which indicate that the LCMNB classifier performed similarly or better than the TNB classifier for only five (out of the 31) target proteins, vide the MCC values in italics print in the table.
The receptors dataset: 5,031 ligands annotated against 23 membranereceptors
Like for the enzymes data set, Figure 2b shows plots of MCC values returned by TNB vs L \(^{s}\) for different values of \(\lambda \) varied from 0 to 1.0 in steps of 0.2. Here, again, neither LCMNB (\(\lambda =0.0\); blue line) classifiers nor SNB (\(\lambda =1.0\); red line) classifiers performed best. The best MCC value of 0.797 was achieved by a TNB classifier with the value of \(\lambda \) being 0.2, and \(L_{s} = 9796\)—that is, the top 42% of the total number of features were utilised. The value of \(\lambda \) was varied in the range [0.05,0.35] in steps of 0.05, but this did not improve on the MCC value obtained by the TNB classifier where the value of \(\lambda \) was 0.2.
We also looked into the classification performances of the TNB and LCMNB classifiers on classifying test ligands for each of the 23 target proteins in this dataset. Columns 2–3 of Table 5 indicate that the LCMNB classifier performed better than the TNB classifier for only two (out of the 23) target proteins, see the MCC values in italics print in the table.
The mixed dataset: 1,149 ligands (four transporters, one transcription factor and one ionchannel)
Figure 2c shows plots of MCC values returned by TNB vs \(L_{s}\) for different values of \(\lambda \) varied from 0 to 1.0. Once again it was not SNB (\(\lambda =1.0\); red line) nor LCMNB (\(\lambda =0.0\); blue line) that obtained the best classification results. The best performance was returned by a TNB classifier where the value of \(\lambda \) was 0.25, and \(L_{s}\) was equal to 9,330—that is, the top 40% of the total number of features were utilised. The MCC value obtained by this TNB classifier was 0.921.
Columns 2–3 of Table 6 show the classification performances of the TNB and LCMNB classifiers on classifying test ligands for each of the six target proteins in the dataset. The two sets of MCC values indicate that the LCMNB classifier performed similarly or better than the TNB classifier for one (out of the six) target proteins as the the MCC values in italics print in the table depict.
Now, based on the data sets utilised, we may conclude: combining feature selection with apt penalization of absence of features can improve the classification performance of the Bernoulli Naive Bayes algorithm, in particular when the value of \(L_{s}\) is large and the training pattern vectors are highly sparse (in the sense described in “Background”).
Conclusion
In this work, we set out to examine the validity of a claim made in a paper by Mussa, Mitchell and Glen (MMG) concerning the application of the conceptually simple and computationally efficient classification algorithm, the LCMNB approach of Xia et al. MMG pointed out that the central tenet of the LCMNB approach—ignoring the role of feature absence when utilising Bernoulli Naïve Bayes algorithms for classification purposes—might only be justifiable under certain conditions.
If these conditions hold, LCMNB classifiers were expected to perform similarly to the SNB classifiers on classifying the test data sets employed in this work. However, SNB and LCMNB classifiers performed differently, whereby SNB classifiers returned the best classification results for all the three bioactivity data sets utilised in this study. These results suggest that taking into account—albeit prudently—absence of a feature can enhance (not impair) the classification ability of the SNB approach.
In this work, we also introduced a new variant of the Naïve Bayes algorithm termed “Tapered Naïve Bayes”, which encapsulates both LCMNB and SNB. Constructed and then tested on our three biactivity data sets, TNB systematically outperformed both SNB and LCMNB. These classification results lend support to the simple idea on which TNB was anchored—i.e., in order to avoid ending up with a highly biased Naïve Bayes classifier, when the value of L is large and the training pattern vectors are highly sparse (in the sense described before), penalise appropriately the contributions from absence of features to the classifier.
References
 1.
Mussa HY, Hawizy L, Nigsch F, Glen RC (2011) Classifying large chemical data sets: using a regularized potential function method. J Chem Inf Model. 51:4–14
 2.
Lowe R, Mussa HY, Nigsch F, Glen RC, Mitchell JBO (2012) Predicting the mechanism of phospholipidosis J Cheminform 4:1–9
 3.
De Ferrari L, Mitchell JBO (2014) From sequence to enzyme mechanism using multilabel machine learning. BMC Bioinform 15:1–13
 4.
Tyzack JD, Mussa HY, Williamson MJ, Kirchmair J, Glen RC (2014) Cytochrome P450 site of metabolism prediction from 2D topological fingerprints using GPU accelerated probabilistic classifiers. J Cheminform 6:1–14
 5.
Mussa HY, Mitchell JBO, Glen RC (2013) Full “Laplacianised” posterior Naïve Bayesian algorithm. J Cheminform 5:1–6
 6.
Rogers D, Brown RD, Hahn M (2005) Using extendedconnectivity fingerprints with Laplacianmodified Bayesian analysis in highthroughput screening followup. J Biomol Screen 10:682–686
 7.
Nigsch F, Bender A, Jenkins JL, Mitchell JBO (2008) Ligandtarget prediction using Winnow and Naïve Bayesian algorithms and the implications of overall performance statistics. J Chem Inf Model 48:2313–2325
 8.
Willett P (2011) Chemoinformatics: a history. Comput Mol Sci 1:46–56
 9.
Brown N (2009) Cheminformatics—an introduction to computer scientist. ACM Comput Survey 41: 2 (Article 8)
 10.
Engel T (2006) Basic overview of chemoinformatics. J Chem Inf Model 46:2267–2277
 11.
Duda RO, Hart PE (1973) Pattern classification and scene analysis 1. Wiley, New York (Chapter 2)
 12.
Young TY, Calvert TW (1974) Classification, estimation, and pattern recognition. Elsevier Science Ltd, New York
 13.
Hand DJ (1981) Discrimination and Classification. Wiley, Chichester
 14.
Ripley BD (1996) Pattern recognition and neural networks. Cambridge University Press, Cambridge
 15.
Webb AR (2002) Statistical Pattern Recognition 2. Wiley, Chichester
 16.
Raudys SJ, Jain AK (1991) Small sample size effects in statistical pattern recognition: recommendations for practitioners. IEEE Trans Pattern Anal Mach Intell 13:252–264
 17.
Murphy KP (2012) Machine learning: a probabilistic perspective 1. MIT Press, Cambridge (Chapters 5, 6 and 10—see Chapter 10 for the chain rule)
 18.
Meisel WS (1972) Computeroriented approaches to pattern recognition. Academic Press, New York (Chapters 2 and 6)
 19.
Xia X, Maliski EG, Gallant P, Rogers D (2004) Classification of kinase inhibitors using a Bayesian model. J Med Chem 47:4463–4470
 20.
Nidhi, Glick M, Davies JW, Jenkins JL (2006) Prediction of biological targets for compounds using multiplecategory Bayesian models trained on chemogenomics databases. J Chem Inf Model 46:1124–1133
 21.
Koutsoukas A, Lowe R, Motamedi YK, Mussa HY, Klaffke W, Mitchell JBO et al (2013) In silico target predictions: defining a benchmarking dataset and comparison of performance of the multiclass Naïve Bayes and ParzenRosenblatt window. J Chem Inf Model 53:1957–1966
 22.
Wale N, Karypis G (2009) Target fishing for chemical compounds using targetligand activity data and ranking based methods. J Chem Inf Model 49:2190–2201
 23.
Manning CD, Raghavan P, Schütze H (2008) Introduction to information retrieval. Cambridge University Press, Cambridge
 24.
Cox DR (2006) Principles of Statistical Inference 1. Cambridge University Press, Cambridge (Section 1.1)
 25.
Townsend JA, Glen RC, Mussa HY (2012) Note on Naïve Bayes based on binary descriptors in cheminformatics. J Chem Inf Model 52:2494–2500
 26.
Hand DJ (1992) Statistical methods in medical research. Stat Methods Med Res 1:49–67
 27.
Gaulton A, Bellis LJ, Bento AP, Chambers J, Davies M, Hersey A et al (2012) ChEMBL: a largescale bioactivity database for drug discovery. Nucleic Acids Res. 40:D1100–D1107
 28.
Standardizer 6.0.3 (2013) ChemAxon. http://www.chemaxon.com
 29.
Rogers D, Hahn M (2010) Extendedconnectivity fingerprints. J Chem Inf Model 50:742–54
 30.
Tourassia GD, Frederick ED, Markey MK, Floyd CE (1986) Application of the mutual information criterion for feature selection in computeraided diagnosis. Am Assoc Phys Med 33:1134–1140
 31.
Battiti R (1994) Using mutual information for selecting features in supervised neural net learning. IEEE Trans Neur Netw 5:537–550
 32.
Peng H, Long F, Ding C (2005) Feature selection based on mutual information: criteria of maxdependency, maxrelevance, and minredundancy. IEEE Trans Pattern Anal Mach Intel 27:1226–1238
 33.
Gorodkin J (2004) Comparing two Kcategory assignments by a Kcategory correlation coefficient. Comput Biol Chem 28:367–374
Authors’ contributions
DM generated the datasets. HYM initiated the main theme on which the manuscript hinges. All authors (DM, HYM, JBOM and RCG) contributed to analyzing the datasets and revising the final draft of the manuscript. All authors read and approved the final manuscript.
Acknowledgements
Mussa and Glen would like to thank Unilever for financial support, whereas Mussa and Mitchell thank the BBSRC for funding this research through Grant BB/I00596X/1. Mitchell thanks the Scottish Universities Life Sciences Alliance (SULSA) for financial support.
Competing interests
The authors declare that they have no competing interests.
Author information
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
About this article
Cite this article
Mussa, H.Y., Marcus, D., Mitchell, J.B.O. et al. Verifying the fully “Laplacianised” posterior Naïve Bayesian approach and more. J Cheminform 7, 27 (2015). https://doi.org/10.1186/s1332101500755
Received:
Accepted:
Published:
Keywords
 Classification
 Naïve Bayes
 Tapering
 Features