CCChen Chen

Chen Chen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Chen Chen has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • VariFunNet, an integrated multiscale modeling framework to study the effects of rare non-coding variants in genome-wide association studies: Applied to Alzheimer's disease

    by Qiao Liu, Chen Chen, Annie Gao, Hang Hang Tong, Lei Xie

    It is a grand challenge to reveal the causal effects of DNA variants in complex phenotypes. Although statistical techniques can establish correlations between genotypes and phenotypes in Genome-Wide Association Studies (GWAS), they often fail when the variant is rare. The emerging Network-based Association Studies aim to address this shortcoming in statistical analysis, but are mainly applied to coding variations. Increasing evidences suggest that non-coding variants play critical roles in the etiology of complex diseases. However, few computational tools are available to study the effect of rare non-coding variants on phenotypes. Here we have developed a multiscale modeling variant-to-function-to-network framework VariFunNet to address these challenges. VariFunNet first predict the functional variations of molecular interactions, which result from the non-coding variants. Then we incorporate the genes associated with the functional variation into a tissue-specific gene network, and identify subnetworks that transmit the functional variation to molecular phenotypes. Finally, we quantify the functional implication of the subnetwork, and prioritize the association of the non-coding variants with the phenotype. We have applied VariFunNet to investigating the causal effect of rare non-coding variants on Alzheimer's disease (AD). Among top 21 ranked causal non-coding variants, 16 of them are directly supported by existing evidences. The remaining 5 novel variants dysregulate multiple downstream biological processes, all of which are associated with the pathology of AD. Furthermore, we propose potential new drug targets that may modulate diverse pathways responsible for AD. These findings may shed new light on discovering new biomarkers and therapies for the prevention, diagnosis, and treatment of AD. Our results suggest that multiscale modeling is a potentially powerful approach to studying causal genotype-phenotype associations.


  • Open Access

    Cross-Dependency Inference in Multi-Layered Networks

    by Chen Chen, Hanghang Tong, Lei Xie, Lei Ying, Qing He

    The increasingly connected world has catalyzed the fusion of networks from different domains, which facilitates the emergence of a new network model—multi-layered networks. Examples of such kind of network systems include critical infrastructure networks, biological systems, organization-level collaborations, cross-platform e-commerce, and so forth. One crucial structure that distances multi-layered network from other network models is its cross-layer dependency, which describes the associations between the nodes from different layers. Needless to say, the cross-layer dependency in the network plays an essential role in many data mining applications like system robustness analysis and complex network control. However, it remains a daunting task to know the exact dependency relationships due to noise, limited accessibility, and so forth. In this article, we tackle the cross-layer dependency inference problem by modeling it as a collective collaborative filtering problem. Based on this idea, we propose an effective algorithm Fascinate that can reveal unobserved dependencies with linear complexity. Moreover, we derive Fascinate-ZERO, an online variant of Fascinate that can respond to a newly added node timely by checking its neighborhood dependencies. We perform extensive evaluations on real datasets to substantiate the superiority of our proposed approaches.


  • Open Access

    Towards Optimal Connectivity on Multi-Layered Networks

    by Chen Chen, Jingrui He, Nadya Bliss, Hanghang Tong

    Networks are prevalent in many high impact domains. Moreover, cross-domain interactions are frequently observed in many applications, which naturally form the dependencies between different networks. Such kind of highly coupled network systems are referred to as multi-layered networks, and have been used to characterize various complex systems, including critical infrastructure networks, cyber-physical systems, collaboration platforms, biological systems, and many more. Different from single-layered networks where the functionality of their nodes is mainly affected by within-layer connections, multi-layered networks are more vulnerable to disturbance as the impact can be amplified through cross-layer dependencies, leading to the cascade failure to the entire system. To manipulate the connectivity in multi-layered networks, some recent methods have been proposed based on two-layered networks with specific types of connectivity measures. In this paper, we address the above challenges in multiple dimensions. First, we propose a family of connectivity measures (SUBLINE) that unifies a wide range of classic network connectivity measures. Third, we reveal that the connectivity measures in the SUBLINE family enjoy diminishing returns property, which guarantees a near-optimal solution with linear complexity for the connectivity optimization problem. Finally, we evaluate our proposed algorithm on real data sets to demonstrate its effectiveness and efficiency.


  • On the eigen‐functions of dynamic graphs: Fast tracking and attribution algorithms

    by Chen Chen, Hanghang Tong

    Eigen‐functions are of key importance in graph mining since they can be used to approximate many graph parameters, such as node centrality, epidemic threshold, graph robustness, with high accuracy. As real‐world graphs are changing over time, those parameters may get sharp changes correspondingly. Taking virus propagation network for example, new connections between infected and susceptible people appear all the time, and some of the crucial infections may lead to large decreasing on the epidemic threshold of the network. As a consequence, the virus would spread around the network quickly. However, if we can keep track of the epidemic threshold as the graph structure changes, those crucial infections would be identified timely so that counter measures can be taken proactively to contain the spread process. In our paper, we propose two online eigen‐functions tracking algorithms which can effectively monitor those key parameters with linear complexity. Furthermore, we propose a general attribution analysis framework which can be used to identify important structural changes in the evolving process. In addition, we introduce an error estimation method for the proposed eigen‐functions tracking algorithms to estimate the tracking error at each time stamp. Finally, extensive evaluations are conducted to validate the effectiveness and efficiency of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Statistical Analysis and Data Mining: The ASA Data Science Journal, 2016