Matrix computations (3rd ed.)
A Multilinear Singular Value Decomposition
SIAM Journal on Matrix Analysis and Applications
Distributed clustering using collective principal component analysis
Knowledge and Information Systems
Modeling and multiway analysis of chatroom tensors
ISI'05 Proceedings of the 2005 IEEE international conference on Intelligence and Security Informatics
Temporal Link Prediction Using Matrix and Tensor Factorizations
ACM Transactions on Knowledge Discovery from Data (TKDD)
Link prediction on evolving data using tensor factorization
PAKDD'11 Proceedings of the 15th international conference on New Frontiers in Applied Data Mining
| Hi-index | 0.00 |
This work investigates the accuracy and efficiency tradeoffs between centralized and collective (distributed) algorithms for (i) sampling, and (ii) n-way data analysis techniques in multidimensional stream data, such as Internet chatroom communications. Its contributions are threefold. First, we use the Kolmogorov-Smirnov goodness-of-fit test to show that statistical differences between real data obtained by collective sampling in time dimension from multiple servers and that of obtained from a single server are insignificant. Second, we show using the real data that collective data analysis of 3-way data arrays (users x keywords x time) known as high order tensors is more efficient than centralized algorithms with respect to both space and computational cost. Furthermore, we show that this gain is obtained without loss of accuracy. Third, we examine the sensitivity of collective constructions and analysis of high order data tensors to the choice of server selection and sampling window size. We construct 4-way tensors (users x keywords x time x servers) and analyze them to show the impact of server and window size selections on the results.