9888 search results - page 1894 / 1978 » compute 2009 |
127
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
99
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
111
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
User browsing information, particularly their non-search related activity, reveals important contextual information on the preferences and the intent of web users. In this paper, ...
134
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
124
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
One common predictive modeling challenge occurs in text mining problems is that the training data and the operational (testing) data are drawn from different underlying distributi...