Abstract
We applied associative OR search on a Failure Knowledge Database with 1,242 failure accidents and 41 failure scenarios in the book “100 Scenarios of Failure” to find cases most analogous to risks that engineers were concerned with. Ninety engineers provided 203 input cases of risk concerns and the search for accidents most analogous to each input returned the most analogous accidents for 64% of the input cases of risk concerns within several minutes. Analogous scenario searches returned the most analogous scenarios for 63% of the input. Regular keyword AND searches take tens of minutes to narrow down the candidates to a few analogous cases, and thus associative search is a more effective tool for risk management.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Takano, A.: Association Computation for Information Access. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol. 2843, pp. 33–44. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakao, M. et al. (2008). Extracting Failure Knowledge with Associative Search. In: Satoh, K., Inokuchi, A., Nagao, K., Kawamura, T. (eds) New Frontiers in Artificial Intelligence. JSAI 2007. Lecture Notes in Computer Science(), vol 4914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78197-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-78197-4_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78196-7
Online ISBN: 978-3-540-78197-4
eBook Packages: Computer ScienceComputer Science (R0)