Polyadic regression and its application to chemogenomics
Ioakeim Perros, Fei Wang, et al.
SDM 2017
How can we find communities in dynamic networks of socialinteractions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity time-points in such streams of graphs, in an on-line, any-time fashion? We propose GraphScope, that addresses both problems, using information theoretic principles. Contrary to the majority of earlier methods, it needs no user-defined parameters. Moreover, it is designed to operate on large graphs, in a streaming fashion. We demonstrate the efficiency and effectiveness of our GraphScope on real datasets from several diverse domains. In all cases it produces meaningful time-evolving patterns that agree with human intuition. © 2007 ACM.
Ioakeim Perros, Fei Wang, et al.
SDM 2017
Andrew Arnold, Yan Liu, et al.
KDD 2007
Xiaohui Gu, Spiros Papadimitriou, et al.
ICDCS 2008
Peng Cui, Huan Liu, et al.
IEEE Intelligent Systems