2020
DOI: 10.48550/arxiv.2005.03659
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Improved supervised prediction of aging-related genes via weighted dynamic network analysis

Abstract: Motivation: This study focuses on supervised prediction of aging-related genes from -omics data. Unlike gene expression methods that capture aging-specific information but study genes in isolation, or protein-protein interaction (PPI) network methods that account for PPIs but the PPIs are contextunspecific, we recently integrated the two data types into an aging-specific PPI subnetwork, which yielded more accurate aging-related gene predictions. However, a dynamic aging-specific subnetwork did improve predicti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 61 publications
(75 reference statements)
0
2
0
Order By: Relevance
“…predict which group a network or an element of a network belongs in based on the graphlet degrees. Even though such methods have been previously applied to single-layer networks [44,45,46,47], there is a clear avenue for further research in the application of machine learning to multilayer graphlets. Presumably, the problem of choosing the correct set of graphlets is less severe in supervised learning in which the method should be able to find the important orbits based on the training data.…”
Section: Discussionmentioning
confidence: 99%
“…predict which group a network or an element of a network belongs in based on the graphlet degrees. Even though such methods have been previously applied to single-layer networks [44,45,46,47], there is a clear avenue for further research in the application of machine learning to multilayer graphlets. Presumably, the problem of choosing the correct set of graphlets is less severe in supervised learning in which the method should be able to find the important orbits based on the training data.…”
Section: Discussionmentioning
confidence: 99%
“…Recently, matrix factorization methods attempt to formulate different proximity matrices based on the n-hop transitional Also node embedding algorithms in attributed networks [BLM19] and heterogeneous networks[HYCM18] have been explored widely. Despite their success, many real-world scenarios are essentially dynamic, for example, relationships in a social network [SM06], spatio-temporal traffic prediction [ZFWQ20] and progressions of aging related genes [LM20]. Algorithms for static networks generally fail to consider the evolution of network structures, and thus lack the ability to capture any time-dependent information which can affect the performance of downstream tasks.…”
Section: Datasetsmentioning
confidence: 99%