Sciweavers

538 search results - page 25 / 108
» Dimension induced clustering
Sort
View
CLEIEJ
2006
87views more  CLEIEJ 2006»
13 years 8 months ago
Integrity Constraint Checking in Distributed Nested Transactions over a Database Cluster
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...
Stéphane Gançarski, Claudia Le&oacut...
JMLR
2010
225views more  JMLR 2010»
13 years 3 months ago
Hartigan's Method: k-means Clustering without Voronoi
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...
Matus Telgarsky, Andrea Vattani
EMNLP
2011
12 years 8 months ago
Unsupervised Dependency Parsing without Gold Part-of-Speech Tags
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...
JDCTA
2010
122views more  JDCTA 2010»
13 years 3 months ago
The Application Research of High-dimensional Mixed-attribute Data Clustering Algorithm
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...
Lilin Fan, Chunhong Liu, Qian Liu
ISAAC
2005
Springer
122views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Fast k-Means Algorithms with Constant Approximation
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...
Mingjun Song, Sanguthevar Rajasekaran