Poisson Networks
Up
PAC-Bayesian
Bayesian Transduction
Bayes Point Machines
Adatpive Margin Machines
Sparsity
Ordinal Regression
Proximity Learning
Performance Assessment
Concept Learning
Ripple Down Rules
Algorithmic Luckiness
Semidefinite Programming
Informative Vector Machines
Learning to Fight
ROC Curve Bounds
Poisson Networks
Approximate Bayesian Inference
Drivatars

 

 

Poisson Networks

Modelling structured multivariate point process data has wide ranging applications like understanding neural activity, developing faster file access systems and learning dependencies among servers in large networks. In this project, we develop the Poisson network model for representing multivariate structured Poisson processes. In our model each node of the network represents a Poisson process. The novelty of our work is that waiting times of a process are modelled by an exponential distribution with a piecewise constant rate function that depends on the event counts of its parents in the network in a generalised linear way. Our choice of model allows to perform exact sampling from arbitrary structures. We adopt a Bayesian approach for learning the network structure. We also develop fixed point and sampling based approximations for performing inference of rate functions in Poisson networks.
 

References

  • Shyamsundar Rajaram, Thore Graepel and Ralf Herbrich. Poisson Networks: A Model for Structured Point Processes. Proceedings of the AI STATS 2005 Workshop, 2005. (PDF)

Up | PAC-Bayesian | Bayesian Transduction | Bayes Point Machines | Adatpive Margin Machines | Sparsity | Ordinal Regression | Proximity Learning | Performance Assessment | Concept Learning | Ripple Down Rules | Algorithmic Luckiness | Semidefinite Programming | Informative Vector Machines | Learning to Fight | ROC Curve Bounds | Poisson Networks | Approximate Bayesian Inference | Drivatars

This site was last updated 07-07-2005