5046 search results - page 368 / 1010 » Non-redundant data clustering |
197
click to vote
PAMI
2006
15 years 6 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
153
click to vote
SIGKDD
2000
15 years 6 months ago
2000
This paper presents a simple new algorithm that performs k-means clustering in one scan of a dataset, while using a bu er for points from the dataset of xed size. Experiments show...
199
click to vote
ACL
2009
15 years 4 months ago
2009
Letter-to-phoneme (L2P) conversion is the process of producing a correct phoneme sequence for a word, given its letters. It is often desirable to reduce the quantity of training d...
211
click to vote
TCS
2011
15 years 1 months ago
2011
An active learner has a collection of data points, each with a label that is initially hidden but can be obtained at some cost. Without spending too much, it wishes to find a cla...
199
click to vote
ACL
2011
14 years 10 months ago
2011
Annotating training data for event extraction is tedious and labor-intensive. Most current event extraction tasks rely on hundreds of annotated documents, but this is often not en...