Sciweavers

43 search results - page 3 / 9
» Mining interesting subgraphs by output space sampling
Sort
View
KDD
2009
ACM
257views Data Mining» more  KDD 2009»
14 years 3 days ago
Argo: intelligent advertising by mining a user's interest from his photo collections
In this paper, we introduce a system named Argo which provides intelligent advertising made possible from users’ photo collections. Based on the intuition that user-generated ph...
Xin-Jing Wang, Mo Yu, Lei Zhang, Rui Cai, Wei-Ying...
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
13 years 3 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 5 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
14 years 6 hour ago
Finding Associations and Computing Similarity via Biased Pair Sampling
Sampling-based methods have previously been proposed for the problem of finding interesting associations in data, even for low-support items. While these methods do not guarantee ...
Andrea Campagna, Rasmus Pagh
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 2 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki