Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2939672.2939875acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Recurrent Marked Temporal Point Processes: Embedding Event History to Vector

Published: 13 August 2016 Publication History

Abstract

Large volumes of event data are becoming increasingly available in a wide variety of applications, such as healthcare analytics, smart cities and social network analysis. The precise time interval or the exact distance between two events carries a great deal of information about the dynamics of the underlying systems. These characteristics make such data fundamentally different from independently and identically distributed data and time-series data where time and space are treated as indexes rather than random variables. Marked temporal point processes are the mathematical framework for modeling event data with covariates. However, typical point process models often make strong assumptions about the generative processes of the event data, which may or may not reflect the reality, and the specifically fixed parametric assumptions also have restricted the expressive power of the respective processes. Can we obtain a more expressive model of marked temporal point processes? How can we learn such a model from massive data?
In this paper, we propose the Recurrent Marked Temporal Point Process (RMTPP) to simultaneously model the event timings and the markers. The key idea of our approach is to view the intensity function of a temporal point process as a nonlinear function of the history, and use a recurrent neural network to automatically learn a representation of influences from the event history. We develop an efficient stochastic gradient algorithm for learning the model parameters which can readily scale up to millions of events. Using both synthetic and real world datasets, we show that, in the case where the true models have parametric specifications, RMTPP can learn the dynamics of such models without the need to know the actual parametric forms; and in the case where the true models are unknown, RMTPP can also learn the dynamics and achieve better predictive performance than other parametric alternatives based on particular prior assumptions.

References

[1]
O. Aalen, O. Borgan, and H. Gjessing. Survival and event history analysis: a process point of view. Springer, 2008.
[2]
E. Bacry, A. Iuga, M. Lasnier, and C.-A. Lehalle. Market impacts and the life cycle of investors orders. 2014.
[3]
E. Bacry, T. Jaisson, and J.-F. Muzy. Estimation of slowly decreasing hawkes kernels: Application to high frequency order book modelling. 2015.
[4]
R. Begleiter, R. El-Yaniv, and G. Yona. On prediction using variable order markov models. J. Artif. Intell. Res. (JAIR), 22:385--421, 2004.
[5]
K. Cho, B. van Merrienboer, D. Bahdanau, and Y. Bengio. On the properties of neural machine translation: Encoder-decoder approaches. CoRR, abs/1409.1259, 2014.
[6]
D. Daley and D. Vere-Jones. An introduction to the theory of point processes: volume II: general theory and structure, volume 2. Springer, 2007.
[7]
N. Du, M. Farajtabar, A. Ahmed, A. J. Smola, and L. Song. Dirichlet-hawkes processes with applications to clustering continuous-time document streams. In KDD. ACM, 2015.
[8]
N. Du, L. Song, M. Gomez-Rodriguez, and H. Zha. Scalable influence estimation in continuous-time diffusion networks. In NIPS, 2013.
[9]
N. Du, L. Song, A. J. Smola, and M. Yuan. Learning networks of heterogeneous influence. In NIPS, 2012.
[10]
N. Du, L. Song, H. Woo, and H. Zha. Uncover topic-sensitive information diffusion networks. In Artificial Intelligence and Statistics (AISTATS), 2013.
[11]
N. Du, Y. Wang, N. He, and L. Song. Time-sensitive recommendation from recurrent user activities. In NIPS, 2015.
[12]
R. F. Engle and J. R. Russell. Autoregressive conditional duration: A new model for irregularly spaced transaction data. Econometrica, 66(5):1127--1162, Sep 1998.
[13]
M. Farajtabar, N. Du, M. Gomez-Rodriguez, I. Valera, H. Zha, and L. Song. Shaping social activity by incentivizing users. In NIPS, 2014.
[14]
M. Farajtabar, M. Gomez-Rodriguez, N. Du, M. Zamani, H. Zha, and L. Song. Back to the past: Source identification in diffusion networks from partially observed cascades. In AISTAT, 2015.
[15]
A. Ferraz Costa, Y. Yamaguchi, A. Juci Machado Traina, C. Traina, Jr., and C. Faloutsos. Rsc: Mining and modeling temporal activity in social media. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '15, pages 269--278, 2015.
[16]
M. Gomez-Rodriguez, D. Balduzzi, and B. Schölkopf. Uncovering the temporal dynamics of diffusion networks. In Proceedings of the International Conference on Machine Learning, 2011.
[17]
S. Grant and B. Betts. Encouraging user behaviour with achievements: an empirical study. In Mining Software Repositories (MSR), 2013 10th IEEE Working Conference on, pages 65--68. IEEE, 2013.
[18]
A. Graves, M. Liwicki, S. Fernandez, R. Bertolami, H. Bunke, and J. Schmidhuber. A novel connectionist system for uncon- strained handwriting recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, pages 855--868, 2009.
[19]
A. G. Hawkes. Point spectra of some mutually exciting point processes. Journal of the Royal Statistical Society Series B, 33:438--443, 1971.
[20]
A. G. Hawkes. Spectra of some self-exciting and mutually exciting point processes. Biometrika, 58(1):83--90, 1971.
[21]
A. G. Hawkes and D. Oakes. A cluster process representation of a self-exciting process. Journal of Applied Probability, pages 493--503, 1974.
[22]
X. He, T. Rekatsinas, J. Foulds, L. Getoor, and Y. Liu. Hawkestopic: A joint model for network inference and topic modeling from text-based cascades. In ICML, pages 871--880, 2015.
[23]
S. Hochreiter and J. Schmidhuber. Long short-term memory. Neural computation, 9(8):1735--1780, 1997.
[24]
O. V. Ilya Sutskever and Q. V. Le. Sequence to sequence learning with neural networks. 2014.
[25]
V. Isham and M. Westcott. A self-correcting pint process. Advances in Applied Probability, 37:629--646, 1979.
[26]
J. Janssen and N. Limnios. Semi-Markov Models and Applications. Kluwer Academic, 1999.
[27]
J. Kingman. On doubly stochastic poisson processes. Mathematical Proceedings of the Cambridge Philosophical Society, pages 923--930, 1964.
[28]
J. F. C. Kingman. Poisson processes, volume 3. Oxford university press, 1992.
[29]
R. D. Malmgren, D. B. Stouffer, A. E. Motter, and L. A. N. Amaral. A Poissonian explanation for heavy tails in e-mail communication. Proceedings of the National Academy of Sciences, 105(47):18153--18158, 2008.
[30]
H. Min, X. Jiahui, X. Shiguo, and Y. Fuliang. Prediction of chaotic time series based on the recurrent predictor neural network. IEEE Transactions on Signal Processing, 52:3409--3416, 2004.
[31]
Y. Ogata. Space-time point-process models for earthquake occurrences. Annals of the Institute of Statistical Mathematics, 50(2):379--402, 1998.
[32]
W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C. The Art of Scientific Computation. Cambridge University Press, Cambridge, UK, 1994.
[33]
J. G. Rasmussen. Temporal point processes: the conditional intensity function. http://people.math.aau.dk/~jgr/teaching/punktproc11/tpp.pdf, 2009.
[34]
C. Rohitash and Z. Mengjie. Cooperative coevolution of elman recurrent neural networks for chaotic time series prediction. Neurocomputing, 86:116--123, 2012.
[35]
M. Short, G. Mohler, P. Brantingham, and G. Tita. Gang rivalry dynamics via coupled point process networks. Discrete and Continuous Dynamical Systems Series B, 19:1459--1477, 2014.
[36]
H. T. Siegelmann and E. D. Sontag. Turing computability with neural nets. Applied Mathematics Letters, 4:77--80, 1991.
[37]
I. Sutskever, J. Martens, G. E. Dahl, and G. E. Hinton. On the importance of initialization and momentum in deep learning. In S. Dasgupta and D. Mcallester, editors, Proceedings of the 30th International Conference on Machine Learning (ICML-13), volume 28, pages 1139--1147. JMLR Workshop and Conference Proceedings, May 2013.
[38]
O. Vinyals, A. Toshev, S. Bengio, and D. Erhan. Show and tell: A neural image caption generator. IEEE Conference on Computer Vision and Pattern Recognition, pages 3156--3164, 2015.
[39]
C. Xindi, Z. Nian, V. Ganesh K., and W. I. Donald C. Time series prediction with recurrent neural networks trained by a hybrid psoea algorithm. Neurocomputing, 70:2342--2353, 2007.
[40]
Q. Zhao, M. A. Erdogdu, H. Y. He, A. Rajaraman, and J. Leskovec. Seismic: A self-exciting point process model for predicting tweet popularity. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '15, pages 1513--1522, 2015.

Cited By

View all

Index Terms

  1. Recurrent Marked Temporal Point Processes: Embedding Event History to Vector

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    KDD '16: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
    August 2016
    2176 pages
    ISBN:9781450342322
    DOI:10.1145/2939672
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 13 August 2016

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. marked temporal point process
    2. recurrent neural network
    3. stochastic process

    Qualifiers

    • Research-article

    Conference

    KDD '16
    Sponsor:

    Acceptance Rates

    KDD '16 Paper Acceptance Rate 66 of 1,115 submissions, 6%;
    Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)388
    • Downloads (Last 6 weeks)56
    Reflects downloads up to 26 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Predicting Question Popularity for Community Question AnsweringElectronics10.3390/electronics1316326013:16(3260)Online publication date: 16-Aug-2024
    • (2024)Bayesian estimation of nonlinear Hawkes processesBernoulli10.3150/23-BEJ163130:2Online publication date: 1-May-2024
    • (2024)Causal Discovery from Temporal Data: An Overview and New PerspectivesACM Computing Surveys10.1145/3705297Online publication date: 23-Nov-2024
    • (2024)Utilizing Functional-MLP for Point Process Encoding in a Variational AutoencoderProceedings of the 2024 3rd Asia Conference on Algorithms, Computing and Machine Learning10.1145/3654823.3654844(109-115)Online publication date: 22-Mar-2024
    • (2024)Tapestry of Time and Actions: Modeling Human Activity Sequences using Temporal Point Process FlowsACM Transactions on Intelligent Systems and Technology10.1145/3650045Online publication date: 29-Feb-2024
    • (2024)MoMENt: Marked Point Processes with Memory-Enhanced Neural Networks for User Activity ModelingACM Transactions on Knowledge Discovery from Data10.1145/364950418:6(1-32)Online publication date: 29-Feb-2024
    • (2024)Citation Forecasting with Multi-Context Attention-Aided Dependency ModelingACM Transactions on Knowledge Discovery from Data10.1145/364914018:6(1-23)Online publication date: 12-Apr-2024
    • (2024)Interpretable Transformer Hawkes Processes: Unveiling Complex Interactions in Social NetworksProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671720(2200-2211)Online publication date: 25-Aug-2024
    • (2024)Weather Knows What Will Occur: Urban Public Nuisance Events Prediction and Control with Meteorological AssistanceProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671639(6037-6048)Online publication date: 25-Aug-2024
    • (2024)Temporal Uplift Modeling for Online MarketingProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671560(6247-6256)Online publication date: 25-Aug-2024
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media