26354 search results - page 4868 / 5271 » How we refactor, and how we know it |
188
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
201
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
In many data mining applications, online labeling feedback is only available for examples which were predicted to belong to the positive class. Such applications include spam filt...
221
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
208
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Many websites have large collections of pages generated dynamically from an underlying structured source like a database. The data of a category are typically encoded into similar...
198
click to vote
KDD
2006
ACM
16 years 7 months 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...