2002
@inproceedings{ZZL2002,
vgclass = {refpap},
author = {Jiwei Zhong and Haiping Zhu and Jianming Li and Yong Yu},
title = {Conceptual Graph Matching for Semantic Search},
editor = {Uta Priss and Dan Corbett and Galia Angelova},
booktitle = {Proceedings of the 10th International Conference on
Conceptual Structures, (ICCS 2002)},
address = {Borovets, Bulgaria},
number = {2393},
series = {Lecture Notes in Computer Science},
pages = {92--107},
publisher = {Springer-Verlag},
month = {July~15--19},
year = {2002},
url = {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2393&spage=92},
abstract = {Semantic search becomes a research hotspot. The combined
use of linguistic ontologies and structured semantic matching is one
of the promising ways to improve both recall and precision. In this
paper, we propose an approach for semantic search by matching
conceptual graphs. The detailed definitions of semantic similarities
between concepts, relations and conceptual graphs are given. According
to these definitions of semantic similarity, we propose our conceptual
graph matching algorithm that calculates the semantic similarity. The
computation complexity of this algorithm is constrained to be
polynomial. A prototype of our approach is currently under development
with IBM China Research Lab.},
}