Jie Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jie Liu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Bo Yang
Jilin University
4 shared publications Dayou Liu
College of Computer Science and Technology, Jilin University, Changchun, China
3 shared publications- Dayou Liu
Jilin University
3 shared publications - Di Jin
College of Computer Science and Technology Jilin University Changchun 130012 China
3 shared publications - Dongxiao He
College of Computer Science and Technology Jilin University Changchun 130012 China
3 shared publications Yan Li
College of Computer Science and Technology, Jilin University, Changchun, China
2 shared publications
Latest Publications
- 27 July 2024
- Published by Springer Nature
- p. 3-15
Knowledge Enhanced Zero-Shot Visual Relationship Detection
- 27 July 2024
- Published by Springer Nature
- p. 3-15
Knowledge Enhanced Zero-Shot Visual Relationship Detection
- 6 November 2020
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 12 (10) , 9181-9192
Differential analysis of gene regulatory networks modeled with structural equation models
- 6 November 2020
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 12 (10) , 9181-9192
Differential analysis of gene regulatory networks modeled with structural equation models
- 1 January 2020
- Published by Tech Science Press in Computer Modeling in Engineering & Sciences
- Vol. 124 (1) , 303-313
A Re-Parametrization-Based Bayesian Differential Analysis Algorithm for Gene Regulatory Networks Modeled with Structural Equation Models
Under different conditions, gene regulatory networks (GRNs) of the same gene set could be similar but different. The differential analysis of GRNs under different conditions is important for understanding condition-specific gene regulatory relationships. In a naive approach, existing GRN inference algorithms can be used to separately estimate two GRNs under different conditions and identify the differences between them. However, in this way, the similarities between the pairwise GRNs are not taken into account. Several joint differential analysis algorithms have been proposed recently, which were proved to outperform the naive approach apparently. In this paper, we model the GRNs under different conditions with structural equation models (SEMs) to integrate gene expression data and genetic perturbations, and re-parameterize the pairwise SEMs to form an integrated model that incorporates the differential structure. Then, a Bayesian inference method is used to make joint differential analysis by solving the integrated model. We evaluated the performance of the proposed re-parametrization-based Bayesian differential analysis (ReBDA) algorithm by running simulations on synthetic data with different settings. The performance of the ReBDA algorithm was demonstrated better than another state-of-the-art joint differential analysis algorithm for SEMs ReDNet obviously. In the end, the ReBDA algorithm was applied to make differential analysis on a real human lung gene data set to illustrate its applicability and practicability.
- 1 January 2020
- Published by Tech Science Press in Computer Modeling in Engineering & Sciences
- Vol. 124 (1) , 303-313
A Re-Parametrization-Based Bayesian Differential Analysis Algorithm for Gene Regulatory Networks Modeled with Structural Equation Models
Under different conditions, gene regulatory networks (GRNs) of the same gene set could be similar but different. The differential analysis of GRNs under different conditions is important for understanding condition-specific gene regulatory relationships. In a naive approach, existing GRN inference algorithms can be used to separately estimate two GRNs under different conditions and identify the differences between them. However, in this way, the similarities between the pairwise GRNs are not taken into account. Several joint differential analysis algorithms have been proposed recently, which were proved to outperform the naive approach apparently. In this paper, we model the GRNs under different conditions with structural equation models (SEMs) to integrate gene expression data and genetic perturbations, and re-parameterize the pairwise SEMs to form an integrated model that incorporates the differential structure. Then, a Bayesian inference method is used to make joint differential analysis by solving the integrated model. We evaluated the performance of the proposed re-parametrization-based Bayesian differential analysis (ReBDA) algorithm by running simulations on synthetic data with different settings. The performance of the ReBDA algorithm was demonstrated better than another state-of-the-art joint differential analysis algorithm for SEMs ReDNet obviously. In the end, the ReBDA algorithm was applied to make differential analysis on a real human lung gene data set to illustrate its applicability and practicability.
- Open Access
- 14 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 34153-34161
Second-Order Markov Assumption Based Bayes Classifier for Networked Data With Heterophily
The classification of networked data is an interesting and challenging problem. Most traditional relational classifiers that are based on the principle of homophily have an unsatisfactory classification performance in networks with heterophily. This is because these methods treat inhomogeneous networks homogeneously. A progression of a network-only Bayes classifier based secondorder Markov assumption is proposed for heterophilous networks in this paper to address this problem. First, we estimate the class distribution of an unlabeled node according to the class distribution of its neighbors’ neighbors. In this process, we perform this computation on the known and unknown neighbors separately. Second, we combine the two parts using multinomial naïve Bayesian classification. Meanwhile, we pair a relaxation labeling collective inference method (which imports simulated annealing) with this new method to update the class distributions at each iteration. Comparisons of experimental results demonstrate that the proposed method performs better when the networks are heterophilous.
- 14 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 34153-34161
Open AccessSecond-Order Markov Assumption Based Bayes Classifier for Networked Data With Heterophily
The classification of networked data is an interesting and challenging problem. Most traditional relational classifiers that are based on the principle of homophily have an unsatisfactory classification performance in networks with heterophily. This is because these methods treat inhomogeneous networks homogeneously. A progression of a network-only Bayes classifier based secondorder Markov assumption is proposed for heterophilous networks in this paper to address this problem. First, we estimate the class distribution of an unlabeled node according to the class distribution of its neighbors’ neighbors. In this process, we perform this computation on the known and unknown neighbors separately. Second, we combine the two parts using multinomial naïve Bayesian classification. Meanwhile, we pair a relaxation labeling collective inference method (which imports simulated annealing) with this new method to update the class distributions at each iteration. Comparisons of experimental results demonstrate that the proposed method performs better when the networks are heterophilous.
- 7 October 2018
- Published by Springer Nature
- p. 70-81
A Pests Image Classification Method Based on Improved Wolf Pack Algorithm to Optimize Bayesian Network Structure Learning
- 7 October 2018
- Published by Springer Nature
- p. 70-81
A Pests Image Classification Method Based on Improved Wolf Pack Algorithm to Optimize Bayesian Network Structure Learning
- Open Access
Fast Complex Network Clustering Algorithm Using Agents
Recently, the sizes of networks are always very huge, and they take on distributed nature. Aiming at this kind of network clustering problem, in the sight of local view, this paper proposes a fast network clustering algorithm in which each node is regarded as an agent, and each agent tries to maximize its local function in order to optimize network modularity defined by function Q, rather than optimize function Q from the global view as traditional methods. Both the efficiency and effectiveness of this algorithm are tested against computer-generated and real-world networks. Experimental result shows that this algorithm not only has the ability of clustering large-scale networks, but also can attain very good clustering quality compared with the existing algorithms. Furthermore, the parameters of this algorithm are analyzed.
Open AccessFast Complex Network Clustering Algorithm Using Agents
Recently, the sizes of networks are always very huge, and they take on distributed nature. Aiming at this kind of network clustering problem, in the sight of local view, this paper proposes a fast network clustering algorithm in which each node is regarded as an agent, and each agent tries to maximize its local function in order to optimize network modularity defined by function Q, rather than optimize function Q from the global view as traditional methods. Both the efficiency and effectiveness of this algorithm are tested against computer-generated and real-world networks. Experimental result shows that this algorithm not only has the ability of clustering large-scale networks, but also can attain very good clustering quality compared with the existing algorithms. Furthermore, the parameters of this algorithm are analyzed.
- Open Access
Ant Colony Optimization with a New Random Walk Model for Community Detection in Complex Networks
Detecting communities from complex networks has recently triggered great interest. Aiming at this problem, a new ant colony optimization strategy building on the Markov random walks theory, which is named as MACO, is proposed in this paper. The framework of ant colony optimization is taken as the basic framework in this algorithm. In each iteration, a Markov random walk model is employed as heuristic rule; all of the ants local solutions are aggregated to a global one through an idea of clustering ensemble, which then will be used to update a pheromone matrix. The strategy relies on the progressive strengthening of within-community links and the weakening of between-community links. Gradually this converges to a solution where the underlying community structure of the complex network will become clearly visible. The proposed MACO has been evaluated both on synthetic benchmarks and on some real-world networks, and compared with some present competing algorithms. Experimental result has shown that MACO is highly effective for discovering communities.
Open AccessAnt Colony Optimization with a New Random Walk Model for Community Detection in Complex Networks
Detecting communities from complex networks has recently triggered great interest. Aiming at this problem, a new ant colony optimization strategy building on the Markov random walks theory, which is named as MACO, is proposed in this paper. The framework of ant colony optimization is taken as the basic framework in this algorithm. In each iteration, a Markov random walk model is employed as heuristic rule; all of the ants local solutions are aggregated to a global one through an idea of clustering ensemble, which then will be used to update a pheromone matrix. The strategy relies on the progressive strengthening of within-community links and the weakening of between-community links. Gradually this converges to a solution where the underlying community structure of the complex network will become clearly visible. The proposed MACO has been evaluated both on synthetic benchmarks and on some real-world networks, and compared with some present competing algorithms. Experimental result has shown that MACO is highly effective for discovering communities.
- Open Access
Markov random walk under constraint for discovering overlapping communities in complex networks
Detection of overlapping communities in complex networks has motivated recent research in the relevant fields. Aiming this problem, we propose a Markov dynamics based algorithm, called UEOC, which means, 'unfold and extract overlapping communities'. In UEOC, when identifying each natural community that overlaps, a Markov random walk method combined with a constraint strategy, which is based on the corresponding annealed network (degree conserving random network), is performed to unfold the community. Then, a cutoff criterion with the aid of a local community function, called conductance, which can be thought of as the ratio between the number of edges inside the community and those leaving it, is presented to extract this emerged community from the entire network. The UEOC algorithm depends on only one parameter whose value can be easily set, and it requires no prior knowledge on the hidden community structures. The proposed UEOC has been evaluated both on synthetic benchmarks and on some real-world networks, and was compared with a set of competing algorithms. Experimental result has shown that UEOC is highly effective and efficient for discovering overlapping communities.
Open AccessMarkov random walk under constraint for discovering overlapping communities in complex networks
Detection of overlapping communities in complex networks has motivated recent research in the relevant fields. Aiming this problem, we propose a Markov dynamics based algorithm, called UEOC, which means, 'unfold and extract overlapping communities'. In UEOC, when identifying each natural community that overlaps, a Markov random walk method combined with a constraint strategy, which is based on the corresponding annealed network (degree conserving random network), is performed to unfold the community. Then, a cutoff criterion with the aid of a local community function, called conductance, which can be thought of as the ratio between the number of edges inside the community and those leaving it, is presented to extract this emerged community from the entire network. The UEOC algorithm depends on only one parameter whose value can be easily set, and it requires no prior knowledge on the hidden community structures. The proposed UEOC has been evaluated both on synthetic benchmarks and on some real-world networks, and was compared with a set of competing algorithms. Experimental result has shown that UEOC is highly effective and efficient for discovering overlapping communities.
- Open Access
An Ant-Based Algorithm with Local Optimization for Community Detection in Large-Scale Networks
In this paper, we propose a multi-layer ant-based algorithm MABA, which detects communities from networks by means of locally optimizing modularity using individual ants. The basic version of MABA, namely SABA, combines a self-avoiding label propagation technique with a simulated annealing strategy for ant diffusion in networks. Once the communities are found by SABA, this method can be reapplied to a higher level network where each obtained community is regarded as a new vertex. The aforementioned process is repeated iteratively, and this corresponds to MABA. Thanks to the intrinsic multi-level nature of our algorithm, it possesses the potential ability to unfold multi-scale hierarchical structures. Furthermore, MABA has the ability that mitigates the resolution limit of modularity. The proposed MABA has been evaluated on both computer-generated benchmarks and widely used real-world networks, and has been compared with a set of competitive algorithms. Experimental results demonstrate that MABA is both effective and efficient (in near linear time with respect to the size of network) for discovering communities.
Open AccessAn Ant-Based Algorithm with Local Optimization for Community Detection in Large-Scale Networks
In this paper, we propose a multi-layer ant-based algorithm MABA, which detects communities from networks by means of locally optimizing modularity using individual ants. The basic version of MABA, namely SABA, combines a self-avoiding label propagation technique with a simulated annealing strategy for ant diffusion in networks. Once the communities are found by SABA, this method can be reapplied to a higher level network where each obtained community is regarded as a new vertex. The aforementioned process is repeated iteratively, and this corresponds to MABA. Thanks to the intrinsic multi-level nature of our algorithm, it possesses the potential ability to unfold multi-scale hierarchical structures. Furthermore, MABA has the ability that mitigates the resolution limit of modularity. The proposed MABA has been evaluated on both computer-generated benchmarks and widely used real-world networks, and has been compared with a set of competitive algorithms. Experimental results demonstrate that MABA is both effective and efficient (in near linear time with respect to the size of network) for discovering communities.
- 24 December 2011
- Published by Springer Nature in Journal of Medical Systems
- Vol. 36 (5) , 3243-3254
Design of an Enhanced Fuzzy k-nearest Neighbor Classifier Based Computer Aided Diagnostic System for Thyroid Disease
In this paper, we present an enhanced fuzzy k-nearest neighbor (FKNN) classifier based computer aided diagnostic (CAD) system for thyroid disease. The neighborhood size k and the fuzzy strength parameter m in FKNN classifier are adaptively specified by the particle swarm optimization (PSO) approach. The adaptive control parameters including time-varying acceleration coefficients (TVAC) and time-varying inertia weight (TVIW) are employed to efficiently control the local and global search ability of PSO algorithm. In addition, we have validated the effectiveness of the principle component analysis (PCA) in constructing a more discriminative subspace for classification. The effectiveness of the resultant CAD system, termed as PCA-PSO-FKNN, has been rigorously evaluated against the thyroid disease dataset, which is commonly used among researchers who use machine learning methods for thyroid disease diagnosis. Compared to the existing methods in previous studies, the proposed system has achieved the highest classification accuracy reported so far via 10-fold cross-validation (CV) analysis, with the mean accuracy of 98.82% and with the maximum accuracy of 99.09%. Promisingly, the proposed CAD system might serve as a new candidate of powerful tools for diagnosing thyroid disease with excellent performance.
- 24 December 2011
- Published by Springer Nature in Journal of Medical Systems
- Vol. 36 (5) , 3243-3254
Design of an Enhanced Fuzzy k-nearest Neighbor Classifier Based Computer Aided Diagnostic System for Thyroid Disease
In this paper, we present an enhanced fuzzy k-nearest neighbor (FKNN) classifier based computer aided diagnostic (CAD) system for thyroid disease. The neighborhood size k and the fuzzy strength parameter m in FKNN classifier are adaptively specified by the particle swarm optimization (PSO) approach. The adaptive control parameters including time-varying acceleration coefficients (TVAC) and time-varying inertia weight (TVIW) are employed to efficiently control the local and global search ability of PSO algorithm. In addition, we have validated the effectiveness of the principle component analysis (PCA) in constructing a more discriminative subspace for classification. The effectiveness of the resultant CAD system, termed as PCA-PSO-FKNN, has been rigorously evaluated against the thyroid disease dataset, which is commonly used among researchers who use machine learning methods for thyroid disease diagnosis. Compared to the existing methods in previous studies, the proposed system has achieved the highest classification accuracy reported so far via 10-fold cross-validation (CV) analysis, with the mean accuracy of 98.82% and with the maximum accuracy of 99.09%. Promisingly, the proposed CAD system might serve as a new candidate of powerful tools for diagnosing thyroid disease with excellent performance.