Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IDA '01 Proceedings of the 4th International Conference on Advances in Intelligent Data Analysis
A reputation-based trust model for peer-to-peer ecommerce communities [Extended Abstract]
Proceedings of the 4th ACM conference on Electronic commerce
Computing Frequent Graph Patterns from Semistructured Data
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
GREW-A Scalable Frequent Subgraph Discovery Algorithm
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Finding Frequent Patterns in a Large Sparse Graph*
Data Mining and Knowledge Discovery
Netprobe: a fast and scalable system for fraud detection in online auction networks
Proceedings of the 16th international conference on World Wide Web
Fg-index: towards verification-free query processing on graph databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Graph Twiddling in a MapReduce World
Computing in Science and Engineering
An expert system for detecting automobile insurance fraud using social network analysis
Expert Systems with Applications: An International Journal
Truthy: mapping the spread of astroturf in microblog streams
Proceedings of the 20th international conference companion on World wide web
A temporal network analysis reveals the unprofitability of arbitrage in The Prosper Marketplace
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
The identification of anomalous user behaviour is important in a number of application areas, since it may be indicative of fraudulent activity. In the work presented here, the focus is on the identification and subsequent investigation of suspicious interactions in a network of financial transactions. A network is constructed from data from a peer-to-peer lending system, with links between members representing the initiation of loans. The network is time-sliced to facilitate temporal analysis. Anomalous network structure is sought in the time-sliced network, illustrating the occurrences of unusual behaviour among members. In order to assess the significance of the dense structures returned the enrichment of member attributes within these structures is examined. It seems that dense structures are associated with geographic regions.