Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials.
Bart M. P. JansenAstrid PietersePublished in: IPEC (2017)
Keyphrases
- data reduction
- graph coloring
- low degree
- data compression
- data analysis
- knowledge discovery
- combinatorial problems
- phase transition
- job shop scheduling
- worst case
- high dimensionality
- feature selection
- classification rules
- constraint satisfaction problems
- classification accuracy
- preprocessing
- dimensionality reduction
- rough set theory
- scheduling problem
- hyper heuristics
- data mining
- model selection
- computational intelligence
- high dimensional
- optimal solution
- feature extraction