A Privacy-Preserving Evolutionary Computation Framework for Feature Selection
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sun, Bing | - |
dc.contributor.author | Li, Jian-Yu | - |
dc.contributor.author | Liu, Xiao-Fang | - |
dc.contributor.author | Yang, Qiang | - |
dc.contributor.author | Zhan, Zhi-Hui | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2023-11-24T02:31:40Z | - |
dc.date.available | 2023-11-24T02:31:40Z | - |
dc.date.issued | 2023-10 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115667 | - |
dc.description.abstract | Feature selection is a crucial process in data science that involves selecting the most effective subset of features. Evolutionary computation (EC) is one of the most commonly-used feature selection techniques and has demonstrated good performance, which can help find the suitable feature subset based on training data and fitness information. However, in real-world scenarios, the exact fitness information and privacy-protected data cannot be directly accessed due to privacy and security issues, which leads to a great optimization challenge. To solve such privacy-preserving feature selection problems efficiently, this paper proposes a novel EC-based feature selection framework that balances data privacy and optimization efficiency, together with three contributions. First, based on the rank-based cryptographic function that returns the rank of solutions rather than the exact fitness information, this paper proposes a new fitness function to guide the EC algorithm to approach the global optimum without knowing the exact fitness information and the dataset, thereby preserving data privacy. Second, by integrating the proposed method and EC algorithms, this paper develops a new differential evolution and particle swarm optimization algorithms for efficient feature selection. Finally, experiments are conducted on public datasets, which demonstrate that the proposed method can maintain feature selection efficiency while preserving data privacy. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. | - |
dc.format.extent | 15 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Springer Verlag | - |
dc.title | A Privacy-Preserving Evolutionary Computation Framework for Feature Selection | - |
dc.type | Article | - |
dc.publisher.location | 독일 | - |
dc.identifier.doi | 10.1007/978-981-99-7254-8_20 | - |
dc.identifier.scopusid | 2-s2.0-85175979289 | - |
dc.identifier.bibliographicCitation | Web Information Systems Engineering – WISE 2023 24th International Conference, Melbourne, VIC, Australia, October 25–27, 2023, Proceedings, v.14306 , pp 260 - 274 | - |
dc.citation.title | Web Information Systems Engineering – WISE 2023 24th International Conference, Melbourne, VIC, Australia, October 25–27, 2023, Proceedings | - |
dc.citation.volume | 14306 | - |
dc.citation.startPage | 260 | - |
dc.citation.endPage | 274 | - |
dc.type.docType | Conference paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Data Science | - |
dc.subject.keywordAuthor | Differential Evolution | - |
dc.subject.keywordAuthor | Evolutionary Computation | - |
dc.subject.keywordAuthor | Feature Selection | - |
dc.subject.keywordAuthor | Particle Swarm Optimization | - |
dc.subject.keywordAuthor | Privacy Preservation | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/978-981-99-7254-8_20 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.