@article{MAKHILLAJIT20181746736,
    title = {Improvising Classification Performance for High Dimensional and
Small Sample Data Sets},
    journal = {Asian Journal of Information Technology},
    volume = {17},
    number = {4},
    pages = {261-270},
    year = {2018},
    issn = {1682-3915},
    doi = {ajit.2018.261.270},
    url = {https://makhillpublications.co/view-article.php?issn=1682-3915&doi=ajit.2018.261.270},
    author = {L.,M.K. and},
    keywords = {Feature subset selection,filter method,correlation-based spanning tree,supervised classification,datasets,proposed framework},
    abstract = {Classification is an important problem where the performance of a classifier depreciates as the sample
size decrease and dimensionality increase. This study describes feature subset selection framework for
supervised classification problem which works efficiently with very few training samples. In the proposed
algorithm, the most relevant feature has been selected by using filter method and the redundancy among the
features is eliminated by using correlation-based spanning tree. The proposed framework is designed to perform
data analytics to extract the most influencing predictors. The complexity of the algorithm is reduced drastically
by performing parallel processing of feature subsets. The performance of the algorithm is tested against various
predominant feature subset selection algorithms in 4 different datasets from UCI repository and 2 real world
microarray data where the classification accuracy of the proposed framework is better than the others feature
selection algorithms.}
    }