Approaches to parallel graph-based knowledge discovery

Diane J. Cook

doi:10.1006/jpdc.2000.1696

Approaches to parallel graph-based knowledge discovery

2001-03-01

28

PRE

AI

DOI：10.1006/jpdc.2000.1696

原文链接

原文求助

摘要

En 中文

The large amount of data collected today is quickly overwhelming researchers' abilities to interpret the data and discover interesting patterns. Knowledge discovery and data mining systems contain the potential to automate the interpretation process, but these approaches frequently utilize computationally expensive algorithms. In particular, scientific discovery systems focus on the utilization of richer data representation, sometimes without regard for scalability. This research investigates approaches for scaling a particular knowledge discovery-data mining system, SUBDUE, using parallel and distributed resources. SUBDUE has been used to discover interesting and repetitive concepts in graph-based databases from a variety of domains, but requires a substantial amount of processing time. Experiments that demonstrate scalability of parallel versions of the SUBDUE system are performed using CAD circuit databases, satellite images, and artificially-generated databases, and potential achievements and obstacles are discussed. (C) 2001 Academic Press.

Approaches to parallel graph-based knowledge discovery

摘要

期刊

机构

引用论文