The week's pick
Random Articles
Reseach Article
Comparative Study and Results Analysis of Feature Vector and Adjacency Matrix for Representing FSM for Data Reduction
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 110 - Number 10 |
| Year of Publication: 2015 |
| Authors: Tawfiq Abdulkhaleq Abbas, Abbood Kirebut Jassim |
10.5120/19356-1089
|
Tawfiq Abdulkhaleq Abbas, Abbood Kirebut Jassim . Comparative Study and Results Analysis of Feature Vector and Adjacency Matrix for Representing FSM for Data Reduction. International Journal of Computer Applications. 110, 10 ( January 2015), 39-41. DOI=10.5120/19356-1089
Abstract
A finite state automaton is conceptual graphs which are considered to be an important type of graph method. As a result of the expansion of using the graphs in the process of data mining, the use of FMS is still limited because of the difficulty in processing databases, therefore this paper is to find an approach that make it easier to deal with large groups of machines as a database is encourage to use of this type of representation in mining techniques. This paper gives a approach for finding a match between machines, which appear frequently in a single environment or similar environments, the approach consist of two methods one for machines matching as adjacency matrices and another method for matching machines as vectors of features ,hence prove that second method more efficient to control the match processing
References
- Daine J. Cook, Lawernce B. Holder, "mining graph data" ,willy,Washington 2007.
- Yan, Xifeng, X. Zhou, and Jiawei Han, "frequent subgraph mining and graph relational knowledge Mining closed relational graphs with connectivity constraints. " Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. ACM, 2005.
- Wiskott, Laurenz, et al. "Face recognition by elastic bunch graph matching. "Pattern Analysis and Machine Intelligence", IEEE Transactions on 19. 7 (1997): 775-779. ?).
- Raymond, John W. , Eleanor J. Gardiner, and Peter Willett. "Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm. " Journal of chemical information and computer sciences42. 2 (2002): 305-316. ?)
- Casey, Mike. "The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction. " Neural computation 8. 6 (1996): 1135-1178.
- Yen, Ti-Yen, and Wayne Wolf. "An efficient graph algorithm for FSM scheduling. " Very Large Scale Integration (VLSI) Systems, IEEE Transactions on 4. 1 (1996): 98-112. ? )
- Yang, Shih-Yao, and Von-Wun Soo, "Extract conceptual graphs from plain texts in patent claims. " Engineering Applications of Artificial Intelligence 25. 4 (2012): 874-887. ?
Index Terms
Keywords