Computer Science – Data Structures and Algorithms
Scientific paper
2008-04-02
International Journal of Applied Mathematics and Computer Sciences, volume 5, issue 1, pages 39-42, ISSN:2070-3902, LA-UR-07-5
Computer Science
Data Structures and Algorithms
Scientific paper
There exists an injective, information-preserving function that maps a semantic network (i.e a directed labeled network) to a directed network (i.e. a directed unlabeled network). The edge label in the semantic network is represented as a topological feature of the directed network. Also, there exists an injective function that maps a directed network to an undirected network (i.e. an undirected unlabeled network). The edge directionality in the directed network is represented as a topological feature of the undirected network. Through function composition, there exists an injective function that maps a semantic network to an undirected network. Thus, aside from space constraints, the semantic network construct does not have any modeling functionality that is not possible with either a directed or undirected network representation. Two proofs of this idea will be presented. The first is a proof of the aforementioned function composition concept. The second is a simpler proof involving an undirected binary encoding of a semantic network.
No associations
LandOfFree
Mapping Semantic Networks to Undirected Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Mapping Semantic Networks to Undirected Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mapping Semantic Networks to Undirected Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-389333