Match Fixing Network Analysis to Verify Nearness among Internal Participants of a Cricket Match

被引:0
|
作者
Ananthapadmanabha, K. [1 ]
Udayakumar, K. [2 ]
机构
[1] Rayalaseem Univ, Comp Sci & Engn, PP COMP SCI ENG 025, Kurnool, India
[2] Adarsha Inst Technol, Dept Comp Sci & Engn, Bangalore, Karnataka, India
关键词
Cricket; Match fixing; Internal participants; Graph mining; Link mining; Community mining; Greedy technique;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Match fixing in cricket is a fraudulent activity involving captain of the team, few key players, umpires, officials, bookies, middle men and gangsters. To perform match fixing in cricket, they form a criminal network with each of them acting as a node and association between these nodes acting as edges. To analyze this network concepts like using graph mining, link mining, community mining and algorithmic design notation like greedy technique are applied. Participants in a cricket match like captain, umpires, players, officials are called internal participants share vital game plan information from dressing room with bookies, middlemen and gangsters. Participants like bookies, middlemen and gangsters who perform match fixing with the support of internal participants are called external participants and they use information given to them by internal participants to conduct betting and fixing activities. Some important game plan information are pitch report, weather report, team composition, team batting strategy, field placement, and team bowling strategy. In this paper we focus our attention on match fixing network analysis using internal participants.
引用
收藏
页码:1043 / 1048
页数:6
相关论文
共 50 条