670 search results - page 108 / 134 » A Framework for Data Mining Pattern Management |
KDD
2012
ACM
11 years 11 months ago
2012
ACM
In this paper, we investigate a problem of predicting what images are likely to appear on the Web at a future time point, given a query word and a database of historical image str...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
GLOBECOM
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper, we propose a novel routing protocol, PRO, for profile-based routing in pocket switched networks. Differing from previous routing protocols, PRO treats node encounter...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...