TY - CHAP
T1 - Context Relevance for Text Analysis and Enhancement for Soft Information Fusion
AU - Kandefer, Michael
AU - Shapiro, Stuart C.
N1 - Publisher Copyright:
© Springer International Publishing Switzerland (outside the USA) 2016.
PY - 2016
Y1 - 2016
N2 - Soft information fusion, fusing information from natural language messages with other soft information and with information from physical sensors is facilitated by representing the information in the messages as a formally defined propositional graph that abides by the uniqueness principle—the principle that every entity or event that is mentioned in the message is represented by a unique node in the graph, or, at worst, by several nodes connected by co-referentiality relations. To further facilitate information fusion, information from the message is enhanced with relevant information from background knowledge sources. What knowledge is relevant is determined by also representing the background knowledge as a propositional graph, embedding the knowledge graph from the messages into the background knowledge graph using the uniqueness principle to fuse a message graph node with a background knowledge graph node, and then using spreading activation to find subgraphs of the background knowledge graph. This combination of the message graph with the retrieved subgraphs is considered the “relevant information.” In this chapter, we discuss, evaluate, and compare two techniques for spreading activation.
AB - Soft information fusion, fusing information from natural language messages with other soft information and with information from physical sensors is facilitated by representing the information in the messages as a formally defined propositional graph that abides by the uniqueness principle—the principle that every entity or event that is mentioned in the message is represented by a unique node in the graph, or, at worst, by several nodes connected by co-referentiality relations. To further facilitate information fusion, information from the message is enhanced with relevant information from background knowledge sources. What knowledge is relevant is determined by also representing the background knowledge as a propositional graph, embedding the knowledge graph from the messages into the background knowledge graph using the uniqueness principle to fuse a message graph node with a background knowledge graph node, and then using spreading activation to find subgraphs of the background knowledge graph. This combination of the message graph with the retrieved subgraphs is considered the “relevant information.” In this chapter, we discuss, evaluate, and compare two techniques for spreading activation.
KW - Context
KW - Graph knowledge representation
KW - Information fusion
KW - Propositional graphs
KW - Relevance
KW - SNePS
KW - Soft information fusion
KW - Spreading activation
KW - Tractor
UR - https://www.scopus.com/pages/publications/85144841072
U2 - 10.1007/978-3-319-28971-7_14
DO - 10.1007/978-3-319-28971-7_14
M3 - Chapter
AN - SCOPUS:85144841072
T3 - Advances in Computer Vision and Pattern Recognition
SP - 381
EP - 401
BT - Advances in Computer Vision and Pattern Recognition
PB - Springer Science and Business Media Deutschland GmbH
ER -