Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials.
Bart M. P. JansenAstrid PietersePublished in: CoRR (2018)
Keyphrases
- data reduction
- graph coloring
- low degree
- data compression
- phase transition
- combinatorial problems
- job shop scheduling
- optimal solution
- worst case
- rough set theory
- classification rules
- constraint satisfaction problems
- feature selection
- knowledge discovery
- data analysis
- learning algorithm
- classification accuracy
- computational intelligence
- model selection
- high dimensionality
- uniform distribution
- max sat
- image quality
- singular value decomposition
- neural network
- multi class
- scheduling problem
- cost function
- training set
- information retrieval
- data mining