This paper considers the problem of clustering high dimensional data as a clique partitioning problem. Data objects within a cluster have high degree of similarity. The similarity index values are first constructed into a graph as a clique partitioning problem which can be formulated into a form of unconstrained quadratic program model and then solved by a tabu search heuristic incorporating strategic oscillation with a critical event memory. Results from other clustering techniques are compared on a set of instances from open literatures. The computational results highlight the robustness of this new model and solution methodology
