Abstract

Background: In spite of the significant data surrounding complex gene networks including gene function, the occurrence of huge redundancy affects the efficiency. Objective: This work proposes a mining method to reduce the number of redundant nodes in a composite weighted network. Method: The idea is to eliminate the redundancies of nodes via a hybrid approach, i.e. the integration of multiple functional association networks using a Greedy Algorithm. This is achieved by mining the gene function from weighted gene co-expression networks based on neighbor similarity, as per the available datasets. Subsequently, Linear Regression and Greedy Algorithm are applied simultaneously for exclusion of the redundant nodes. Then, assigning the indexing rates for the remaining nodes in the dataset further assists the process. Results and Conclusion: In comparison with other well-known algorithms, this method is 93% more efficient, as per three selected benchmarks.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.