Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

# A Multi-Label Supervised Topic Model Conditioned on Arbitrary Features for Gene Function Prediction

1
School of Information, Yunnan Normal University, Kunming 650500, China
2
Key Laboratory of Educational Informatization for Nationalities Ministry of Education, Yunnan Normal University, Kunming 650500, China
3
School of Software, Yunnan University, Kunming 650091, China
*
Authors to whom correspondence should be addressed.
Genes 2019, 10(1), 57; https://doi.org/10.3390/genes10010057
Received: 30 November 2018 / Revised: 1 January 2019 / Accepted: 10 January 2019 / Published: 17 January 2019

## Abstract

:
With the continuous accumulation of biological data, more and more machine learning algorithms have been introduced into the field of gene function prediction, which has great significance in decoding the secret of life. Recently, a multi-label supervised topic model named labeled latent Dirichlet allocation (LLDA) has been applied to gene function prediction, and obtained more accurate and explainable predictions than conventional methods. Nonetheless, the LLDA model is only able to construct a bag of amino acid words as a classification feature, and does not support any other features, such as hydrophobicity, which has a profound impact on gene function. To achieve more accurate probabilistic modeling of gene function, we propose a multi-label supervised topic model conditioned on arbitrary features, named Dirichlet multinomial regression LLDA (DMR-LLDA), for introducing multiple types of features into the process of topic modeling. Based on DMR framework, DMR-LLDA applies an exponential a priori construction, previously with weighted features, on the hyper-parameters of gene-topic distribution, so as to reflect the effects of extra features on function probability distribution. In the five-fold cross validation experiment of a yeast datasets, DMR-LLDA outperforms the compared model significantly. All of these experiments demonstrate the effectiveness and potential value of DMR-LLDA for predicting gene function.

## 1. Introduction

As the main component of a cell, proteins are the most essential and versatile material of life. Thus, the research on protein functions is of great importance for the development of new drugs, better crops, and the development of synthetic biochemical . In recent years, new protein function prediction methods using machine learning algorithms have proliferated, based on various known information about proteins, and have increasingly become important long-standing research works in the post-genomic era. From the point of molecular biology, a protein is the product of a gene after the process of transcribing, translating, and post-translational modifying. Even though the real function of a gene is to encode one or more proteins executing practical functions, the function of a gene product has usually been regarded as the native function of the gene in gene-level experiments. Therefore, we do not distinguish between gene function and protein function in this paper, which are known collectively as gene function.
The most common computational approach for gene function prediction is to transfer the gene function into some specific features from their sequence or structure similarity, such as BLAST . In addition to sequence similarity, many gene function prediction methods have been exploited in recent years as the additional information extracted from proteins, such as protein structure , protein motif, biophysical properties , and integrated heterogeneous data sources . In reference , Evangelia et al. extract novel shape features from protein structures in the form of local (per amino acid) distribution of angles and amino acid distances, respectively. Each of the multi-channel feature maps is introduced into a deep convolutional neural network (CNN) for function prediction, and the outputs are fused through support vector machines or a correlation-based k-nearest neighbor classifier. In addition, automatic prediction using protein–protein similarity information can be further supplemented by experimental data [6,7]; this kind of method assumes that the closely related proteins (or genes) share similar functional annotations on the basis of network structure information. Researchers have made the relevant literature reviews of computational methods on gene function prediction in references [8,9,10].
From the point of machine learning algorithms, predicting gene function based on various data sources is a problem of classification in nature. A gene can be viewed as an instance to be classified—various kinds of data sources (such as an amino acid sequence, textual repositories, and motifs) can be organized into a feature space, so that each gene is represented as a set of attribute values; a function (such as a gene ontology (GO) term ) is regarded as a label. As a gene is always annotated by several functions, gene function prediction is actually a process of multi-label classification: a multi-label classifier is trained firstly on constructed attribute features and annotated genes, and then is used to predict function annotations for unannotated genes. From the above analysis, we believe that many multi-label classification algorithms have great potential to predict gene function, such as a support vector machine (SVM), neural network, and decision tree. In reference , Celine Vens et al. proposed three multi-label classifiers based on a hierarchical decision tree, and the experimental results from 24 datasets show that these classifiers are powerful and effective for gene function prediction.
In addition to traditional machine learning algorithms, a topic model is a kind of probabilistic generative model that has been applied into gene function prediction. In reference , Liu et al. introduced a typical multi-label supervised topic model into gene function prediction, which was called labeled latent Dirichlet allocation (LLDA) and is proposed in reference  for text mining. This research is the first effort to apply a multi-label supervised topic model into gene function prediction. Compared with traditional multi-label classification models, LLDA can model a function label as a topic, and thus can not only work out the function probability distributions over gene instances effectively, but can also directly provide the word probability distributions over functions. Nonetheless, the direct application of LLDA on a gene function dataset can only utilize protein sequence data by formalizing the sequences into a bag of words (BoW), and then the constructed bag of words is used for topic modeling. In other words, due to the restrictions of BoW construction in topic modeling, the feature space was constructed on sequence data rather than multiple biological data. However, we can see from the above paragraph that there are various protein features, such as hydrophobicity and the polarity of amino acids, which have a profound impact on gene structure and function. Apparently, the introduction of multiple kinds of gene features in a multi-label supervised topic model can improve the accuracy of gene function prediction.
Inspired by the application of a multi-label topic model in gene function prediction and a topic model conditioned on arbitrary features named the Dirichlet multinomial regression latent Dirichlet allocation (DMR-LDA) , we propose a DMR-LLDA model, which introduces a DMR framework into an LLDA model. Firstly, we describe DMR-LLDA for gene function prediction problem formulation. Then the generative process and the inference algorithm of DMR-LLDA are described. This model is fully compatible with both discrete and continuous features, whose inference is relatively simple. In a five-fold cross validation experiment on verified gene function prediction, DMR-LLDA significantly outperformed LLDA. In addition, the impact of feature variables on prior parameters and the comparison between two kinds of inference algorithms are shown in experimental data. All these experimental results demonstrate the effectiveness and potential value of DMR-LLDA for predicting gene function.

## 2. Methods

#### 2.1. Related Definitions and Notations

In this paper, the topic modeling method of gene function prediction reported by reference  is utilized. We consider each gene to be a document , and GO terms (topics) are shared by a document collection. Meanwhile, we view the extra gene features, except for the bag of amino acid words, as the metadata, such as authors and dates of documents. Therefore, the introduction of extra gene features into topic modeling is similar to introducing metadata into the topic modeling of documents, and the type of metadata may be discrete or continuous. To better understand the practical application of our method, the relationship of text topic modeling and gene function predicting is illustrated by Figure 1.
In Figure 1, the right part describes the topic modeling concept of text data, and the left part describes the related concept of gene function data. For all topic models, there are three key concepts: “documents”, “words”, and “topics”. In addition, the supervised topic model introduces “labels” for each document, and the proposed DMR-LLDA model introduces “features” for each document. Therefore, these concepts can now be reformulated with more detail, as follows.

#### 2.1.1. Documents

For text data (right part of Figure 1), document collection is composed of several documents numbered D1 to Dn. In the other side (left part of Figure 1), the gene dataset is composed of several protein sequences, numbered G1 to Gn. Therefore, a document is equivalent to a gene in our model. We suppose that there are $D$ genes in a gene set, which compose the gene space $D = { 1 , … , D }$, and the gene sample set $X$ including $D$ genes can be represented as $X = { X d } d = 1 D$, and $X d$ denotes a gene sample.

#### 2.1.2. Labels

For text data (right part of Figure 1), each document is labeled by one or more tags, such as “programming” and “language”. On the other side (left part of Figure 1), each gene is annotated by several GO terms, such as “GO:0003012” and “GO:0003547”. Therefore, a document tag is equivalent to a GO term in our model, and all of them are called “labels”. In this paper, the gene function label space is expressed as $L = { 1 , … , L }$. Meanwhile, the observed labels of each gene are described by a sparse binary vector $Λ d = { Λ d l } l = 1 L$, which is defined as follows:
$Λ d l = { 1 , l ∈ L d 0 , l ∉ L d$
where, $L d$ represents the label sub-space of gene $X d$: $L d ⊆ L$.

#### 2.1.3. Words

For text data (right part of Figure 1), word terms are the main component of a document, such as the words “table” and “database”. On the other side (left part of Figure 1), we consider a protein sequence to be a text string, which is defined by a fixed 20 amino acid alphabet (G,A,V,L,I,F,P, Y,S,C,M,N,Q,T,D,E,K,R,H,W). Correspondingly, amino acid blocks are the main components of a protein sequence, which is composed by two or more amino acid alphabets, such as “MS” and “TS”. Therefore, a word term is equivalent to an amino acid block in our model, and all of them are called “words”. Meanwhile, all of the words constitute a vocabulary. In this paper, the amino acid words space is represented as $W = { 1 , … , W }$. For a gene $X d$, $X d = { x d n } n = 1 N d$ denotes that the $d$th gene is composed by $N d$ observed word samples, and $x d n$ is one of word samples.

#### 2.1.4. Topics

For text data (right part of Figure 1) and gene function data (left part of Figure 1), a “topic” is viewed as a probability distribution over a fixed vocabulary. Taking the text data as an example, the probabilities of the word “table” over “topic 1” are 0.05. For the gene function data, the probabilities of amino acid block MS over “topic 1” are 0.21. Obviously, topics are latent and needed to be inferred by topic modeling. In this paper, the global topic space includes $T$ topics, which is represented as $T = { 1 , … , T }$. According to the definition of an LLDA model, there is a one-to-one correspondence between label and topic—therefore, $L ≜ T$ ($≜$ represents equivalent relationship between two space), $T = | T | = L = | L |$.

#### 2.1.5. Features

For text data (right part of Figure 1), the metadata of a document can be viewed as document features, such as the tags “author” and “publish year of document”. On the other side (left part of Figure 1), each gene has several extra features, except for its sequence string, such as molecular weight and hydrophobicity. Therefore, the metadata of a document tag is equivalent to an extra feature of the gene in our model, and all of them are called “features”. In this paper, the feature space composed by gene features is expressed as $F = { 1 , … , F }$. Therefore, there is a set of observed features for gene $X d$, which can be represented as a feature vector: $y d = { y d f } f = 1 F$.

#### 2.1.6. Others

In addition to the above five concepts, there are three other concepts illustrated in Figure 1. Firstly, the BoW, which is a word–document matrix and the input of the topic model. In an instance in the right part of Figure 1, the word “table” appears two times in document D1. Likewise, the word “MS” appears one time in gene G1. In other words, the element of the BoW represents the times of each word in each document. Meanwhile, there are two probability matrices that appear in Figure 1: one is the topic (label)–word probability matrix, and the other is the document (gene)–topic probability matrix. All of them are represented as parameter vectors for each topic or gene in the topic model.
A topic corresponds to a multinomial distribution of word space $W$, whose parameter vector is $θ t = { θ t w } w = 1 W$, and $θ t w$ is the probability of word $w$ under topic $t$; a gene $X d$ corresponds to a multinomial distribution of the topics space $T$, whose parameter vector is $π d = { π d t } t = 1 T$, and $π d t$ is the topic weight of topic $t$ under gene $X d$. Finally, we utilize a feature parameter vector $β t = { β t f } f = 1 F$ to represent the relationship between features (f) and topics (t) in making features influence the choice of topic.
Note that the shared parameters of a whole gene set, such as topic–word parameter $θ$, are called “global parameters” in this paper. Correspondingly, the parameter of one gene is called a local parameter, such as gene–topic (label) parameter $π$.

#### 2.2. Overview of the Dirichlet–Multinomial Regression Latent Dirichlet Allocation Topic Modeling Process

Based on the above notation, we can provide the description of a gene function dataset as follows.
The gene $X d$ is composed of $N d$, which are observed samples, and the word index of each sample $x d n$ comes from the vocabulary $w d n ∈ W d$. Thus, the gene can also be represented as $W d = { w d n } n = 1 N d$, where $W d$ is the local word subspace of $X d$. In addition, the latent variables of gene $X d$ is its topic subset $T d = { t d n } n = 1 N d$, where $t d n ∈ T d$, and $T d$ is the local topic subspace, $W d ⊆ W$, and $T d ⊆ T$. Specifically, each gene shares the global topic space $T d ≡ T$, where $d ∈ D$. In this case, we suppose that each word $w ∈ W d$ of each gene $X d$ shares the same feature vector: $y d w ≡ y d = { y d f } f = 1 F$.
Then, the topic modeling process of our model can be interpreted as follows: for the training set, learning the unknown parameter $θ t$, $π d$, and $β t$ from the observed variables $W d$, $T d$, and $y d$; for the testing set, predicting $T d$ and $π d$ from known parameters $θ t$ and $β t$, and the observed variables $W d$ and $y d$. Obviously, $θ t$ and $β t$ are global parameters, which are shared by the whole dataset. The above two steps are also called model training and predicting, and are realized by learning and inference algorithms, such as Gibbs sampling  and variable inference .
Moreover, there are two steps before model training and predicting: BoW construction and model description. Since we constructed the BoW of the gene in exactly the same way as reference , this step will be not repeated in this paper. For model description, there are usually two ways to describe a probabilistic graphical model, including the generative process and the graphic model, which are discussed in the next sections. The overview of our topic modeling process is depicted in Figure 2.

#### 2.3. Description of the Dirichlet–Multinomial Regression Latent Dirichlet Allocation Model

This section provides the description of DMR-LLDA, including its generative process and graphic model. It is worth noting that our DMR-LLDA introduces the DMR framework for gene features based on the LLDA model, so this paper emphasizes the DMR part rather than the classic LLDA.
According to DMR framework, each word sample $x d n$ of gene $X d$ is a “individual”, and all of the samples ${ x d n } n = 1 N d$ are divided into $| W d | = W d$ groups by word number $| W d | = W d$. A bag of words ${ x d n } n = 1 N d w$ is composed by $N d w$(the number of word $w$ appeared in gene $X d$) samples of the $w$-th group, and corresponds to a feature vector $y d w$, which influences the latent topic $t ∈ T$ choice of all samples.
We suppose that
$α ˜ d w t = exp ( y d w β t T ) ≡ exp ( y d β t T ) = α ˜ d t , w ∈ W d$
In Equation (2), $β t = { β t f } f = 1 F$ represents feature parameters that correspond to topic $t$. Likewise, each bag of words $w$ of gene $X d$ shares the same clustering random variable:
$exp ( ξ d w t ) ≡ exp ( ξ d t ) = ζ d t , w ∈ W d$
where $π d t$ is the selecting probability of the n-th word sample of gene $X d$, which chooses topic $t$ and maximizes the utility selection $U d n t$. In addition, $π d = { π d t } t = 1 T$ is the topic weight vector of gene $X d$, which obeys the Dirichlet distribution of parameter ${ δ d − 1 α ˜ d t } t = 1 T$:
$p ( π d ) = p ( { π d t } t = 1 T ) = Γ ( ∑ t = 1 T δ d − 1 α ˜ d t ) ∏ t = 1 T Γ ( δ d − 1 α ˜ d t ) ∏ t = 1 T π d t δ d − 1 α ˜ d t − 1 = Γ ( ∑ t = 1 T α d t ) ∏ t = 1 T Γ ( α d t ) ∏ t = 1 T π d t α d t − 1$
where $α d t$ is the hyper-parameter of $π d t$:
$α d t = δ d − 1 α ˜ d t = δ d − 1 exp ( y d β t T )$
The description of DMR-LLDA from the global and local perspective is shown below.
From the global perspective, each topic $t ∈ T$ can be represented as a multinomial distribution over vocabulary $W$, whose parameter is expressed as vector $θ t = { θ t w } w = 1 W$, and we suppose that $θ t$ obeys Dirichlet conjugate prior distribution. Each topic $t ∈ T$ corresponds to a feature weight parameter vector $β t$, which obeys the normal distribution of parameter $( μ , σ 2 )$.
From the local perspective, each gene $X d$ is composed by $N d$ observed samples, which corresponds to local word number subset $W d = { w d n } n = 1 N d$ and local latent topic number subset $T d = { t d n } n = 1 N d$, where $T d$ obeys multinomial distribution of parameter $π d$. The local observed word subspace of gene $X d$ is $W d$, the local observed label subspace is $L d$, and the local observed feature subspace is $F d$. Each label $l ∈ L d$ corresponds to a topic $t ∈ T$, where $T d ≡ L d ⊆ T$ and $Λ d = { Λ d t } t = 1 T = { Λ d l } l = 1 L$. The dimension of topic weight $π d = { π d t } t ∈ T d$ corresponds to $T d$, which is $T d = | T d | = | L d | ≠ T$. At the same time, the range of topics on feature weight parameter vector $β t$ is limited to $t ∈ T d$. In addition, $y d β t T$ decides the hyper-parameter $α d = { α d t } t ∈ T d = { α d t } t ∈ L d$ of $π d$, which is the dot-product of feature vector $y d$, corresponding to feature subspace $F d$ and its weighted parameter vector $β t$.
Above all, the Dirichlet prior hyper-parameter $α d$ of $π d$ can be expressed as
$α d = { α d l } l ∈ L d = { α d t Λ d t } t = 1 T , | α d | = T d = L d$
where $α d t$ is computed by Equation (5). The local topic weight $π d$ can be also represented as
$π d = { π d t } t ∈ T d = { π d t Λ d t } t = 1 T , | π d | = T d = L d$
Given the above, the generative process of DMR-LLDA can be described as follows. The corresponding graphical model is shown in Figure 3.
For each global topic $t ∈ T = { 1 , … , T }$, we can
(a) Generate a feature weighted parameter vector $β t = { β t f } f = 1 F$ of topic $t$ from $F$ dimension’s normal distribution of parameter $( μ , σ 2 )$:
$β t = { β t f } f = 1 F ∼ N ( μ , σ 2 I )$
(b) Generate a multinomial parameter vector $θ t = { θ t w } w = 1 W$ from a $W$ dimension Dirichlet distribution:
$θ t = { θ t w } w = 1 W ∼ Dir ( λ )$
For each gene $X d$, $d ∈ D = { 1 , … , D }$. This means that
(a) We suppose that $α d t = δ d − 1 α ˜ d t$ ($δ d > 0$) as the Dirichlet prior hyper-parameter of the topic weight
$α d t = δ d − 1 exp ( y d β t T ) = δ d − 1 exp ( ∑ f = 1 F y d f β t f )$
(b) The binary vector $Λ d = { Λ d t } t = 1 T$ limits the prior hyper-parameter $α d$ of local topic weight
$α d Λ d = { α d t Λ d t } t = 1 T$
(c) We can generate local weight topic vector of topic $t$ from a Dirichlet distribution:
$π d = { π d t Λ d t } t = 1 T ∼ Dir ( α d Λ d )$
(d) For each word sample $x d n$, we can
i. Generate topic number $t d n$ of $x d n$ from $T$ dimensions’ multinomial distribution of parameter $π d$:
ii. Generate word number $w d n$ of $x d n$ from $W$ dimensions’ multinomial distribution of parameter $θ t d n$:
As we can see from Figure 3, $α d$ is computed by feature vector $y d$ and its weighted parameter. Therefore, $α d$ is a parameter rather than a random variable in the LLDA.
In our DMR-LLDA model, the unknown parameters to be estimated are the global feature parameter $β$, the global topic–word multinomial distribution parameter $θ$, and the local topic weight $π$. The hidden variable to be estimated is $T$. The known data are the observed word samples $W$ and binary vector $Λ$. The joint distribution of $( β , π , θ , T , W )$ is shown in Equation (15):
$p ( β , π , θ , T , W | μ , σ 2 , Λ , λ ) = p ( β | μ , σ 2 ) ⋅ ∏ t = 1 T p ( θ t | λ ) ⋅ ∏ d = 1 D p ( π d | Λ d , α d ) ∏ n = 1 N d p ( t d n | π d ) p ( w d n | t d n , θ )$
Above all, the proposed method utilizes extra features as the prior knowledge of the related distribution, which is able to gain more reliable prior distribution for the LLDA; then a more precise estimation of posterior distributions is obtained.

#### 2.4. Inference Algorithm of Dirichlet–Multinomial Regression Latent Dirichlet Allocation

The core learning task of DMR-LLDA is to compute the parameters $( π , θ , β )$ and posterior distribution . The posterior estimation represents the estimating value of the parameter under the training set. The prediction process of DMR-LLDA is that on the basis of the estimated three parameters and a hidden variable, we update the unknown local parameter $π$ and hidden variable of the test gene by fixing the learned global parameters $β$ and $θ$; then, we get the corresponding relationship between the label and the topic. The Gibbs sampling algorithm and the variable Bayesian algorithm are two essentially approximate inference algorithms of a probabilistic graphic model, and the purpose of them is universal. In order to compare their impact on the model performance of difference inference algorithms, we designed a collapsed Gibbs sampling algorithm (CGS), a collapsed variable Bayesian algorithm (CVB), and a zero-order variational Bayesian algorithm (CVB0) for DMR-LLDA, with detail as follows.

#### 2.4.1. The Collapsed Construction of Dirichlet–Multinomial Regression Latent Dirichlet Allocation

First of all, after the integration of model parameters $( π , θ )$ in a joint distribution, a semi-collapsed $( β , T , W )$ joint distribution is obtained:
$p ( β , T , W | Λ , α , λ , μ , σ 2 ) = p ( β | μ , σ 2 ) p ( T | Λ , α ) p ( W | T , λ ) ∝ ∏ t = 1 T ∏ f = 1 F 1 2 π σ 2 e − ( β t f − μ ) 2 2 σ 2 ⋅ ∏ d = 1 D Γ ( ∑ t = 1 T α d t Λ d t ) Γ ( ∑ t = 1 T α d t Λ d t + N d ) ∏ t = 1 T Γ ( α d t Λ d t + N d t Λ d t ) Γ ( α d t Λ d t ) ⋅ ∏ t = 1 T Γ ( ∑ w = 1 W λ w ) Γ ( ∑ w = 1 W λ w + N t ) ∏ w = 1 W Γ ( λ w + N t w ) Γ ( λ w )$
The predictive probability distribution for the topic assignment of sample $x d n$ is
$p ( t d n = t | T ( \ d n ) , W ( \ d n ) , Λ , α , λ ) ∝ p ( t d n = t , w d n = w | T ( \ d n ) , W ( \ d n ) , Λ , α , λ ) = p ( t d n = t | T ( \ d n ) , Λ , α ) p ( w d n = w | t d n = t , T ( \ d n ) , W ( \ d n ) , λ ) ∝ ( α d t + N d t ( \ d n ) ) Λ d t λ w + N t w ( \ d n ) ∑ w = 1 W λ w + N t ( \ d n )$
$N d t ( \ d n ) Λ d t$ is the number of samples that are assigned to the corresponding topic $t$ of gene $X d$, except for sample $x d n$. $N t w ( \ d n )$ is the number of samples that are assigned to the word $w$ of topic $t$, except for sample $x d n$; therefore, $N t ( \ d n ) = ∑ w = 1 W N t w ( \ d n )$.
In Equation (17), $α d t$ is optimized by local observed feature vector $y d = { y d f } f = 1 F$ and global feature parameter $β t = { β t f } f = 1 F$, whose updating equation is Equation (5). To simplify the updating equation, we first suppose that $log δ d − 1 = y d f d e f a u l t β t f d e f a u l t$, and then an item of hidden global feature parameter $β t f d e f a u l t$ is added for global feature parameter $β t = { β t f } f = 1 F$, which corresponds to a “fake” observed feature $y d F d e f a u l t = 1$. Thus, the updating equation of $α d t$ is
$α d t n e w = exp ( y ^ d β ^ t T ) = exp ( y d f d e f a u l t β t f d e f a u l t + ∑ f = 1 F y d f β t f )$
$β ^ t = { β t , β t F d e f a u l t } = { β t 1 , β t 2 , … , β t F , β t F d e f a u l t } y ^ d = { y d , y d F d e f a u l t } = { y d 1 , y d 2 , … , y d F , 1 }$

#### 2.4.2. The Optimization of the Feature Parameters of Dirichlet–Multinomial Regression Latent Dirichlet Allocation

For Gibbs sampling or variable Bayesian, we need to update the global feature parameter $β ^ t$ in the inference process. We adopted the method of gradient descent for optimizing $β ^ t$.
In Equation (16), the $β ^$-related section is
$F ( β ^ ) ∝ ∏ t = 1 T ∏ f = 1 F + 1 e − ( β t f − μ ) 2 2 σ 2 ⋅ ∏ d = 1 D Γ ( ∑ t = 1 T α d t Λ d t ) Γ ( ∑ t = 1 T α d t Λ d t + N d ) ∏ t = 1 T Γ ( α d t Λ d t + N d t Λ d t ) Γ ( α d t Λ d t )$
Based on the logarithm of Equation (20), we take the derivative with respect to global feature parameter $β t f$ and adjust it to zero. The updated equation of $β t f$ is
$β t f n e w = σ 2 ∑ d = 1 D y d f α d t n e w Λ d t { Ψ ( ∑ t = 1 T α d t n e w Λ d t ) − Ψ ( ∑ t = 1 T α d t n e w Λ d t + N d ) + Ψ ( α d t n e w Λ d t + N d t Λ d t ) − Ψ ( α d t n e w Λ d t ) } + μ t ∈ T = { 1 , … , T } f ∈ F ′ = { 1 , … , F , F + 1 }$
Finally, $α d t n e w$ is updated by Equation (18).

#### 2.4.3. The Collapsed Gibbs Sampling Algorithm of the Dirichlet–Multinomial Regression Latent Dirichlet Allocation

To determine the initial state of the Markov chain, we initiate the hidden topic number $t d n$ of each sample $x d n$ first; then, we utilize the predictive probability of hidden variable $t d n$ from Equation (17) as the state transition probability of the Markov chain. In the process of Gibbs sampling, the topic number $t d n$ of each sample $x d n$ is updated, and the hyper-parameter $α d = { α d t Λ d t } t = 1 T$ is also updated by Equation (18). Finally, the global feature parameter $β t f$ is updated by Equation (21).
After several iterations in the burn-in time, the Markov chain is attracted to objective distribution, and then the posterior distribution $p ( β , T | W , μ , σ 2 , α , λ )$ is estimated. The posterior estimation of the local topic weight $π d = { π d t Λ d t } t = 1 T$ and topic–word multinomial distribution parameter is
$π ^ d t = α d t Λ d t + E [ N d t Λ d t ] ∑ t = 1 T ( α d t Λ d t + E [ N d t Λ d t ] )$
$θ ^ t w = λ w + E [ N t w ] ∑ w = 1 W ( λ w + E [ N t w ] )$

#### 2.4.4. The Collapsed Variable Bayesian Inference Algorithm of the Dirichlet–Multinomial Regression Latent Dirichlet Allocation

The whole variational objective function before being collapsed is
$F ( η ) = E q [ log p ( β , π , θ , T , W ) ] − E q [ log q ( β , π , θ , T | η ) ] = E q [ log p ( T , W ) ] − E q [ log q ( T | η ) ] = KL ( q ( T | η ) | | p ( T , W ) )$
After margining the model parameters $( π , θ )$, the objective function is
where $C o n s t q ( t d n )$ represents the unrelated item with variational distribution $q ( t d n )$. There are two kinds of construction below:
$F = KL ( q ( t d n ) | | exp { E q ( T ( \ d n ) ) [ log p ( t d n , w d n | T ( \ d n ) , W ( \ d n ) ) ] } ) + C o n s t q ( t d n )$
$F ≥ KL ( q ( t d n ) | | E q ( T ( \ d n ) ) [ p ( t d n , w d n | T ( \ d n ) , W ( \ d n ) ) ] ) + C o n s t q ( t d n )$
In Equation (26), the updating equation of optimal variational parameter $η d n t ∗$ by a CVB algorithm is
$η d n t ∗ = q CVB ∗ ( t d n = t ) ≈ exp { E q ( T ( \ d n ) ) [ log ( α d t + N d t ( \ d n ) ) Λ d t ] } + exp { E q ( T ( \ d n ) ) [ log ( λ w + N t w ( \ d n ) ) ] } − exp { E q ( T ( \ d n ) ) [ log ( ∑ w = 1 W λ w + N t ( \ d n ) ) ] }$
Each expectation of the above equation is
$E q ( T ( \ d n ) ) [ log ( α d t + N d t ( \ d w ) ) Λ d t ] = log ( α d t Λ d t + μ N d t ( \ d w ) ) − σ N d t ( \ d w ) 2 2 ( α d t Λ d t + μ N d t ( \ d w ) ) 2$
${ μ N d t ( \ d w ) = E q ( T ( \ d n ) ) [ N d t ( \ d w ) Λ d t ] = ∑ w = 1 W ( N d w − 1 ) η d w t Λ d t σ N d t ( \ d w ) 2 = V q ( T ( \ d n ) ) [ N d t ( \ d w ) Λ d t ] = ∑ w = 1 W ( N d w − 1 ) η d w t Λ d t ( 1 − ∑ w = 1 W ( N d w − 1 ) η d w t Λ d t )$
$E q ( T ( \ d n ) ) [ log ( λ w + N t w ( \ d w ) ) ] = log ( λ w + μ N t w ( \ d w ) ) − σ N t w ( \ d w ) 2 2 ( λ w + μ N t w ( \ d w ) ) 2$
${ μ N t w ( \ d w ) = E q ( T ( \ d w ) ) [ N t w ( \ d w ) ] = ∑ d = 1 D ( N d w − 1 ) η d w t Λ d t σ N t w ( \ d w ) 2 = V q ( T ( \ d w ) ) [ N t w ( \ d w ) ] = ∑ d = 1 D ( N d w − 1 ) η d w t Λ d t ( 1 − ( N d w − 1 ) η d w t ) Λ d t$
$E q ( T ( \ d n ) ) [ log ( ∑ w = 1 W λ w + N t ( \ d w ) ) ] = log ( ∑ w = 1 W λ w + μ N t ( \ d w ) ) − σ N t ( \ d w ) 2 2 ( ∑ w = 1 W λ w + μ N t ( \ d w ) ) 2$
${ μ N t ( \ d w ) = E q ( T ( \ d w ) ) [ N t ( \ d w ) ] = ∑ d = 1 D ∑ w = 1 W ( N d w − 1 ) η d w t Λ d t σ N t ( \ d w ) 2 = V q ( T ( \ d w ) ) [ N t ( \ d w ) ] = ∑ d = 1 D ∑ w = 1 W ( N d w − 1 ) η d w t Λ d t ( 1 − ( N d w − 1 ) η d w t Λ d t )$
In Equation (27), the updating equation of the optimal variational parameter $η d n t ∗$ by CVB0 algorithm is
$η d n t ∗ = q CVB 0 ∗ ( t d n = t ) ≈ ( α d t Λ d t + E q ( T ( \ d n ) ) [ N d t ( \ d n ) Λ d t ] ) λ w + E q ( T ( \ d n ) ) [ N t w ( \ d n ) ] ∑ w = 1 W λ w + E q ( T ( \ d n ) ) [ N t ( \ d n ) ]$
The plenitude statistic of samples in Equation (35) are $N d t ( \ d n )$,$N t w ( \ d n )$, and $N t ( \ d n )$, and their expectation under variational distribution $q ( T ( \ d n ) )$ is
$E q ( T ( \ d n ) ) [ N d t ( \ d n ) Λ d t ] = ∑ i = 1 , i ≠ n N d I ( t d n = t ) η d i t Λ d t$
$E q ( T ( \ d n ) ) [ N t w ( \ d n ) ] = ∑ d = 1 D ∑ i = 1 , i ≠ n N d I ( t d n = t ) I ( w d n = w ) η d i t Λ d t$
$E q ( T ( \ d n ) ) [ N t ( \ d n ) ] = ∑ d = 1 D ∑ i = 1 , i ≠ n N d N d i η d i t Λ d t$
The $\ d n$ in the above equation can be adapted to $\ d w$, because the bag of words $d w$ not only shares a similar word number $w d n = w$, but also shares the same topic number $t d n = t$. Then, optimal variational distribution $η d n t ∗$ can be adapted to $η d w t ∗$.
$γ d t = E q ( T ( \ d w ) ) [ N d t ( \ d w ) Λ d t ] = ∑ w = 1 W ( N d w − 1 ) η d w t Λ d t$
$μ t w = E q ( T ( \ d w ) ) [ N t w ( \ d w ) ] = ∑ d = 1 D ( N d w − 1 ) η d w t Λ d t$
$μ t = E q ( T ( \ d w ) ) [ N t ( \ d w ) ] = ∑ d = 1 D ∑ w = 1 W ( N d w − 1 ) η d w t Λ d t$
The inference equation difference between CVB and CVB0 shows that CVB only retains the zero-order information of the Taylor expansion; however, CVB0 is the re-collapse of a hidden variable space based on Jensen inequality. Therefore, CVB0 is much more precise than CVB. The corresponding algorithm of CVB and CVB0 are shown in Table 1 and Table 2 respectively.

## 3. Materials and Results

This section provides a concise and precise description of the experimental results, their interpretation, and the experimental conclusions that can be drawn.

#### 3.1. Dataset

In this paper, the validity and accuracy of proposed models are tested on the S.cerevisiae (S.C) dataset, which is introduced in reference . This dataset includes several aspects of the yeast genome, such as sequence statistics, phenotype, expression, secondary structure, and homology. Meanwhile, two kinds of function annotation standard, including FunCat and GO, are used to annotate gene function. Due the universality of GO, the dataset depends on the GO that is adopted in our experiments. As described in Section 2.1, the construction of the BoW is based on amino acid composition, so we mainly use one of datasets that depends on the sequence statistics. In addition, we construct a dataset named S.C-CC from S.C, which only includes the GO terms belonging to the cellular component (CC). Therefore, there are fewer GO terms in the S.C-CC dataset when compared with the S.C dataset, and both of them are used in our experiments for investigating the influence of different label numbers on prediction performance. The statistics of the S.C and S.C-CC dataset is shown in Table 3. In this set, $F$ denotes the number of GO terms, $D$ denotes the number of genes, and $W$ denotes the size of the vocabulary.
As shown in Table 3, there are 1692 genes and 4133 function labels in the S.C dataset; in the S.C-CC dataset, there are 1692 genes and 547 function labels. Due to the large number of GO terms in the gene function dataset, we utilized a Boolean matrix decomposition (BMD) method to reduce the dimensionality of the function labels. BMD is a kind of label space dimension reduction (LSDR) method , which addresses the multi-label classification problem with many labels. LSDR approaches use a compression step to transform the original high dimension label space into a lower dimension label space, and then multi-label classifiers are trained on a dataset with fewer labels, which can reduce the computation burden of the classifier. The existing studies about LSDR show that LSDR approaches are useful for optimizing the running time and accuracy of multi-label classification. In our BMD process, original label matrix $Y ∈ { 0 , 1 } D × F$ ($D$ denotes the number of genes, and $F$ denotes the number of features) is decomposed into the product of two matrices, $C ∈ { 0 , 1 } D × L$ ($L$ denotes the number of labels) and $B ∈ { 0 , 1 } L × F$, where $Y = C ∘ B$ ($∘$ denotes Boolean product) is satisfied. We also called it exact BMD and adopted this algorithm, which is proposed in reference . Compared with other LSDR algorithms, an exact BMD can retain the interpretability of low dimension label space and restore the low dimension-predicted label matrix to the original label matrix by matrix $B$. At last, the number of function labels is reduced into a smaller dimension, and $L$ denotes the number of GO terms after label space dimension reducing. Then DMR-LLDA actually needs to process 1358 GO terms of the S.C dataset and 319 GO terms of the S.C-CC dataset. Nonetheless, the lower dimensional label space can be recovered by a Boolean product after predicting, so we still get the whole function labels sets in the prediction results.
DMR-LLDA’s advantage here over LLDA lies in the introduction of extra features. In the S.C and S.C-CC dataset, there are six extra gene features for each gene, including the molecular weight of the gene, the isoelectric point, the average coefficients of hydrophilic, the number of exons, the adaptability index of the codon, the number of motifs, and the open reading frame (ORF) number of chromosomes. The statistics of extra features are shown in Table 4.
As the max word length of the S.C dataset is two amino acid alphabets (G,A,V,L,I,F,P, Y,S,C,M,N,Q,T,D,E,K,R,H,W), a human dataset constructed by ourselves is adopted to evaluate the impact on the topic model performance of word length. This human dataset is constructed in a similar way as in reference . In addition, we also constructed two human datasets for different word lengths, where the max word length of the Human1 dataset is two amino acid alphabets, and that of the Human2 dataset is three amino acid alphabets. For the Human2 dataset, the original number of words is 8400, but we filtered several words that have a high frequency. Then, the statistic of the S.C and S.C-CC dataset is shown in Table 5.

#### 3.2. Parameter Settings and Evaluation Criterias

The DMR-LLDA learning framework involves four different parameters: $μ$, $σ 2$, $α$, and $λ$. The $α$ and $λ$ are the parameters of the two-Dirichlet distribution, where the larger the value of $λ$, the more balanced the probability of a word in a topic. The setting of the $λ$ value has been discussed in reference . Nonetheless, the value of $α$ is optimized by a protein feature, so its initial value does not have a big effect on model performance. According to the experience, we set $α = 50 / T$ as the initial value, and set $λ = 200 / W$, with $T = L$. In addition, $μ$ and $σ 2$ are respectively the mean and variance of normal distribution, obeyed by feature weighted parameter $β$, and we set $μ = 0 , σ 2 = 1$.
In the Gibbs sampling process of model training, we set the number of the Markov chain as 1 and the maximum number of iterations is 2000 times, where the number of iterations of burn-in time is set to 1000. We record the state space at intervals of 50 times on the converged Markov chain, and 20 times per record is conducted. In the process of model predicting, we set the number of iterations as 1000 times. After 500 iterations for the burn-in time, we record the state space at intervals of 50 times. In the variable Bayesian inferring process of model training, we initialize the global variable parameter $μ t w$ through random number $s$ and hyper-parameter $λ w$: $μ t w = λ w + ( s ∗ λ w ) / 10$; in each local variable inference, we set the converged threshold as 0.00001, and the maximum number of times of the local variable inference as 100. The number of global scanning iterations is 1000.
The five-fold cross validation is conducted to measure and compare the performance of DMR-LLDA and the comparative algorithms. Five representative multi-label learning evaluation criteria are used in this paper, including hamming loss (HL), average precision (AP), one error, and micro-averaged and macro-averaged F1 scores (Micro-F1 and Macro-F1). In addition, three kinds of areas under a precision–recall curve are also used, including $A U P R C ¯$, $A U ( P R C ¯ )$, and $A U P R C w ¯$, which is proposed in reference . Finally, we repeat the random partition and evaluation in five independent rounds, and report the average results.

#### 3.3. The Impact of Word Length on Model Performance

Firstly, the performance comparison of the LLDA model between the Human1 and Human2 datasets is shown in Figure 4. As shown in Figure 4, we find that the value of $A U P R C ¯$ and $A U P R C w ¯$ in Human1 is higher than that in Human2; the value of the AP on Human1 is lower than that of Human2; and the value of one error, HL, and $A U ( P R C ) ¯$ is almost equal to that of Human1 and Human2. These results show that the classification performance of the LLDA on Human1 and Human2 is almost the same, which reveals that the larger word space might not obtain a better classifying performance.
Moreover, related studies suggested that a word length of more than four amino acid alphabets would not improve the classification accuracy, and would only increase the complexity of computation . Therefore, in the following experiments, we only adopt the S.C and S.C-CC datasets whose word length is two amino acid alphabets.

#### 3.4. Gene Function Prediction with Cross Validation

In addition to LLDA, we also adopted three widely adopted methods: multi-label k-nearest neighbor (MLKNN) , back propagation for multi-label learning (BPMLL) , and support vector machines (SVMs) for performance comparison. MLKNN and BPMLL are two representative multi-label classifiers, and can be performed by an open source tool called Mulan . SVMs adopt a “one-versus-all” scheme, which trains each label by a binary SVM independently and is implemented using the LibLinear software package . These five models are trained and used to predict with the S.C and S.C-CC datasets. Figure 5 shows the HL, AP, one error, Micro-F1, Macro-F1, $A U ( P R C ¯ )$, $A U P R C ¯$, and $A U P R C w ¯$ values of all models in the two datasets, respectively. For AP, Micro-F1, Macro-F1, $A U ( P R C ¯ )$, $A U P R C ¯$, and $A U P R C w ¯$, the larger the value, the better the performance. Conversely, for HL and one error, the smaller the value, the better the performance. The red asterisk of Figure 5 represents the best results in each dataset. It is worth noting that the experimental results of this section are obtained by a CGS inference algorithm.
As shown in Figure 5, DMR-LLDA can achieve better results in almost all evaluation criteria for the two datasets. The concrete analysis is introduced as follows.
For the S.C dataset, the DMR-LLDA achieves the best performance for AP, $A U ( P R C ¯ )$, $A U P R C ¯$, $A U P R C w ¯$, Micro-F1, and Macro-F1. For example, with AP, the DMR-LLDA achieves 94%, 3.3%, 96%, and 26% improvements over MLKNN, LLDA, BPMLL, and SVMs, respectively. With $A U ( P R C ¯ )$, the DMR-LLDA achieves 109%, 2.3%, 89%, and 24% improvements over MLKNN, LLDA, BPMLL, and SVMs, respectively. For $A U P R C ¯$, the DMR-LLDA achieves 31%, 39%, 44%, and 25% improvements over MLKNN, LLDA, BPMLL, and SVMs, respectively. For $A U P R C w ¯$, the DMR-LLDA achieves 33%, 8.1%, 48%, and 10% improvements over MLKNN, LLDA, BPMLL, and SVMs, respectively. With Micro-F1, the DMR-LLDA achieves 116%, 6.1%, 123%, and 29% improvements over MLKNN, LLDA, BPMLL, and SVMs, respectively. On Macro-F1, DMR-LLDA achieves 22%, 2.9%, 24%, and 25% improvements over MLKNN, LLDA, BPMLL, and SVMs, respectively. Nevertheless, for one error and HL, SVMs get better results than the DMR-LLDA.
For the S.C-CC dataset, the DMR-LLDA obtains a better performance in terms of AP, $A U ( P R C ¯ )$, $A U P R C ¯$, $A U P R C w ¯$, Micro-F1, and Macro-F1. For AP, the DMR-LLDA achieves 36%, 1.7%, 39%, and 30% improvements over MLKNN, LLDA, BPMLL, and SVMs, respectively. For $A U ( P R C ¯ )$, the DMR-LLDA achieves 68%, 4%, 64%, and 20% improvements over MLKNN, LLDA, BPMLL, and SVMs, respectively. For $A U P R C ¯$, the DMR-LLDA achieves 73%, 35%, 62%, and 34% improvements over MLKNN, LLDA, BPMLL, and SVMs, respectively. For $A U P R C w ¯$, the DMR-LLDA achieves 67%, 6.4%, 92%, and 23% improvements over MLKNN, LLDA, BPMLL, and SVMs, respectively. For Micro-F1, the DMR-LLDA achieves 101%, 4.1%, 114%, and 26% improvements over MLKNN, LLDA, BPMLL, and SVMs, respectively. For Macro-F1, the DMR-LLDA achieves 18%, 1.8%, 16%, and 20% improvements over MLKNN, LLDA, BPMLL, and SVMs, respectively. Nevertheless, for one error, BPMLL gets better results than the DMR-LLDA; for HL, SVMs gets better results than the DMR-LLDA.
For both of the datasets, we can find that the improvements on $A U P R C ¯$ are more significant than $A U ( P R C ¯ )$ and $A U P R C w ¯$, which indicates that the DMR-LLDA has a stronger effect on improving the overall accuracy of gene function prediction without respect to label weights. In the comparisons of the S.C and S.C-CC datasets, we find that the values of AP, $A U ( P R C ) ¯$, $A U P R C ¯$, and $A U P R C w ¯$ in the S.C dataset is lower than in the S.C-CC dataset, and the value of one error and HL in the S.C is higher than in the S.C-CC dataset. This is due to the same word space and different label number between these two datasets. The fewer labels of the S.C-CC dataset can promote a higher classifying performance.
Above all, these results indicate that the DMR-LLDA can further improve the accuracy of gene function prediction by introducing the DMR framework into the LLDA model, which optimizes the hyper-parameters of the topic weight. Meanwhile, the DMR-LLDA has an apparent advantage in improving the overall prediction accuracy.

#### 3.5. The Impact on Prior Parameters of Feature Variables

In the DMR-LLDA model, the introduction of gene features is realized by feature weight parameter $β$. Then the operation on topic parameter vector $β t$ and feature vector $y d$ are reflected in Dirichlet hyper parameter $α d$. Table 6 shows the impact of different feature values on prior parameters $α d$.
For the LLDA, the hyper-parameter value is set as a fixed value. However, Table 6 shows that only the different values on mol_wt, theo_pI, hydro, and Cai make a significant difference of hyper-parameter value in the DMR-LLDA, which is also the main way for gene features to impact label allocation.

#### 3.6. The Comparison Results of Inference Algorithms

We designed three kinds of inference algorithm for the DMR-LLDA, including CGS, CVB, and CVB0. This section compares CGS with CVB0 in the S.C dataset. The experimental results are shown in Figure 6. As shown in Figure 6, the overall performance of CVB0 is better than the performance of CGS. Concrete analysis is represented as follows.
For the S.C dataset, CVB0 achieves the best results in AP, $A U P R C ¯$, $A U ( P R C ¯ )$, and $A U P R C w ¯$, and achieves almost similar results in HL. However, CVB0 has a worse value in one error.
For the S.C-CC dataset, CVB0 achieves the best results in AP, one error, $A U P R C ¯$, $A U ( P R C ¯ )$, and $A U P R C w ¯$, and achieves almost similar results in HL. The above results demonstrate the validity of the designed inference algorithms for the DMR-LLDA. Meanwhile, the experimental results indicate that the CVB0 inference algorithm can obtain more precise prediction results by the re-collapse of hidden variable space based on Jensen inequality.
Above all, due to the lack of prior knowledge, the prior distributions of the Bayesian model are usually set for convenience. Meanwhile, the parameters of prior distribution are also set as a fixed value based on experience, which makes the inaccurate estimation of posterior distributions. In our DMR-LLDA model, the gene feature information is introduced into the LLDA as the prior knowledge by the DMR framework. The hyper-parameter of the prior distribution is updated in the inference process rather than by a fixed constant, which can improve the estimation precision of posterior distributions, so as to improve the accuracy of gene function prediction.

## 4. Conclusions

In this paper, we introduce multiple types of features into gene function prediction based on a multi-label surprised topic model, and propose a multi-label supervised topic model conditioned on arbitrary features named the DMR-LLDA. By applying an exponential a priori constructed previously with weighted features on the hyper-parameters of gene-topic (or label) distribution, this model can utilize the observed features of each gene in multi-label topic modeling. Furthermore, three learning algorithms are designed for this model, including CGS, CVB inference, and CVB0 inference. The predictive performance of this model is measured by the AP, one error, Hamming loss, $A U P R C ¯$, $A U ( P R C ¯ )$, $A U P R C w ¯$, Micro-F1, and Macro-F1. Experiments on a standard dataset show that the DMR-LLDA is superior to the LLDA, MLKNN, BPMLL, and SVM models. Meanwhile, experimental results show that the DMR-LLDA can get a much more accurate estimation of posterior distribution, due to using the gene feature information in addition to the amino acid sequence.

## Author Contributions

Conceptualization: L.L. and W.Z.; methodology: L.L.; software: L.L., L.T., and X.J.; validation: L.L. and L.T.; formal analysis: L.L.; writing (original draft preparation): L.L. and L.T.; writing (review and editing): L.T. and X.J.

## Funding

This research was funded by the National Natural Science Foundation of China (grant number 61862067) and the Doctor Science Foundation of Yunnan Normal University (no. 01000205020503090, no. 2016zb009).

## Acknowledgments

We would like to thank the researchers in the State Key Laboratory of Conservation and Utilization of Bio-Resources, Yunnan University (Kunming, China). Their very helpful comments and suggestions have led to an improved version of paper.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

1. Pandey, G.; Kumar, V.; Steinbach, M. Computational Approaches for Gene Function Prediction: A Survey; Department of Computer Science and Engineering, University of Minnesota: Minneapolis, MN, USA, 2006. [Google Scholar]
2. Altschul, S.F.; Gish, W.; Miller, W.; Myers, E.W.; Lipman, D.J. Basic local alignment search tool. J. Mol. Biol. 1990, 215, 403–410. [Google Scholar] [CrossRef]
3. Zacharaki, E.I. Prediction of gene function using a deep convolutional neural network ensemble. PeerJ Comput. Sci. 2017, 3, e124. [Google Scholar] [CrossRef]
4. Ofer, D.; Linial, M. ProFET: Feature engineering captures high-level protein functions. Bioinformatics 2015, 31, 3429–3436. [Google Scholar] [CrossRef] [PubMed][Green Version]
5. Yu, G.; Rangwala, H.; Domeniconi, C.; Zhang, G.; Zhang, Z. Predicting gene function using multiple kernels. IEEE/ACM Trans. Comput. Biol. Bioinform. 2015, 12, 219–233. [Google Scholar] [PubMed]
6. Cao, R.; Cheng, J. Integrated protein function prediction by mining function associations, sequences, and protein-protein and gene-gene interaction networks. Methods 2016, 93, 84–91. [Google Scholar] [CrossRef] [PubMed]
7. Vascon, S.; Frasca, M.; Tripodi, R.; Valentini, G.; Pelillo, M. Protein Function Prediction as a Graph-Transduction Game. Pattern Recogn. Lett. 2018. [Google Scholar] [CrossRef]
8. Radivojac, P.; Clark, W.T.; Oron, T.R.; Schnoes, A.M.; Wittkop, T.; Sokolov, A.; Graim, K.; Funk, C.; Verspoor, K.; Ben-Hur, A.; et al. A large-scale evaluation of computational gene function prediction. Nat. Methods 2013, 10, 221–227. [Google Scholar] [CrossRef] [PubMed]
9. Shehu, A.; Barbará, D.; Molloy, K. A Survey of Computational Methods for Gene Function Prediction. Big Data Analytics in Genomics; Springer International Publishing: New York, NY, USA, 2016; pp. 225–298. [Google Scholar]
10. Lobb, B.; Doxey, A.C. Novel function discovery through sequence and structural data mining. Curr. Opin. Struct. Biol. 2016, 38, 53–61. [Google Scholar] [CrossRef] [PubMed]
11. Njah, H.; Jamoussi, S.; Mahdi, W.; Elati, M. A Bayesian approach to construct Context-Specific Gene Ontology: Application to protein function prediction. In Proceedings of the 2016 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), Chiang Mai, Tailand, 5–7 October 2016. [Google Scholar]
12. Vens, C.; Struyf, J.; Schietgat, L.; Džeroski, S.; Blockeel, H. Decision trees for hierarchical multi-label classification. Mach. Learn. 2008, 73, 185–214. [Google Scholar] [CrossRef][Green Version]
13. Liu, L.; Tang, L.; He, L.; Yao, S.; Zhou, W. Predicting gene function via multi-label supervised topic model on gene ontology. Biotechnol. Biotechnol. Equip. 2017, 31, 1–9. [Google Scholar] [CrossRef]
14. Ramage, D.; Hall, D.; Nallapati, R.; Nallapati, R.; Manning, C. LLDA: A supervised topic model for credit attribution in multi-Lcorpora. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP 2009, Singapore, 6–7 August 2009; pp. 248–256. [Google Scholar]
15. Mimno, D.; Mccallum, A. Topic Models Conditioned on Arbitrary Features with Dirichlet-Multinomial Regression; University of Massachusetts: Amherst, MA, USA, 2012; pp. 411–418. [Google Scholar]
16. La Rosa, M.; Fiannaca, A.; Rizzo, R.; Urso, A. Probabilistic topic modeling for the analysis and classification of genomic sequences. BMC Bioinform. 2015, 16, S2. [Google Scholar] [CrossRef] [PubMed][Green Version]
17. Casella, G.; George, E.I. Explaining the Gibbs Sampler. Am. Stat. 1992, 46, 167–174. [Google Scholar][Green Version]
18. Blei, D.M.; Kucukelbir, A.; Mcauliffe, J.D. Variational Inference: A Review for Statisticians. J. Am. Stat. Assoc. 2018, 112, 859–877. [Google Scholar] [CrossRef]
19. Tai, F.; Lin, H.T. Multilabel Classification with Principal Label Space Transformation. Neural Comput. 2012, 24, 2508. [Google Scholar] [CrossRef] [PubMed]
20. Sun, Y.; Ye, S.; Sun, Y.; Kameda, T. Improved algorithms for exact and approximate Boolean matrix decomposition. In Proceedings of the IEEE International Conference on Data Science and Advanced Analytics (DSAA), Paris, France, 19–21 October 2015; pp. 1–10. [Google Scholar]
21. Yang, Y. Research on Biological Sequence Classification Based on Machine Learning Methods; Shanghai Jiao Tong University: Shanghai, China, 2009. [Google Scholar]
22. Minling, Z.; Zhihua, Z. ML-KNN: A lazy learning approach to multi-label learning. Pattern Recogn. 2007, 40, 2038–2048. [Google Scholar][Green Version]
23. Zhang, M.L.; Zhou, Z.H. Multilabel neural networks with applications to functional genomics and text categorization. IEEE Trans. Knowl. Data Eng. 2006, 18, 1338–1351. [Google Scholar] [CrossRef]
24. Tsoumakas, G.; Katakis, I.; Vlahavas, I. Mining multi-label data. Data Mining and Knowledge Discovery Handbook; Springer: New York, NY, USA, 2009; pp. 667–685. [Google Scholar]
25. Fan, R.E.; Chang, K.W.; Hsieh, C.J.; Wang, X.R.; Lin, C.J. LIBLINEAR: A Library for Large Linear Classification. J. Mach. Learn. Res. 2008, 9, 1871–1874. [Google Scholar]
Figure 1. The relationship between protein function prediction and text topic modeling. IP, CP, TS, MS and so on, represent ‘words’, each of which is composed by two amino acid alphabets. Each GO term is started by ‘GO:’.
Figure 1. The relationship between protein function prediction and text topic modeling. IP, CP, TS, MS and so on, represent ‘words’, each of which is composed by two amino acid alphabets. Each GO term is started by ‘GO:’.
Figure 2. An overview of the topic modeling process.
Figure 2. An overview of the topic modeling process.
Figure 3. The graphic model of Dirichlet multinomial regression latent Dirichlet allocation (DMR-LLDA).
Figure 3. The graphic model of Dirichlet multinomial regression latent Dirichlet allocation (DMR-LLDA).
Figure 4. The comparisons between the Human1 and Human2 datasets. Define terms if necessary.
Figure 4. The comparisons between the Human1 and Human2 datasets. Define terms if necessary.
Figure 5. The comparisons between DMR-LLDA, LLDA, back propagation for multi-label learning (BPMLL), support vector machines (SVMs), and multi-label k-nearest neighbor (MLKNN) in two datasets. The red asterisk represents the best results in each dataset.
Figure 5. The comparisons between DMR-LLDA, LLDA, back propagation for multi-label learning (BPMLL), support vector machines (SVMs), and multi-label k-nearest neighbor (MLKNN) in two datasets. The red asterisk represents the best results in each dataset.
Figure 6. The comparison results with CVB0 and CGS. The red asterisk represents the best results in each dataset.
Figure 6. The comparison results with CVB0 and CGS. The red asterisk represents the best results in each dataset.
Table 1. Collapsed variable Bayesian (CVB) algorithm of DMR-LLDA.
Table 1. Collapsed variable Bayesian (CVB) algorithm of DMR-LLDA.
 CVB algorithm of DMR-LLDA 1 Initialize global variational parameters 2 While the number of iterations $r < r max$ or $F$ is not converged do 3 For $d = 1 : D$ do 4 Initialize local variational parameters to constant 5 Repeat (the local variational inference of gene $d$) 6 $η d w t ( r ) ∝ ( Λ d t α d t + μ N d t ( r − 1 ) ) ( λ w + μ N t w ( r − 1 ) ) ( ∑ w = 1 W λ w + μ N t ( r − 1 ) ) e − ( σ N d t ( r − 1 ) ) 2 2 ( α t + μ N d t ( r − 1 ) ) 2 e − ( σ N t w ( r − 1 ) ) 2 2 ( λ w + μ N t w ( r − 1 ) ) 2 e − ( σ N t ( r − 1 ) ) 2 2 ( ∑ w = 1 W λ w + μ N t ( r − 1 ) ) 2$ 7 Update $μ N d t ( r )$ and $σ N d t ( r )$ by Equations (29)~(30) 8 $α d t ( r ) = exp ( y ^ d β ^ t ( r − 1 ) )$ 9 Until $γ d t ( r )$ is converged: $( 1 / N d ) ∑ t = 1 T | γ d t ( r ) − γ d t ( r − 1 ) | < 0.00001$ 10 End For 11 $μ N t w ( r )$, $σ N t w ( r )$, $μ N t ( r )$ and $σ N t ( r )$ by Equations (31)~(34) 12 Update $β t f ( r )$ by Equation (21) 13 End while
Table 2. Zero-order variational Bayesian (CVB0) algorithm of DMR-LLDA.
Table 2. Zero-order variational Bayesian (CVB0) algorithm of DMR-LLDA.
 CVB0 algorithm of DMR-LLDA 1 Initialize global variational parameters 2 While the number of iterations $r < r max$ or $F$ is not converged do 3 For $d ∈ D$ do 4 Initialize local variational parameters to constant 5 Repeat: (the local variational inference of gene $d$) 6 $η d w t ( r ) ∝ ( α d t Λ d t + γ d t ( r − 1 ) ) λ w + μ t w ( r − 1 ) ∑ w = 1 W λ w + μ t ( r − 1 )$ 7 $γ d t ( r ) = ∑ w = 1 W ( N d w − 1 ) η d w t ( r )$ 8 $α d t ( r ) = exp ( y ^ d β ^ t ( r − 1 ) )$ 9 Until $γ d t ( r )$ is converged: $( 1 / N d ) ∑ t = 1 T | γ d t ( r ) − γ d t ( r − 1 ) | < 0.00001$ 10 End For 11 $μ t w ( r ) = ∑ d = 1 D ( N d w − 1 ) η d w t ( r )$, $μ t ( r ) = ∑ d = 1 D ∑ w = 1 W ( N d w − 1 ) η d w t ( r )$ 12 Update $β t f ( r )$ by Equation (21) 13 End while
Table 3. The statistics of the S.cerevisiae (S.C) and S.cerevisiae-cellular component (S.C-CC) datasets.
Table 3. The statistics of the S.cerevisiae (S.C) and S.cerevisiae-cellular component (S.C-CC) datasets.
Dataset$D$$W$$F$$L$
S.C169240041331538
S.C-CC547319
Table 4. The statistics of extra features in the S.C dataset.
Table 4. The statistics of extra features in the S.C dataset.
Feature NameNotationType
molecular weightmol_wtInteger
isoelectric pointtheo_pIReal numbers
average coefficients of hydrophilichydroReal numbers
number of exonspositionInteger
number of motifsmotifsInteger
ORF number of chromosomeschromosomeInteger
Table 5. The statistic of two human datasets.
Table 5. The statistic of two human datasets.
Dataset$D$$W$$L$
Human1496252971477
Human2400
Table 6. The impact on prior parameters of feature variables.
Table 6. The impact on prior parameters of feature variables.
 $α d$ The words under topic when mol_wt = 49629.3, theo_pI = 8.96, hydro = 0.1, position = 1, Cai = 0.17, motifs = 2, chromosome = 16 1.88 GM IH LH VH LK IG GC IC AK VM FG AM LW IK VG VW FC IG FH GK 1.32 LM ST SM LT KM LL IM KL LF SL EM LP DM IT LK EF KT LE SK SP 0.79 GH VC AC KC GC AL GM LH AH AF AM VW AW GW EC KH TH GF AT GT 0.64 IL VG GE FM YK QW YM VW GP TL KT LW RP LQ IR FH NW NX FS PM 0.23 TT SV TV ST SW SQ TQ PT PV IV SP TM CT QT AV TP TC SC VV NV $α d$ The words under topic when mol_wt = 85873.7, theo_pI = 9.74, hydro=0.664 position = 1, Cai = 0.1, motifs = 2, chromosome = 16 4.23 KR TF KE QS LW EW DM YF QT SM LX SF IN QW LR VL VS QG MC QC 3.77 LM SM LS RC DW EM LE QT LV EW FM QI RM NE DT IE FT AR QC GP 0.23 QM KR AP EF LF QR HP EC RE RF DS VE EW KF FE LT TL QV QC AR 0.11 CF PI ED QY GQ HN RI HD HI SN YQ TQ PW RH YL PQ PN SI QE RS 0.09 SW VF NW AC DF TW EQ LW EH MC DM AW PS GV VQ AQ ID TG RF VE

## Share and Cite

MDPI and ACS Style

Liu, L.; Tang, L.; Jin, X.; Zhou, W. A Multi-Label Supervised Topic Model Conditioned on Arbitrary Features for Gene Function Prediction. Genes 2019, 10, 57. https://doi.org/10.3390/genes10010057

AMA Style

Liu L, Tang L, Jin X, Zhou W. A Multi-Label Supervised Topic Model Conditioned on Arbitrary Features for Gene Function Prediction. Genes. 2019; 10(1):57. https://doi.org/10.3390/genes10010057

Chicago/Turabian Style

Liu, Lin, Lin Tang, Xin Jin, and Wei Zhou. 2019. "A Multi-Label Supervised Topic Model Conditioned on Arbitrary Features for Gene Function Prediction" Genes 10, no. 1: 57. https://doi.org/10.3390/genes10010057

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.
{"ft_lang_label":"__label__en","ft_lang_prob":0.88406456,"math_prob":0.9930473,"size":12292,"snap":"2023-14-2023-23","text_gpt3_token_len":2949,"char_repetition_ratio":0.14933269,"word_repetition_ratio":0.098507464,"special_character_ratio":0.23112594,"punctuation_ratio":0.16845451,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99907607,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-06-10T18:31:40Z\",\"WARC-Record-ID\":\"<urn:uuid:85050dc9-0061-42e6-8332-dc7d39146339>\",\"Content-Length\":\"449642\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7d5316f0-25c2-4212-90a4-f726728cd16d>\",\"WARC-Concurrent-To\":\"<urn:uuid:0d9381a4-a2da-487b-b1e6-f08d1d71eb9a>\",\"WARC-IP-Address\":\"104.18.25.151\",\"WARC-Target-URI\":\"https://www.mdpi.com/2073-4425/10/1/57\",\"WARC-Payload-Digest\":\"sha1:XK7MY5DTUNTLR62RGKJSYVDV4A7HURZQ\",\"WARC-Block-Digest\":\"sha1:L3ZBMM3OZYCMXBIPPERN2FAPVPYB27O5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224657735.85_warc_CC-MAIN-20230610164417-20230610194417-00178.warc.gz\"}"}