TY - GEN
T1 - Arrival rate approximation by nonnegative cubic splines
AU - Alizadeh, F.
AU - Eckstein, J.
AU - Noyan, N.
AU - Rudolf, G.
PY - 2005
Y1 - 2005
N2 - We describe an optimization method to approximate the arrival rate of data such as e-mail messages, website visits, changes to databases, and changes to websites mirrored by other servers. We model these arrival rates as non-homogeneous Poisson process based on observed arrival data. We estimate the arrival function by cubic splines using the maximum likelihood principle. A critical feature of the model is that the splines are constrained to be everywhere nonnegative. We formulate this constraint using a characterization of nonnegative polynomials by positive semidefinite matrices. We also describe versions of our model that allow for periodic arrival rate functions and input data of limited precision. We formulate the estimation problem as a convex program related to semidefinite programming and solve it with a standard nonlinear optimization package called KNITRO. We present numerical results using both an actual record of e-mail arrivals over a period of sixty weeks, and artificially generated data sets. We also present a cross-validation procedure for determining an appropriate number of spline knots to model a set of arrival observations.
AB - We describe an optimization method to approximate the arrival rate of data such as e-mail messages, website visits, changes to databases, and changes to websites mirrored by other servers. We model these arrival rates as non-homogeneous Poisson process based on observed arrival data. We estimate the arrival function by cubic splines using the maximum likelihood principle. A critical feature of the model is that the splines are constrained to be everywhere nonnegative. We formulate this constraint using a characterization of nonnegative polynomials by positive semidefinite matrices. We also describe versions of our model that allow for periodic arrival rate functions and input data of limited precision. We formulate the estimation problem as a convex program related to semidefinite programming and solve it with a standard nonlinear optimization package called KNITRO. We present numerical results using both an actual record of e-mail arrivals over a period of sixty weeks, and artificially generated data sets. We also present a cross-validation procedure for determining an appropriate number of spline knots to model a set of arrival observations.
KW - Database update frequency
KW - E-mail arrival rate
KW - Nonhomogeneous poisson process
KW - Semidefinite programming
KW - Spline approximation
UR - http://www.scopus.com/inward/record.url?scp=33947181896&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33947181896&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33947181896
SN - 0780392329
SN - 9780780392328
T3 - 2005 IEEE International Conference on Electro Information Technology
BT - 2005 IEEE International Conference on Electro Information Technology
T2 - 2005 IEEE International Conference on Electro Information Technology
Y2 - 22 May 2005 through 25 May 2005
ER -