IJPAM: Volume 58, No. 2 (2010)




G. Britto Antony Xavier


Bharathidasan University
Tiruchirappalli, 620 023, Tamil Nadu, INDIA

Sacred Heart College
Tirupattur, 635 601, Vellore Dist., Tamil Nadu, INDIA

Sacred Heart College
Tirupattur, 635 601, Vellore Dist., Tamil Nadu, INDIA

Abstract.Knowledge management applications need to determine whether two or more knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the same content but differ substantially in form. Previous approaches to this problem have used either syntactic measure, such as graph edit distance, or semantic knowledge to determine the distance between two representations. Previous research has focused primarily on the use of taxonomic knowledge and discusses how transformations can augment existing semantic approaches to improve matching of two graphs. In this paper, the authors define matching of -directed graphs and present the mathematical aspect of matching and binding of
-directed graphs with fitness and measure of status of the matched subgraph. The generalized algorithm is illustrated using an example.
Received: December 18, 2009
AMS Subject Classification: 05c
Key Words and Phrases: binding, fitness, measure of status, taxonomy, transforms
Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2010
Volume: 58
Issue: 2