A combinatorial optimization problem arising from text classification.
Sandro BosioGiovanni RighiniPublished in: Electron. Notes Discret. Math. (2003)
Keyphrases
- combinatorial optimization
- text classification
- metaheuristic
- combinatorial optimization problems
- traveling salesman problem
- simulated annealing
- text categorization
- bag of words
- branch and bound
- optimization problems
- text mining
- branch and bound algorithm
- labeled data
- feature selection
- naive bayes
- combinatorial problems
- n gram
- mathematical programming
- quadratic assignment problem
- machine learning
- knn
- hard combinatorial optimization problems
- text classifiers
- graph theory
- combinatorial search
- objective function
- path relinking
- max flow min cut
- single machine scheduling problem
- estimation of distribution algorithms
- exact algorithms
- memetic algorithm
- benchmark problems
- multi objective
- search space
- computer vision