28 March 2005 Comparing various algorithms for discovering social groups with uni-party data
Author Affiliations +
The challenge of identifying important individuals and their membership as part of a group is a continuing and ever growing problem. In recent years, the data mining community has been identifying and discussing a new paradigm of data analysis using uni-party data. Within this paradigm, a methodology known as Link Discovery based on Correlation Analysis (LDCA), defines a process to compensate for the lack of relational data. CORAL, a specific implementation of LDCA, demonstrated the value of this methodology by identifying suspects involved in a Ponzi scheme with limited success. This paper introduces several new algorithms and analyzes their ability to generate a prioritized ranking of individuals involved in the Ponzi scheme based on their individual activity. To compare the accuracy of each algorithm, we present the experimental results of the algorithms, and conclude with a discussion of open issues and future activities.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
John J. Salerno, Raymond A. Cardillo, Zhongfei Mark Zhang, "Comparing various algorithms for discovering social groups with uni-party data", Proc. SPIE 5812, Data Mining, Intrusion Detection, Information Assurance, and Data Networks Security 2005, (28 March 2005); doi: 10.1117/12.603680; https://doi.org/10.1117/12.603680


Searching social networks for subgraph patterns
Proceedings of SPIE (June 06 2013)
Performance evaluation of two Arabic OCR products
Proceedings of SPIE (January 29 1999)
Detecting people of interest from internet data sources
Proceedings of SPIE (April 18 2006)
Parallel visual information retrieval in VizIR
Proceedings of SPIE (October 25 2004)
Active response technology
Proceedings of SPIE (August 14 2002)
Universal visualization platform
Proceedings of SPIE (March 11 2005)
Visual data mining
Proceedings of SPIE (October 25 2004)

Back to Top