98%
921
2 minutes
20
Chronic obstructive pulmonary disease (COPD) is one of the leading causes of death in the United States. COPD represents one of many areas of research where identifying complex pathways and networks of interacting biomarkers is an important avenue toward studying disease progression and potentially discovering cures. Recently, sparse multiple canonical correlation network analysis (SmCCNet) was developed to identify complex relationships between omics associated with a disease phenotype, such as lung function. SmCCNet uses two sets of omics datasets and an associated output phenotypes to generate a multi-omics graph, which can then be used to explore relationships between omics in the context of a disease. Detecting within this multi-omics network, i.e., subgraphs which exhibit high correlation to a disease phenotype and high inter-connectivity, can help clinicians identify complex biological relationships involved in disease progression. The current approach to identifying significant subgraphs relies on hierarchical clustering, which can be used to inform clinicians about important pathways involved in the disease or phenotype of interest. The reliance on a hierarchical clustering approach can hinder subgraph quality by biasing toward finding more compact subgraphs and removing larger significant subgraphs. This study aims to introduce new significant subgraph detection techniques. In particular, we introduce two subgraph detection methods, dubbed Correlated PageRank and Correlated Louvain, by extending the Personalized PageRank Clustering and Louvain algorithms, as well as a hybrid approach combining the two proposed methods, and compare them to the hierarchical method currently in use. The proposed methods show significant improvement in the quality of the subgraphs produced when compared to the current state of the art.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9256965 | PMC |
http://dx.doi.org/10.3389/fdata.2022.894632 | DOI Listing |
Phys Rev Lett
August 2025
Peking University, State Key Laboratory for Mesoscopic Physics, School of Physics, Frontiers Science Center for Nano-optoelectronics, and Collaborative Innovation Center of Quantum Matter, Beijing 100871, China.
Quantum randomness can be certified from probabilistic behavior demonstrating Bell nonlocality or Einstein-Podolsky-Rosen steering, leveraging outcomes from uncharacterized devices. However, in standard spot-checking protocols, such nonlocal correlations are not always sufficient for this task, necessitating the identification of required minimum quantum resources. In this Letter, we focus on the bipartite scenario and provide the necessary and sufficient condition for nonzero certified randomness under any arbitrary but fixed input, formulated in terms of measurement incompatibility.
View Article and Find Full Text PDFPhys Rev E
July 2025
University of Twente, Department of Electrical Engineering, Mathematics and Computer Science, Enschede, The Netherlands.
Network geometry, characterized by nodes with associated latent variables, is a fundamental feature of real-world networks. Still, when only the network edges are given, it may be difficult to assess whether the network contains an underlying source of geometry. This paper investigates the limits of geometry detection in networks in a wide class of models that contain geometry and power-law degrees, which include the popular hyperbolic random graph model.
View Article and Find Full Text PDFComput Methods Programs Biomed
October 2025
Department of Pathology, Shanxi Bethune Hospital, Shanxi Academy of Medical Sciences, Tongji Shanxi Hospital, Third Hospital of Shanxi Medical University, Taiyuan 030032, China. Electronic address:
Background And Objective: Graph-based methods are widely applied in whole-slide histopathology images (WSI) analysis since they can effectively capture spatial relationship between nodes. However, existing methods focus on promoting positive nodes to have similar representations while ignoring the expression of negative samples of each node, failing to fully utilize various diagnostic information for comprehensive analysis.
Methods: In this paper, we propose a Dual Collaboration Heterogeneous Graph Convolutional Network (DCH-GCN) framework that considers both positive and negative samples implicit in whole-slide images (WSIs).
Sensors (Basel)
July 2025
School of Artificial Intelligence, Nanjing University of Information Science and Technology, Nanjing 210044, China.
In recent years, the growing threat of Android malware has caused significant economic losses and posed serious risks to user security and privacy. Machine learning-based detection approaches have improved the accuracy of malware identification, thereby providing more effective protection for Android users. However, graph-based detection methods rely on whole-graph computations instead of subgraph-level analyses, and they often ignore the semantic information of individual nodes.
View Article and Find Full Text PDFJ Comput Biol
July 2025
Department of Computer Science, University of California, Irvine, California, USA.
Community detection is a long-standing problem with applications from social networks to biology. Given its popularity and that it is NP-complete, heuristics abound, though no gold standard exists-there is even disagreement on the technical definition of what a community of nodes. We define a as any set of nodes in which the edge density is higher by a substantial margin than the network's overall edge density.
View Article and Find Full Text PDF