A parallel branch-and-bound methodfor cluster analysis.
Lakshmi S. IyerJay E. AronsonPublished in: Ann. Oper. Res. (1999)
Keyphrases
- cluster analysis
- branch and bound
- depth first search
- branch and bound algorithm
- search algorithm
- lower bound
- categorical data
- optimal solution
- search space
- column generation
- upper bound
- hierarchical latent class models
- combinatorial optimization
- clustering method
- data mining
- k means
- tree search algorithm
- branch and bound procedure
- unsupervised learning
- randomly generated problems
- clustering algorithm
- cluster validity
- branch and bound method
- factor analysis
- tree search
- data mining techniques
- branch and bound search
- data analysis
- network design problem
- machine learning
- bnb adopt
- lagrangian heuristic
- objective function
- data sets
- particle swarm optimization
- linear programming
- semi supervised
- latent class models
- real world