Abstract
Temporal Data Mining is directed at the identification of knowledge that has some temporal dimension. This paper reports on work conducted to identify temporal frequent patterns in social network data. The focus for the work is the cattle movement database in operation in Great Britain, which can be interpreted as a social network with additional spatial and temporal information. The paper firstly proposes a trend mining framework for identifying frequent pattern trends. Experiments using this framework demonstrate that in many cases a large number of patterns may be produced, and consequently the analysis of the end result is inhibited. To assist in the analysis of the identified trends this paper secondly proposes a trend clustering approach, founded on the concept of Self Organizing Maps (SOMs), to group similar trends and to compare such groups. A distance function is used to compare and analyze the changes in clusters with respect to time.
Chapter PDF
References
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proceedings of ACM SIGMOD Conference (1993)
Agrawal, R., Srikant, R.: Mining sequential patterns. In: 11th International Conference on Data Engineering (1995)
Antunes, C.M., Oliveira, A.L.: Temporal Data Mining: An Overview. In: Proc. ACM SIGKDD Workshop Data Mining, August 2001, pp. 1–13 (August 2001)
Brockwell, P., Davis, R.: Time Series:Theory and Methods. Springer, Heidelberg (2001)
Coenen, F.P., Goulbourne, G., Leng, P.: ComputingAssociation Rules Using Partial Totals. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol. 2168, pp. 54–66. Springer, Heidelberg (2001)
Denny, Williams, G.J., Christen, P.: ReDSOM: relative density visualization of temporal changes in cluster structures using self-organizing maps. In: IEEE International Conference on Data Mining (ICDM), pp. 173–182. IEEE Computer Society, Los Alamitos (2008)
Dong, G., Li, J.: Efficient Mining of Emerging Patterns: Discovering Trends and Differences. In: Proceeding of Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (1999)
Hido, S., Idé, T., Kashima, H., Kubo, H., Matsuzawa, H.: Unsupervised changes analysis using supervised learning. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 148–159. Springer, Heidelberg (2008)
Keogh, E., Kasetty, S.: On the need for Time Series Data Mining Benchmarks: A Survey and Empirical Demostration. Data Mining and Knowledge Discovery 7(4), 349–371 (2003)
Kohonen, T.: The Self Organizing Maps. Neurocomputing 21, 1–6 (1998)
Lingras, P., Hogo, M., Snorek, M.: Temporal Cluster Migration Matrices for Web Usage Mining. In: Proceedings of IEEE/WIC/ACM International Conference on Web Intelligence (2004)
Mannila, H., Toivonen, H., Verkamo, A.: Discovery of Frequent Episodes in Event Sequences. Data Mining and Knowledge Discovery 1, 259–289 (1997)
Roddick, J., Spiliopoulou, M.: A Survey of Temporal Knowledge Discovery Paradigms and Methods. IEEE Trans. Knowledge and Data Eng. 14(4), 750–767 (2002)
Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, New York (2006)
Zaki, M.: SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning 42(1-2), 31–60 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP International Federation for Information Processing
About this paper
Cite this paper
Nohuddin, P.N.E., Coenen, F., Christley, R., Setzkorn, C. (2010). Detecting Temporal Pattern and Cluster Changes in Social Networks: A Study Focusing UK Cattle Movement Database. In: Shi, Z., Vadera, S., Aamodt, A., Leake, D. (eds) Intelligent Information Processing V. IIP 2010. IFIP Advances in Information and Communication Technology, vol 340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16327-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-16327-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16326-5
Online ISBN: 978-3-642-16327-2
eBook Packages: Computer ScienceComputer Science (R0)