Collusion set detection using graph clustering
暂无分享,去创建一个
[1] V.V.B. Rao,et al. Enumeration of Hamiltonian circuits in digraphs , 1985, Proceedings of the IEEE.
[2] G. Krishna,et al. Agglomerative clustering using the concept of mutual nearest neighbourhood , 1978, Pattern Recognit..
[3] Glenn Shafer,et al. A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.
[4] Pentti A. Honkanen. Circuit enumeration in an undirected graph , 1978, ACM-SE.
[5] Anil K. Jain,et al. Statistical Pattern Recognition: A Review , 2000, IEEE Trans. Pattern Anal. Mach. Intell..
[6] R. Jarvis,et al. ClusteringUsing a Similarity Measure Based on SharedNear Neighbors , 1973 .
[7] PalshikarGirish Keshav,et al. Collusion set detection using graph clustering , 2008 .
[8] Girish Keshav Palshikar,et al. Fuzzy Temporal Patterns for Analyzing Stock Market Databases , 2000 .
[9] Catherine Ottlé,et al. Multi-scale data fusion using Dempster-Shafer evidence theory , 2003 .
[10] Frank Rubin,et al. A Search Procedure for Hamilton Paths and Circuits , 1974, JACM.
[11] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.
[12] Robert E. Tarjan,et al. Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees , 1975, Networks.