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

H. Chen and T. Ng

Journal of the American Society for Information Science, 1995, vol. 46, issue 5, 348-369

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.

Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1097-4571(199506)46:53.0.CO;2-1

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:46:y:1995:i:5:p:348-369

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().