A faster algorithm for the cluster editing problem on proper interval graphs.
Min Chih LinFrancisco J. SoulignacJayme Luiz SzwarcfiterPublished in: Inf. Process. Lett. (2015)
Keyphrases
- learning algorithm
- times faster
- preprocessing
- high accuracy
- worst case
- highly efficient
- graph structure
- data clustering
- computational cost
- cost function
- experimental evaluation
- k means
- clustering algorithm
- objective function
- search space
- optimal solution
- segmentation algorithm
- graph isomorphism
- hyper graph
- memory efficient
- computational complexity
- matching algorithm
- clustering method
- shortest path
- expectation maximization
- simulated annealing
- genetic algorithm
- semi supervised
- knn
- dynamic programming