-
Article
I/O Efficient Early Bursting Cohesive Subgraph Discovery in Massive Temporal Networks
Temporal networks are an effective way to encode temporal information into graph data losslessly. Finding the bursting cohesive subgraph (BCS), which accumulates its cohesiveness at the fastest rate, is an imp...
-
Chapter and Conference Paper
An Incremental Updating Based Fast Phenotype Structure Learning Algorithm
Unsupervised phenotype structure learning is important in microarray data analysis. The goal is to (1) find groups of samples corresponding to different phenotypes (e.g. disease or normal), and (2) find a subs...
-
Article
A Novel Approach to Revealing Positive and Negative Co-Regulated Genes
As explored by biologists, there is a real and emerging need to identify co-regulated gene clusters, which include both positive and negative regulated gene clusters. However, the existing pattern-based and te...