Abstract
Dimensionality reduction in machine learning currently has become a very heated research filed. Traditional dimensionality reduction can be separated into two sub-fields of feature selection and feature extraction, but both of them are under local consideration. In this paper, an algorithm based on information theory, mutual information and maximum spanning tree will be proposed, in order to implement dimensionality reduction under global consideration rather than local consideration. Experimental results show it has a good performance, when the proposed algorithm is applied on gene sequences about cancer bioinformatics.
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 callMore From: IOP Conference Series: Materials Science and Engineering
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.
