Social network discovery by mining spatio-temporal events

被引：29
作者：
Lauw H.W. [1 ]
Lim E.-P. [1 ]
Pang H. [2 ]
Tan T.-T. [3 ]
机构：
[1] School of Computer Engineering, Nanyang Technological University, Singapore 639798, Nanyang Avenue
[2] School of Information Systems, Singapore Management University, Singapore 178902
[3] Centre for IT Services, Nanyang Technological University, Singapore 639798, Nanyang Avenue
来源：
Computational & Mathematical Organization Theory | 2005年 / 11卷 / 2期
关键词：
Data mining; Pattern discovery; Spatio-temporal analysis;
D O I：
10.1007/s10588-005-3939-9
中图分类号：
学科分类号：
摘要：
Knowing patterns of relationship in a social network is very useful for law enforcement agencies to investigate collaborations among criminals, for businesses to exploit relationships to sell products, or for individuals who wish to network with others. After all, it is not just what you know, but also whom you know, that matters. However, finding out who is related to whom on a large scale is a complex problem. Asking every single individual would be impractical, given the huge number of individuals and the changing dynamics of relationships. Recent advancement in technology has allowed more data about activities of individuals to be collected. Such data may be mined to reveal associations between these individuals. Specifically, we focus on data having space and time elements, such as logs of people's movement over various locations or of their Internet activities at various cyber locations. Reasoning that individuals who are frequently found together are likely to be associated with each other, we mine from the data instances where several actors co-occur in space and time, presumably due to an underlying interaction. We call these spatio-temporal co-occurrences events, which we use to establish relationships between pairs of individuals. In this paper, we propose a model for constructing a social network from events, and provide an algorithm that mines these events from the data. Experiments on a real-life data tracking people's accesses to cyber locations have also yielded encouraging results. © 2005 Springer Science + Business Media, Inc.
引用
收藏
页码：97 / 118
页数：21
相关论文
共 32 条
[1]  
Adamic L.A., Adar E., Friends and Neighbors on the Web, Social Networks, 25, 3, pp. 211-230, (2003)
[2]  
Agrawal R., Rajagopalan S., Srikant R., Xu Y., Mining Newsgroups Using Networks Arising from Social Behavior, Proceedings of the 12th International World Wide Web Conference, pp. 688-703, (2003)
[3]  
Agrawal R., Srikant R., Fast Algorithm for Mining Association Rules, Proceedings of the 20th International Conference on Very Large Databases, pp. 487-499, (1994)
[4]  
Agrawal R., Srikant R., Mining Sequential Patterns, Proceedings of the 11th International Conference on Data Engineering, pp. 3-14, (1995)
[5]  
Berry M.W., Browne M., Email Surveillance Using Nonnegative Matrix Factorization, Proceedings of the Workshop on Link Analysis, Counterterrorism, and Security (in Conj. With SIAM International Conference on Data Mining), pp. 45-54, (2005)
[6]  
Boyd D.M., Friendster and Publicly Articulated Social Networking, Extended Abstracts of the Conference on Human Factors and Computing Systems, pp. 1279-1282, (2004)
[7]  
Carley K., A Theory of Group Stability, American Sociological Review, 56, 3, pp. 331-354, (1991)
[8]  
Chapanond A., Krishnamoorthy M.S., Yener B., Graph Theoretic and Spectral Analysis of Enron Email Data, Proceedings of the Workshop on Link Analysis, Counterterrorism, and Security (in Conj. With SIAM International Conference on Data Mining), pp. 15-22, (2005)
[9]  
Das G., Lin K., Mannila H., Renganathan G., Smyth P., Rule Discovery from Time Series, Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, pp. 27-31, (1998)
[10]  
Diesner J., Carley K.M., Exploration of Communication Networks from the Enron Email Corpus, Proceedings of the Workshop on Link Analysis, Counterterrorism, and Security (in Conj. With SIAM International Conference on Data Mining), pp. 3-14, (2005)
1234