Collusion set detection using graph clustering

Data Mining and Knowledge Discovery

Volumn 16, Issue 2, 2008, Pages 135-164

  Palshikar, Girish Keshav ^a   Apte, Manoj M ^b  

^a TATA RESEARCH DEVELOPMENT AND DESIGN CENTRE   (India)

^b TATA CONSULTANCY SERVICES   (India)

Author keywords

Clustering; Collusion set; Fraud detection; Graph clustering

Indexed keywords

COMPUTER SIMULATION; DATA STRUCTURES; FINANCIAL DATA PROCESSING; GRAPH THEORY; SECURITY OF DATA;

COLLUSION SET DETECTION; FRAUD DETECTION; GRAPH CLUSTERING;

CLUSTERING ALGORITHMS;

EID: 38749116630     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-007-0076-8     Document Type: Article

References (14)

1. Bapeswara Rao VV and Sankara Rao K (1985). Enumeration of Hamiltonian circuits in digraphs. Proc. IEEE 73: 1524-1525
2. Gowda KC and Krishna G (1978). Agglomerative clustering using the concept of mutual nearest neighborhood. Pattern Recogn 10: 105-112
3. Honkanen PA (1978) Circuit enumeration in an undirected graph. In: Proceedings of the 16th ACM southeast regional conference, pp 49-53
4. Jain AK, Duin RPW and Mao J (2000). Statistical pattern recognition: a review. IEEE Trans Pattern Anal Machine Intelligence 22(1): 4-37
5. Jain AK, Murty MN and Flynn PJ (1999). Data clustering: a review. ACM Comput Surv 31(3): 264-323
6. Jarvis RA and Patrick EA (1973). Clustering using a similarity measure based on shared nearest neighbors. IEEE Trans Comput C-22(11): 1025-1034
7. Le Hegarat-Mascle S, Richard D and Ottle C (2003). Multi-scale data fusion using Dempster-Shafer evidence theory. Integr Comput-Aid Eng 10: 9-22
8. Palshikar GK, Bahulkar A (2000) Fuzzy temporal patterns for analysing stock market databases. In Proceedings of the international conference on advances in data management (COMAD-2000), Pune, India, Tata-McGraw Hill, pp 135-142
9. Palshikar GK, Apte MM (2005) Collusion set detection using graph clustering. In: Proceedings of the conference management of data (COMAD 2005b), Hyderabad, India, Computer Society of India, pp 101-111
10. Rich E, Knight D (1995) Artificial intelligence, 2/e. McGraw-Hill
11. Rubin F (1974). A search procedure for Hamilton paths and circuits. J ACM 21(4): 576-580
12. SEBI Order against DSQ Holdings dated 10th December 2004. Order No. CO/109/ISD/12/2004. http://www.sebi.gov.in
13. Shafer G (1976) A mathematical theory of evidence. Princeton University Press
14. Tarjan RE and Read RC (1975). Bounds on backtrack algorithm for listing cycles, paths and spanning trees. Networks 5: 237-252