This paper presents a solution to check referential integrity constraints and conjunctive global constraints in a relational multi database system. It also presents the experiment...
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
We show that categories induced by unsupervised word clustering can surpass the performance of gold part-of-speech tags in dependency grammar induction. Unlike classic clustering ...
Valentin I. Spitkovsky, Hiyan Alshawi, Angel X. Ch...
High-dimensional mixed-attribute data clustering has become an important research direction in data mining area. Because of the advantages of the information technology, data coll...
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...