Please use this identifier to cite or link to this item:
http://idr.nitk.ac.in/jspui/handle/123456789/7132
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chanduka, B. | |
dc.contributor.author | Gangavarapu, T. | |
dc.contributor.author | Jaidhar, C.D. | |
dc.date.accessioned | 2020-03-30T09:58:32Z | - |
dc.date.available | 2020-03-30T09:58:32Z | - |
dc.date.issued | 2020 | |
dc.identifier.citation | Advances in Intelligent Systems and Computing, 2020, Vol.940, , pp.662-672 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7132 | - |
dc.description.abstract | Feature 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. | en_US |
dc.title | A single program multiple data algorithm for feature selection | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.