Oriental Journal of Computer Science and Technology

Open Access Open Access  Restricted Access Subscription Access

Evaluation of Proposed Algorithm with Preceding GMT for Fraudulence Diagnosis


Affiliations
1 Department of Information Technology, Govind Ballabh Pant University of Agriculture and Technology, Pantnagar-263145, Uttarakhand, India
 

Formerly existing graph mining algorithms regularly accept that database is generally static. To defeat that we proposed another algorithm which manages extensive database including the components which catches the properties of the graph in a couple of parameters and check the relationship among them in both left and additionally right course, in this way embracing DFS and in addition BFS approach. It furthermore discovers the subgraph by traversing the graph and removing the planned routine. The proposed calculation is utilized for identification of wrongdoing as a part of BANK&Financial organization by catching the properties and distinguishing the relationship and affiliations that may exist between the individual required in that wrongdoing which keep a few violations that may happen in future. We have utilized the Neo-ECLIPSE for the execution of proposed calculation and Neo4j is the graph database utilized for evaluation. On the off chance that a man endeavoring to confer fraud or engage in some kind of illicit movement, they will endeavor to pass on their activities as near authentic activities as could reasonably be expected. Here in this paper, we are giving the data that a man who is in beginning the phase of the fraud, what co-related wrongdoings or illicit exercises he can do in future. The future exercises that can be performed by the individual can be ceased by demonstrating the associations with the entries saved in the database.

Keywords

Part Miner, gSPAN, gIndex, Graph database, Traversing.
User
Notifications
Font Size

  • R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB’94, pages 487–499, Sept. 1994.

  • Usama Fayyad, Gregory Piatetsky-Shapiro, and Padhraic Smyth,” From Data Mining to Knowledge Discover Databases”, AI Magazine Volume 17 Number 3 (1996) (© AAAI)

  • D. J. Cook and L. B. Holder (2000) Graph-Based Data Mining, IEEE Intelligent Systems, 15(2).

  • A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD’00, pages 13–23, 2000.

  • X. Yan and J. Han. gspan: Graph-based substructure pattern mining. Technical Report UIUCDCS-R-2002-2296, Depart- ment of Computer Science, University of Illinois at Urbana- Champaign, 2002.

  • J. Huan, W. Wang, J. Prins, Efficient mining of frequent sub graph in the presence of isomorphism, in: Proceedings of the 2003 IEEE International Conference on Data Mining (ICDM’03), pp. 549– 552, 2003.

  • Y Yan, X., Yu, P. S., & Han, J. (2004). Graph indexing: a frequent structure-based approach. In ACM SIGMOD international conference on management of data (SIGMOD’04) ACM, New York, (pp. 335–346).

  • Hsinchun Chen, WingyanChung, Jennifer Jie Xu, Gang Wang Yi Qin and Michael Chau,” Crime Data Mining: A General Framework and Some Examples”, 0018- 9162/04/$20.00 © 2004 IEEE

  • R. Niewiadomski, J. Amaral, and R. Holte.A parallel external- memory frontier breadth-rst traversal algorithm for clusters of work- stations. In IEEE ICPP, 2006.

  • JunmeiWang, WynneHsu Mong and Li Lee Chang Sheng,” “A Partition-Based Approach to Graph Mining”, Proceedings of the 22nd International Conference on Data Engineering (ICDE’06)8-7695-2570-9/06 $20.00 © 2006 IEEE

  • Frank Eichinger, KlemensB¨ohm and Matthias Huber,” Improved Software Fault Detection with Graph Mining”, Appearing in the 6th International Workshop on Mining and Learning with Graphs, Helsinki, Finland, 2008.

  • Sytske Besemer,” The impact of timing and frequency of parental criminal behavior and risk factors on offspring offending”, a Institute of Criminology University of Cambridge, Cambridge, UK Version of record first published: 05 Nov 2012.

  • Justin J. Miller,”Graph Database Applications and Concept with Neo4j”,Proceedings of the Southern Association for Information System Conference, Atlanta, GA, USA March 23rd- 24th, 2013


Abstract Views: 229

PDF Views: 4




  • Evaluation of Proposed Algorithm with Preceding GMT for Fraudulence Diagnosis

Abstract Views: 229  |  PDF Views: 4

Authors

Navneet Kr. Kashyap
Department of Information Technology, Govind Ballabh Pant University of Agriculture and Technology, Pantnagar-263145, Uttarakhand, India

Abstract


Formerly existing graph mining algorithms regularly accept that database is generally static. To defeat that we proposed another algorithm which manages extensive database including the components which catches the properties of the graph in a couple of parameters and check the relationship among them in both left and additionally right course, in this way embracing DFS and in addition BFS approach. It furthermore discovers the subgraph by traversing the graph and removing the planned routine. The proposed calculation is utilized for identification of wrongdoing as a part of BANK&Financial organization by catching the properties and distinguishing the relationship and affiliations that may exist between the individual required in that wrongdoing which keep a few violations that may happen in future. We have utilized the Neo-ECLIPSE for the execution of proposed calculation and Neo4j is the graph database utilized for evaluation. On the off chance that a man endeavoring to confer fraud or engage in some kind of illicit movement, they will endeavor to pass on their activities as near authentic activities as could reasonably be expected. Here in this paper, we are giving the data that a man who is in beginning the phase of the fraud, what co-related wrongdoings or illicit exercises he can do in future. The future exercises that can be performed by the individual can be ceased by demonstrating the associations with the entries saved in the database.

Keywords


Part Miner, gSPAN, gIndex, Graph database, Traversing.

References