Xiaohui Lin

Orcid: 0000-0002-7358-6706

Affiliations:
  • Dalian University of Technology, School of Computer Science and Technology, China (PhD 2005)


According to our database1, Xiaohui Lin authored at least 54 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Analyzing omics data based on sample network.
J. Bioinform. Comput. Biol., February, 2024

2023
Identifying the potential miRNA biomarkers based on multi-view networks and reinforcement learning for diseases.
Briefings Bioinform., November, 2023

Analyzing omics data by feature combinations based on kernel functions.
J. Bioinform. Comput. Biol., October, 2023

An omics data analysis method based on feature linear relationship and graph convolutional network.
J. Biomed. Informatics, September, 2023

DA-SRN: Omics data analysis based on the sample network optimization for complex diseases.
Comput. Biol. Medicine, September, 2023

Dynamic Network Construction for Identifying Early Warning Signals Based On a Data-Driven Approach: Early Diagnosis Biomarker Discovery for Gastric Cancer.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Defining disease-related modules based on weighted miRNA synergistic network.
Comput. Biol. Medicine, 2023

2022
A Novel Method for Constructing Classification Models by Combining Different Biomarker Patterns.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

A new feature selection method based on feature distinguishing ability and network influence.
J. Biomed. Informatics, 2022

2020
A new feature selection algorithm based on relevance, redundancy and complementarity.
Comput. Biol. Medicine, 2020

2019
The Robust Classification Model Based on Combinatorial Features.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019

A new data analysis method based on feature linear combination.
J. Biomed. Informatics, 2019

A new feature selection method based on symmetrical uncertainty and interaction gain.
Comput. Biol. Chem., 2019

2017
Topology Identification and Module-Phase Synchronization of Neural Network With Time Delay.
IEEE Trans. Syst. Man Cybern. Syst., 2017

2016
Synchronization of complex-valued neural network with sliding mode control.
J. Frankl. Inst., 2016

The feature selection algorithm based on feature overlapping and group overlapping.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016

Biomedical event extraction via Long Short Term Memory networks along dynamic extended tree.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016

2015
Synchronization of Asynchronous Switched Boolean Network.
IEEE ACM Trans. Comput. Biol. Bioinform., 2015

A Feature Selection Method Based on Feature Grouping and Genetic Algorithm.
Proceedings of the Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques, 2015

Ensemble unsupervised feature selection based on permutation and R-value.
Proceedings of the 12th International Conference on Fuzzy Systems and Knowledge Discovery, 2015

2014
Synchronization of Boolean Networks with Different Update Schemes.
IEEE ACM Trans. Comput. Biol. Bioinform., 2014

Module-phase synchronization in hyperchaotic complex Lorenz system after modified complex projection.
Appl. Math. Comput., 2014

A novel ensemble classifier based on multiple diverse classification methods.
Proceedings of the 11th International Conference on Fuzzy Systems and Knowledge Discovery, 2014

2013
L(2, 1)-labeling of flower snark and related graphs.
Ars Comb., 2013

Prime labeling on Knödel graphs W<sub>3, n</sub>.
Ars Comb., 2013

2012
The crossing numbers of K<sub>m</sub> × P<sub>n</sub> and K<sub>m</sub> × C<sub>n</sub>
CoRR, 2012

The crossing numbers of K<sub>n,n</sub> - nK<sub>2</sub>, K<sub>n</sub> × P<sub>2</sub>, K<sub>n</sub> × P<sub>3</sub> and K<sub>n</sub> × C<sub>4</sub>
CoRR, 2012

Prime Cordial labeling of Flower Snark and related graphs.
Ars Comb., 2012

A learning method of Bayesian network structure.
Proceedings of the 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012

2011
The Crossing Numbers of Cartesian Product of Cone Graph C<sub>m</sub> + K<sub>l</sub> with Path P<sub>n</sub>.
Ars Comb., 2011

A lower bound for 2-rainbow domination number of generalized Petersen graphs P(n, 3).
Ars Comb., 2011

2010
Recursive Feature Selection Based on Minimum Redundancy Maximum Relevancy.
Proceedings of the Third International Symposium on Parallel Architectures, 2010

2009
2-rainbow domination of generalized Petersen graphs P(n, 2).
Discret. Appl. Math., 2009

Equitable total coloring of C<sub>m</sub>C<sub>n</sub>.
Discret. Appl. Math., 2009

The crossing numbers of generalized Petersen graphs with small order.
Discret. Appl. Math., 2009

On the Crossing Numbers of the k-th Power of P<sub>n</sub>.
Ars Comb., 2009

(d, 1)-Total labellings of regular nonbipartite graphs and an application to flower snarks.
Ars Comb., 2009

2008
The crossing number of K<sub>2, m</sub>P<sub>n</sub>.
Discret. Math., 2008

The planar Ramsey number <i>I</i>.
Discret. Math., 2008

On the crossing numbers of K<sub>m</sub>square C<sub>n</sub> and K<sub>m, l</sub>square P<sub>n</sub>.
Discret. Appl. Math., 2008

The crossing number of flower snarks and related graphs.
Ars Comb., 2008

Sand grains tracking in dense grain image sequences.
Proceedings of 8th IEEE International Conference on Computer and Information Technology, 2008

2007
On the Crossing Number of <i>K</i> <sub> <i>m</i> </sub> <i>P</i> <sub> <i>n</i> </sub>.
Graphs Comb., 2007

The planar Ramsey number PR(K<sub>4</sub>-e, K<sub>5</sub>).
Discret. Math., 2007

On the Three Color Ramsey Numbers R(Cm, C4, C4).
Ars Comb., 2007

On Multicolor Ramsey Numbers for Even Cycles in Graphs.
Ars Comb., 2007

2006
The face pair of planar graphs.
Discret. Math., 2006

2005
Some 3-connected 4-edge-critical non-Hamiltonian graphs.
J. Graph Theory, 2005

The Crossing Number of <i>C</i>(<i>mk</i>;{1, <i>k</i>}).
Graphs Comb., 2005

The Graphs C(t)5 are Graceful for t = 0, 3 (mod 4).
Ars Comb., 2005

2004
The crossing number of <i>C</i>(<i>n</i>; 1, 3 ).
Discret. Math., 2004

2003
4-regular graphs without cut-vertices having the same path layer matrix.
J. Graph Theory, 2003

1997
On distinct distance sets in a graph.
Discret. Math., 1997

On Smallest Maximally Nonhamiltonian Graphs.
Ars Comb., 1997


  Loading...