Temporal relation co-clustering on directional social network and author-topic evolution

Analyzing three-way data has attracted a lot of attention recently because such data have intrinsic rich structures and naturally appear in many real-world applications. One typical type of three-way data is multiple two-way data/matrices with different time periods, for example, authors’ publication key terms and people’s email correspondence varying with the time. We propose to use the PARATUCKER model to analyze three-way data. The PARATUCKER model combines the axis capabilities of the Parafac model and the structural generality of the Tucker model and thus can be viewed as the combination of Tucker and Parafac. It does not require the symmetry of the data nor the same dimensionality of mode 1 and mode 2. However, no algorithms have been developed for fitting the PARATUCKER model, especially for obtaining non-negative solutions that are intuitive to understand and explain. In this paper, we propose TANPT: a three-way alternating non-negative algorithm to fit the PARATUCKER model. We apply the algorithm to temporal relation co-clustering on directional social network and author-topic evolution. Experiments on real-world datasets (DBLP and Enron Email datasets) demonstrate that our proposed algorithm achieves better clustering performance than other well-known methods and also discovers some interesting patterns.

[1]  R. Harshman,et al.  Uniqueness proof for a family of models sharing features of Tucker's three-mode factor analysis and PARAFAC/candecomp , 1996 .

[2]  Tamara G. Kolda,et al.  Orthogonal Tensor Decompositions , 2000, SIAM J. Matrix Anal. Appl..

[3]  Jing Hua,et al.  Non-negative matrix factorization for semi-supervised data clustering , 2008, Knowledge and Information Systems.

[4]  David E. Booth,et al.  Multi-Way Analysis: Applications in the Chemical Sciences , 2005, Technometrics.

[5]  R. Harshman,et al.  PARAFAC: parallel factor analysis , 1994 .

[6]  Daniel D. Lee,et al.  Multiplicative Updates for Nonnegative Quadratic Programming in Support Vector Machines , 2002, NIPS.

[7]  Inderjit S. Dhillon,et al.  Information-theoretic co-clustering , 2003, KDD '03.

[8]  Rasmus Bro,et al.  Multi-way Analysis with Applications in the Chemical Sciences , 2004 .

[9]  Springer-Verlag London Limited.  Temporal relation co-clustering on directional social network and author-topic evolution , 2010 .

[10]  C. Ding,et al.  Two-Dimensional Singular Value Decomposition ( 2 DSVD ) for 2 D Maps and Images , 2005 .

[11]  Ruoming Jin,et al.  Data discretization unification , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[12]  C. G. Broyden.  The Convergence of a Class of Double-rank Minimization Algorithms 2. The New Algorithm , 1970 .

[13]  Joydeep Ghosh,et al.  Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..

[14]  Narendra Ahuja,et al.  Rank-R approximation of tensors using image-as-matrix representation , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[15]  Michael W. Berry,et al.  Algorithms and applications for approximate nonnegative matrix factorization , 2007, Comput. Stat. Data Anal..

[16]  Huan Liu,et al.  CubeSVD: a novel approach to personalized Web search , 2005, WWW '05.

[17]  Tamara G. Kolda,et al.  Temporal Analysis of Semantic Graphs Using ASALSAN , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[18]  Terrill L. Frantz,et al.  Communication Networks from the Enron Email Corpus “It's Always About the People. Enron is no Different” , 2005, Comput. Math. Organ. Theory.

[19]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[20]  Brett W. Bader,et al.  The TOPHITS Model for Higher-Order Web Link Analysis∗ , 2006 .

[21]  Michael W. Berry,et al.  Text Mining Using Non-Negative Matrix Factorizations , 2004, SDM.

[22]  R. Plemmons,et al.  Optimality, computation, and interpretation of nonnegative matrix factorizations , 2004 .

[23]  Chris H. Q. Ding,et al.  Bipartite graph partitioning and data clustering , 2001, CIKM '01.

[24]  Chris H. Q. Ding,et al.  Nonnegative Lagrangian Relaxation of K-Means and Spectral Clustering , 2005, ECML.

[25]  Vasileios Kandylas,et al.  Finding cohesive clusters for analyzing knowledge communities , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[26]  Richard A. Harshman,et al.  Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-model factor analysis , 1970 .

[27]  David G. Stork,et al.  Pattern Classification (2nd ed.) , 1999 .

[28]  Maurizio Vichi,et al.  Simultaneous Component and Clustering Models for Three-way Data: Within and Between Approaches , 2007, J. Classif..

[29]  Demetri Terzopoulos,et al.  Multilinear Analysis of Image Ensembles: TensorFaces , 2002, ECCV.

[30]  Bülent Yener,et al.  Modeling and Multiway Analysis of Chatroom Tensors , 2005, ISI.

[31]  L. Tucker,et al.  Some mathematical notes on three-mode factor analysis , 1966, Psychometrika.

[32]  Tao Li,et al.  A general model for clustering binary data , 2005, KDD '05.

[33]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[34]  Tao Li,et al.  Clustering based on matrix approximation: a unifying view , 2008, Knowledge and Information Systems.

[35]  Tamir Hazan,et al.  Non-negative tensor factorization with applications to statistics and computer vision , 2005, ICML.

[36]  Inderjit S. Dhillon,et al.  Minimum Sum-Squared Residue Co-Clustering of Gene Expression Data , 2004, SDM.

[37]  C. G. Broyden.  The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations , 1970 .

[38]  Wei Peng,et al.  Author-topic evolution analysis using three-way non-negative Paratucker , 2008, SIGIR '08.

[39]  H. Kiers.  An alternating least squares algorithms for PARAFAC2 and three-way DEDICOM , 1993 .

[40]  Gene H. Golub,et al.  Rank-One Approximation to High Order Tensors , 2001, SIAM J. Matrix Anal. Appl..

[41]  E. Chong,et al.  Introduction to optimization , 1987 .

[42]  David G. Stork,et al.  Pattern Classification , 1973 .

[43]  Bülent Yener,et al.  Unsupervised Multiway Data Analysis: A Literature Survey , 2009, IEEE Transactions on Knowledge and Data Engineering.

[44]  Inderjit S. Dhillon,et al.  Generalized Nonnegative Matrix Approximations with Bregman Divergences , 2005, NIPS.

[45]  G. W. Milligan,et al.  A Study of the Comparability of External Criteria for Hierarchical Cluster Analysis. , 1986, Multivariate behavioral research.

[46]  Inderjit S. Dhillon,et al.  Co-clustering documents and words using bipartite spectral graph partitioning , 2001, KDD '01.

[47]  Chris H. Q. Ding,et al.  Orthogonal nonnegative matrix t-factorizations for clustering , 2006, KDD '06.