Linear Additive Markov Processes
Authors: Ravi Kumar
Liked by:
Domains: Data mining
Tags: WWW2017
Uploaded by: Open Reading Group
Upload date: 2018-01-12 15:17:41

Comments:

The paper is about a scalable alternative to $k$-order Markov process called k-LAMP. k-LAMP only needs $nnz(T)+k$ (where $T$ is the transition matrix and $nnz(T)$ is the number of nonzero entries in $T$) parameters, while $k$-order Markov process needs as many parameters as the number of paths of length $k+1$ in $T$. A generalized version called $k$-GLAMP is also suggested, it needs $k*nnz(T)+k$ parameters. An experimental comparison to Markov process and LSTM (Long-Short-Term-Memory) seems convincing. ### Typos: - page 5, Theorem 11: "\n this version.)"

You comment anonymously! You will not be able to edit/delete the comment.

Please consider to register or login.

Use $\LaTeX$ to type formulæ and markdown to format text.
When you post something to which you hold the copyright you authorise us to do distribute this data across the scientific community. You can post public domain content. All user-generated content will be freely available online. Please see this page to learn more about Papersγ's terms of use and privacy policy.