Translator Disclaimer
12 April 2004 Discovering social groups without having relational data
Author Affiliations +
Abstract
Who is associated with whom? Who communicates with whom? When two or more individuals get together is there an intended purpose? Who are the leaders/important individuals of the group? What is the organizational structure of the group? These are just a few of the questions that are covered under the topic of social network analysis. Data mining, specifically community generation, attempts to automatically discover and learn these social models. In this paper we present one class of problems which we have called the uni-party data community generation paradigm. We discuss various applications, a methodology and results from two problem domains.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
John Salerno, Zhongfei Zhang, Ronny Lewin, and Michael Decker "Discovering social groups without having relational data", Proc. SPIE 5433, Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI, (12 April 2004); https://doi.org/10.1117/12.542920
PROCEEDINGS
8 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

A data mining approach to intelligence operations
Proceedings of SPIE (March 17 2008)
Model construction with key identification
Proceedings of SPIE (February 25 1999)
Guided text analysis using adaptive visual analytics
Proceedings of SPIE (January 24 2012)

Back to Top