IDEAS home Printed from https://ideas.repec.org/a/bla/jamest/v50y1999i1p65-73.html
   My bibliography  Save this article

Exploiting parallelism in a structural scientific discovery system to improve scalability

Author

Listed:
  • Gehad M. Galal
  • Diane J. Cook
  • Lawrence B. Holder

Abstract

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 approaches hold 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 in databases (KDD) 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 and artificially‐generated databases, and potential achievements and obstacles are discussed.

Suggested Citation

  • Gehad M. Galal & Diane J. Cook & Lawrence B. Holder, 1999. "Exploiting parallelism in a structural scientific discovery system to improve scalability," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 50(1), pages 65-73.
    • Handle: RePEc:bla:jamest:v:50:y:1999:i:1:p:65-73
    DOI: 10.1002/(SICI)1097-4571(1999)50:13.0.CO;2-G
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1097-4571(1999)50:13.0.CO;2-G
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1097-4571(1999)50:13.0.CO;2-G?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamest:v:50:y:1999:i:1:p:65-73. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.