A single program multiple data algorithm for feature selection

dc.contributor.authorChanduka, B.
dc.contributor.authorGangavarapu, T.
dc.contributor.authorJaidhar, C.D.
dc.date.accessioned2026-02-06T06:37:09Z
dc.date.issued2020
dc.description.abstractFeature selection is a critical component in data science and has been the topic of research for many years. Advances in hardware and the availability of better multiprocessing platforms have enabled parallel computing to reach very high levels of performance. Minimum Redundancy Maximum Relevance (mRMR) is a powerful feature selection technique used in many applications. In this paper, we present a novel optimized Single Program Multiple Data (SPMD) approach to implement the mRMR algorithm with synchronous computation, optimum load balancing and greater speedup than task-parallel approaches. The experimental results presented using multiple synthesized datasets prove the efficiency and scalability of the proposed technique over original mRMR. © Springer Nature Switzerland AG 2020.
dc.identifier.citationAdvances in Intelligent Systems and Computing, 2020, Vol.940, , p. 662-672
dc.identifier.issn21945357
dc.identifier.urihttps://doi.org/10.1007/978-3-030-16657-1_62
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/30904
dc.publisherSpringer Verlag service@springer.de
dc.subjectFeature selection
dc.subjectmRMR
dc.subjectParallel
dc.subjectSPMD
dc.titleA single program multiple data algorithm for feature selection

Files