Description: This package includes the JAVA code of the PPOSS algorithm. It parallelizes our previous POSS algorithm for the subset selection problem and can achieve almost linear speedup in the running time while preserving the solution quality. A Readme file and an example file are included in the package.
References: Chao Qian, Jing-Cheng Shi, Yang Yu, Ke Tang and Zhi-Hua Zhou. Parallel Pareto Optimization for Subset Selection. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI'16), New York, NY, 2016.
ATTN: This package is free for academic usage. You can run it at your own risk. For other purposes, please contact Prof. Zhi-Hua Zhou.
Requirement: The package was developed with JAVA.
ATTN2: This package was developed by Mr. Jing-Cheng Shi. For any problem concerning the code, please feel free to contact Mr. Shi.
Download:
code (1761KB)