Caiyan Dai

Orcid: 0000-0003-3562-3905

According to our database1, Caiyan Dai authored at least 20 papers between 2011 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Identifying multiple influence sources in social networks based on latent space mapping.
Inf. Sci., July, 2023

A parameter adaptive tuning algorithm for medical image recognition model testing.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2023

2022
Minimizing the Spread of Negative Influence in SNIR Model by Contact Blocking.
Entropy, 2022

Research on Question Answering of Lung Cancer Based on Knowledge Graph.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2022

2021
A random walk-based method for detecting essential proteins by integrating the topological and biological features of PPI network.
Soft Comput., 2021

Influence Maximization in Signed Networks by Enhancing the Negative Influence.
IEEE Access, 2021

Network pharmacological mechanism of Prunella vulgaris on thyroid tumors.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2021

2020
Identifying essential proteins in dynamic protein networks based on an improved h-index algorithm.
BMC Medical Informatics Decis. Mak., 2020

2018
基于模块度增量的二分网络社区挖掘算法 (Algorithm for Mining Bipartite Network Based on Incremental Modularity).
计算机科学, 2018

Cost-Aware Scheduling of Computation-Intensive Tasks on Multi-Core Server.
KSII Trans. Internet Inf. Syst., 2018

2017
Link prediction in complex network based on modularity.
Soft Comput., 2017

基于广义后缀树的二分网络社区挖掘算法 (Detecting Community from Bipartite Network Based on Generalized Suffix Tree).
计算机科学, 2017

Link prediction in multi-relational networks based on relational similarity.
Inf. Sci., 2017

Link prediction based on sampling in complex networks.
Appl. Intell., 2017

Network link prediction based on direct optimization of area under curve.
Appl. Intell., 2017

2016
An algorithm for mining frequent closed itemsets with density from data streams.
Int. J. Comput. Sci. Eng., 2016

2015
Using Suffix Tree to Detect Communities from Bipartite Network.
Proceedings of the Third International Conference on Advanced Cloud and Big Data, 2015

2012
A Novel Strategy for Mining Frequent Closed Itemsets in Data Streams.
J. Comput., 2012

An Efficient Algorithm for top-k Queries on Uncertain Data Streams.
Proceedings of the 11th International Conference on Machine Learning and Applications, 2012

2011
An Efficient Mining Algorithm by Bit Vector Table for Frequent Closed Itemsets.
J. Softw., 2011


  Loading...