1836 search results - page 248 / 368 » Mining Clustering Dimensions |
157
Voted
TALG
2010
14 years 10 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
166
Voted
KDD
2009
ACM
16 years 4 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...
142
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
150
Voted
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—We describe a novel application of using data mining and statistical learning methods to automatically monitor and detect abnormal execution traces from console logs in ...
157
click to vote
ISI
2007
Springer
15 years 10 months ago
2007
Springer
The burgeoning amount of textual data in distributed sources combined with the obstacles involved in creating and maintaining central repositories motivates the need for effective ...