Efficiently Approximating High-Dimensional Pareto Frontiers for Tree-Structured Networks Using Expansion and Compression.
Yiwei BaiQinru ShiMarc GrimsonAlexander FleckerCarla P. GomesPublished in: CPAIOR (2023)
Keyphrases
- high dimensional
- multi objective
- data compression
- structured data
- compression scheme
- tree structures
- compression ratio
- data points
- dimensionality reduction
- low dimensional
- complex networks
- network structure
- neural network
- tree structured data
- compression algorithm
- microarray data
- nearest neighbor
- feature selection
- social networks
- similarity search
- high dimensionality
- gene expression data
- parameter space
- feature space
- genetic algorithm
- real world
- binary tree
- structured learning
- data sets
- wavelet tree