A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row.
Guillaume BlinRomeo RizziStéphane VialettePublished in: CSR (2011)
Keyphrases
- computational complexity
- high accuracy
- objective function
- initial set
- polynomial time complexity
- detection algorithm
- search space
- preprocessing
- np hard
- expectation maximization
- input pattern
- np hardness
- solution space
- minimum length
- optimization algorithm
- particle swarm optimization
- learning algorithm
- computational cost
- dynamic programming
- k means
- special case
- probability distribution
- significant improvement
- approximation algorithms
- neural network
- method finds
- feature selection
- rows and columns
- optimal solution
- decomposition algorithm
- packing problem
- convex hull
- multi objective
- segmentation algorithm
- experimental evaluation
- input data
- linear programming