219
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...
179
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
We now have incrementally-grown databases of text documents ranging back for over a decade in areas ranging from personal email, to news-articles and conference proceedings. While...
129
Voted
KDD
2007
ACM
16 years 7 months ago
2007
ACM
This paper deals with detecting change of distribution in multi-dimensional data sets. For a given baseline data set and a set of newly observed data points, we define a statistic...
199
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...
213
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Documents, such as those seen on Wikipedia and Folksonomy, have tended to be assigned with multiple topics as a meta-data. Therefore, it is more and more important to analyze a re...
201
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
The problem of multimodal data mining in a multimedia database can be addressed as a structured prediction problem where we learn the mapping from an input to the structured and i...
186
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Given its importance, the problem of predicting rare classes in large-scale multi-labeled data sets has attracted great attentions in the literature. However, the rare-class probl...