216 search results - page 11 / 44 » Using a Hash-Based Method for Apriori-Based Graph Mining |
DEXAW
2009
IEEE
14 years 3 months ago
2009
IEEE
—A novel method CLOSS intended for textual databases is proposed. It successfully identifies misspelled string clusters, even if the cluster border is not prominent. The method ...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
BIBE
2007
IEEE
14 years 17 days ago
2007
IEEE
In this paper, we investigate a new approach for literature mining. We use frequent subgraph mining, and its generalization topological structure mining, for finding interesting re...
SDM
2011
SIAM
12 years 11 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
WWW
2011
ACM
13 years 3 months ago
2011
ACM
In this paper, we use the structural and relational information on the Web to find entity-pages. Specifically, given a Web site and an entity-page (e.g., department and faculty ...