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

Knowledge and Information Systems

Volumn 26, Issue 3, 2011, Pages 467-486

  Peng, Wei ^a   Li, Tao ^b  

^a XEROX CORPORATION   (United States)

^b The Department of Electrical and Computer Engineering   (United States)

Author keywords

Co clustering; Tensor factorization; Three way data

Indexed keywords

ELECTRONIC MAIL;

CO-CLUSTERING; NON NEGATIVES; NON-NEGATIVE SOLUTIONS; REAL-WORLD DATASETS; RICH STRUCTURE; TEMPORAL RELATION; TENSOR FACTORIZATION; THREE WAY DATA;

CLUSTERING ALGORITHMS;

EID: 79951511726     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-010-0289-9     Document Type: Article

References (45)

1. Acar E, Yener B (2007) Unsupervised multiway data analysis: A literature survey, Technical report, Computer Science Department, Rensselaer Polytechnic Institute
2. Smilde A, Bro R, Geladi P (2004) Multi-way analysis: applications in the chemical sciences. Wiley, New York
3. Bader BW, Harshman RA, Kolda TG (2007) Temporal analysis of semantic graphs using asalsan. In: Proceedings of the ICDM07. pp 33-42
4. Berry M, Browne M, Langville A, Pauca P, Plemmons R (2006) Algorithms and applications for approximate nonnegative matrix factorization. Comput Stat Data Anal 52:155-173
5. Broyden CG (1970) The convergence of a class of double-rank minimization algorithms. J Inst Math Appl 6:76-90
6. Chen Y, Rege M, Dong M, Hua J (2008) Non-negative matrix factorization for semi-supervised data clustering. Knowl Inf Syst 17(3):355-379
7. Cho H, Dhillon I, Guan Y, Sra S (2004) Minimum sum squared residue co-clustering of gene expression data. In: Proceedings of The 4th SIAM Data Mining Conference. pp 22-24
8. Chu M, Diele F, Plemmons R, Ragni S (2005) Optimality, computation and interpretation of nonnegative matrix factorizations. Preprint. Available online at http://www4.ncsu.edu/~mtchu/Research/Papers/nnmf.ps
9. Dhillon IS (2001) Co-clustering documents and words using bipartite spectral graph partitioning. Proc ACM Int'l Conf Knowledge Disc Data Mining (KDD 2001)
10. Dhillon IS, Mallela S, Modha DS (2003) Information-theoretic co-clustering. In: SIGKDD. pp 89-98
11. Dhillon I, Sra S (2005) Generalized nonnegative matrix approximations with Bregman divergences. In: Advances in Neural Information Processing Systems 17. MIT Press, Cambridge
12. Diesner J, Frantz TL, Carley KM (2005) Communication networks from the enron email corpus "it's always about the people. enron is no different". Comput Math Organ Theory 11(3)
13. Ding CHQ, He X, Simon HD (2005) Nonnegative lagrangian relaxation of k-means and spectral clustering. In: ECML 2005. pp 530-538
14. Ding C, Li T, Peng W, Park H (2006) Orthogonal nonnegative matrix t-factorizations for clustering. In: SIGKDD. pp 126-135
15. Ding C, Ye J (2005) Two-dimensional singular value decomposition (2dsvd) for 2d maps and images. In: SIAM International conference of Data Mining. pp 32-43
16. Duda RO, Hart PE, Stork DG (2000) Pattern classification (2nd edn). Wiley, New York
17. Evrim Acar SA, Camtepe MK, Yener B (2005) Modeling and multiway analysis of chatroom tensors. In: Proceedings of IEEE international conference on intelligence and security informatics
18. Milligan GW, CooperMC (1986) A study of the comparability of external criteria for hierarchical cluster analysis. Multivar Behav Res 21:846-850
19. Harshman R, Lundy M (1994) Parafac: parallel factor analysis. Comput Stat Data Anal 18(1):39-72
20. Harshman R, Lundy M (1996) Uniqueness proof for a family of models sharing features of tucker's three-mode factor analysis and parafac/candecomp. Psychometrika 61(1):133-154
21. Jin R, Breitbart Y, Muoh C (2009) Data discretization unification. Knowl Inf Syst 19(1):1-29
22. Kandylas V, Upham SP, Ungar LH (2008) Finding cohesive clusters for analyzing knowledge communities. Knowl Inf Syst 17(3):335-354
23. Kiers HAL (1993) An alternating least squares algorithm for parafac2 and three-way dedicom. Comput Stat Data Anal 16(1):103-118
24. Kolda T (2001) Orthogonal tensor decomposition. SIAM J Matrix Anal Appl 23:243-255
25. Kolda TG, Bader BW (2006) The tophits model for higher-order web link analysis. In: Workshop on Link Analysis, Counterterrorism and Security
26. P. Chong E, H. Zak S (2001) An introduction to optimization (2nd edn). John Wiley, New York
27. Lee DD, Seung SH (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788-791
28. Li T (2005) A general model for clustering binary data. In: KDD'05: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
29. Li T (2008) Clustering based on matrix approximation: a unifying view. Knowl Inf Syst 17(1):1-15
30. Tucker LR (1966) Some mathematical notes on three-mode factor analysis. Psychometrika 31:279-311
31. Norcedal J, J. Wright S. (1999) Numerical optimization. Springer, Berlin
32. Pauca VP, Shahnaz F, Berry M, Plemmons R (2004) Text mining using non-negative matrix factorization. In: Proceedings of SIAM international conference on Data Mining. pp 452-456
33. Peng W, Li T (2008) Author-topic evolution analysis using three-way non-negative paratucker. In: SIGIR'08: Proceedings of the 31st annual international ACM SIGIR conference on research and development in information retrieval. pp 819-820
34. Priebe C, Conroy J, Marchette D, Park Y (2006) Enron data set. Webpage
35. Harshman RA (1970) Foundations of the parafac procedure: models and conditions for an 'explanatory' multi-modal factor analysis. UCLA work pap phonetics 16:1-84
36. Sha F, Saul L, Lee D (2003) Multiplicative updates for nonnegative quadratic programming in support vector machines. In: Advances in Neural Information Processing Systems 15. pp 1041-1048
37. Shashua A, Hazan T (2005) Non-negative tensor factorization with applications to statistics and computer vision. In: ICML
38. Strehl A, Ghosh J (2002) Cluster ensembles-a knowledge reuse framework for combining multiple partitions. J Mach Learn Res (JMLR) 3:583-617
39. Sun J, Zeng H, Liu H, Lu Y, Chen Z (2005) Cubesvd: a novel approach to personalized web search. In: Proceedings of the 14th international conference on World Wide Web
40. Vasilescu MAO, Terzopoulos D (2002a) Multilinear analysis of image ensembles: Tensorfaces. In: ECCV'02-Part I. pp 447-460
41. Vasilescu MAO, Terzopoulos D (2002b) Multilinear analysis of image ensembles: Tensorfaces. In: Proceedings of the 7th European Conference on Computer Vision-Part I (ECCV'02). pp 447-460
42. Vichi M, Rocci R, Kiers HAL (2007) Simultaneous component and clusteringmodels for three-way data: within and between approaches. J Classif 24(1):71-98
43. Wang H, Ahuja N (2005) Rank-r approximation of tensors: Using image-as-matrix representation. In: CVPR'05 - Vol. 2. pp 346-353
44. Zha H, He X, Ding C, Gu M, Simon H (2001) Bipartite graph partitioning and data clustering. Proceedings of international Conference Information and Knowledge Management (CIKM 2001)
45. Zhang T, Golub G (2001) Rank-one approximation to high order tensor. SIAM J Matrix Anal Appl 23:534-550