Tree-like Dimensionality Reduction for Cancer-informatics
IOP Conference Series: Materials Science and Engineering(2019)
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.
MoreTranslated text
Key words
tree-like,cancer-informatics
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined