7930 search results - page 1503 / 1586 » Greedy in Approximation Algorithms |
229
Voted
PODS
2009
ACM
16 years 4 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
133
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Data mining tasks such as supervised classification can often benefit from a large training dataset. However, in many application domains, privacy concerns can hinder the construc...
130
Voted
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...
170
Voted
KDD
2003
ACM
16 years 4 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
141
Voted
KDD
2001
ACM
16 years 4 months ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...