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

An algorithmic approach to concept exploration in a large knowledge network (automatic thesaurus consultation): Symbolic branch‐and‐bound search vs. connectionist Hopfield net activation

Author

Listed:
  • H. Chen
  • T. Ng

Abstract

This paper presents a framework for knowledge discovery and concept exploration. In order to enhance the concept exploration capability of knowledge‐based systems and to alleviate the limitations of the manual browsing approach, we have developed two spreading activation‐based algorithms for concept exploration in large, heterogeneous networks of concepts (e.g., multiple thesauri). One algorithm, which is based on the symbolic AI paradigm, performs a conventional branch‐and‐bound search on a semantic net representation to identify other highly relevant concepts (a serial, optimal search process). The second algorithm, which is based on the neural network approach, executes the Hopfield net parallel relaxation and convergence process to identify “convergent” concepts for some initial queries (a parallel, heuristic search process). Both algorithms can be adopted for automatic, multiple‐thesauri consultation. We tested these two algorithms on a large text‐based knowledge network of about 13,000 nodes (terms) and 80,000 directed links in the area of computing technologies. This knowledge network was created from two external thesauri and one automatically generated thesaurus. We conducted experiments to compare the behaviors and performances of the two algorithms with the hypertext‐like browsing process. Our experiment revealed that manual browsing achieved higher‐term recall but lower‐term precision in comparison to the algorithmic systems. However, it was also a much more laborious and cognitively demanding process. In document retrieval, there were no statistically significant differences in document recall and precision between the algorithms and the manual browsing process. In light of the effort required by the manual browsing process, our proposed algorithmic approach presents a viable option for efficiently traversing large‐scale, multiple thesauri (knowledge network). © 1995 John Wiley & Sons, Inc.

Suggested Citation

  • H. Chen & T. Ng, 1995. "An algorithmic approach to concept exploration in a large knowledge network (automatic thesaurus consultation): Symbolic branch‐and‐bound search vs. connectionist Hopfield net activation," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 46(5), pages 348-369, June.
  • Handle: RePEc:bla:jamest:v:46:y:1995:i:5:p:348-369
    DOI: 10.1002/(SICI)1097-4571(199506)46:53.0.CO;2-1
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1097-4571(199506)46:53.0.CO;2-1
    Download Restriction: no

    File URL: https://libkey.io/10.1002/(SICI)1097-4571(199506)46:53.0.CO;2-1?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alex Bordetsky & Gloria Mark, 2000. "Memory-Based Feedback Controls to Support Groupware Coordination," Information Systems Research, INFORMS, vol. 11(4), pages 366-385, December.

    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:46:y:1995:i:5:p:348-369. 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.