152 search results - page 11 / 31 » Finding Consistent Clusters in Data Partitions |
DCC
2005
IEEE
15 years 11 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
EACL
2009
ACL Anthology
14 years 9 months ago
2009
ACL Anthology
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
KDD
2005
ACM
16 years 2 days ago
2005
ACM
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
125
click to vote
OSDI
2004
ACM
15 years 12 months ago
2004
ACM
MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to ge...
110
click to vote
KDD
2006
ACM
16 years 2 days ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...