243 search results - page 17 / 49 » Scalable mining of large disk-based graph databases |
ICTAI
2003
IEEE
14 years 25 days ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
JCP
2008
13 years 7 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
KDD
2005
ACM
14 years 1 months ago
2005
ACM
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
PVLDB
2010
13 years 2 months ago
2010
The growing demand for large-scale data mining and data analysis applications has led both industry and academia to design new types of highly scalable data-intensive computing pl...
CIKM
2001
Springer
13 years 11 months ago
2001
Springer
Scalable data mining in large databases is one of today's challenges to database technologies. Thus, substantial effort is dedicated to a tight coupling of database and data ...