263 search results - page 4 / 53 » kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets |
KDD
2012
ACM
12 years 6 days ago
2012
ACM
In recent years, mining frequent itemsets over uncertain data has attracted much attention in the data mining community. Unlike the corresponding problem in deterministic data, th...
PKDD
2010
Springer
13 years 7 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
KDD
2004
ACM
14 years 10 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
WWW
2008
ACM
14 years 10 months ago
2008
ACM
Sequential pattern mining has raised great interest in data mining research field in recent years. However, to our best knowledge, no existing work studies the problem of frequent...
KDD
2009
ACM
14 years 4 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...