born in 2000. Master candidate. Student member of CCF. Her main research interests include feature selection and federated learning
born in 1987. PhD, associate professor, PhD supervisor. Member of CCF. His main research interests include data mining and granular computing
born in 1969. PhD, professor, PhD supervisor. His main research interests include data mining and granular computing
born in 1971. PhD, professor, PhD supervisor. Her main research interests include data mining and granular computing
Feature selection is an effective technique of dimensionality reduction in the field of machine learning. In the era of big data, data security has become an issue of great concern nowadays, and how to perform the feature selection task under the premise of privacy protection is a challenging scientific problem that needs to be solved urgently. Rough hypercuboid is an uncertainty approximation computational model combining rough set theory and hypercuboid learning, which provides an efficient feature selection method for numerical approximate classification problems by introducing supervised information granulation technique and multiple feature evaluation criteria. In this paper, we propose a novel multi-party federated feature selection algorithm under privacy protection, based on the rough hypercuboid model and particle swarm optimization algorithm. Firstly, a centralized (client/server) federated feature selection architecture for multi-party participation is established. Based on the architecture, the rough hypercuboid model and the particle swarm optimization algorithm are used to search the optimal feature subset on the client, and a novel global feature subset evaluation strategy for multiple participants is proposed on the server. Then, the ability of the proposed algorithm to select features in collaboration with multiple participants is improved by designing a particle initialization strategy in a federated environment. Finally, experimental results on the twelve UCI benchmark datasets show that compared with the other six traditional feature selection algorithms, the subset of features selected by the proposed algorithm has higher classification performance on each participant under the premise of satisfying the data privacy protection.
| 科 Family | 属数 Number of genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) | 属 Genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) |
|---|---|---|---|---|---|---|
| 鹅膏菌科Amanitaceae | 2 | 11 | 5.26 | 鹅膏菌属 Amanita | 10 | 4.78 |
| 小菇科 Mycenaceae | 2 | 12 | 5.74 | 丝盖伞属 Inocybe | 5 | 2.39 |
| 多孔菌科 Polyporaceae | 8 | 14 | 6.70 | 蜡蘑属 Laccaria | 5 | 2.39 |
| 红菇科 Russulaceae | 3 | 23 | 11.00 | 小皮伞属 Marasmius | 6 | 2.87 |
| 小菇属 Mycena | 11 | 5.26 | ||||
| 光柄菇属 Pluteus | 5 | 2.39 | ||||
| 红菇属 Russula | 17 | 8.13 | ||||
| 栓菌属 Trametes | 5 | 2.39 |