Open
Access -
Israa Hadi and Saad Taleb Hasson
No
Article Received on :
Article Accepted on :
Article Published :
This paper aims to develop new techniques to construct a graph structure to represent the relation between the objects in movie film. The main approach includes a mechanism for many steps, first step is the Data Base Construction , which create a table consist record for each frame, and each record contain entities such as area, Perimeter, and other parameters. The second step is to calculate the number of features for any object in each frame depending on the parameters in the data base. While the third step constructs a graph structure that represent a base on the features of the objects.
KEYWORDS: Graph mining; Data mining; Movie Graph mining| Copy the following to cite this article: Hadi I, Hasson S. T. Query Routing Trust Routing, Trust Manager ,Peer to Peer Networks. Orient. J. Comp. Sci. and Technol;6(2) |
| Copy the following to cite this URL: Hadi I, Hasson S. T. Query Routing Trust Routing, Trust Manager ,Peer to Peer Networks. Orient. J. Comp. Sci. and Technol;6(2). Available from: http://www.computerscijournal.org/?p=2759 |
