7581 search results - page 471 / 1517 » Incompleteness in Data Mining |
159
click to vote
SDM
2004
SIAM
15 years 8 months ago
2004
SIAM
There has been a renewed interest in understanding the structure of high dimensional data set based on manifold learning. Examples include ISOMAP [25], LLE [20] and Laplacian Eige...
200
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
183
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
172
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Given a quarter of petabyte click log data, how can we estimate the relevance of each URL for a given query? In this paper, we propose the Bayesian Browsing Model (BBM), a new mod...
149
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
While many clever techniques have been proposed for visual analysis, most of these are “one of” and it is not easy to see how to combine multiple techniques. We propose an alg...