# Self-Exciting Point Process Modeling of Crime

Save this PDF as:

Size: px
Start display at page:

## Transcription

2 Mohler et al.: Self-Exciting Point Process Modeling of Crime 101 Figure 1. On the left, histogram of times (less than 300 days) between Southern California earthquake events of magnitude 3.0 or greater separated by 110 kilometers or less. On the right, histogram of times (less than 50 days) between burglary events separated by 200 meters or less. In seismology a mark M k, the magnitude of the earthquake, is associated with each event (t k, x k, y k ) and the conditional intensity often takes the form λ(t, x, y, M) = j(m)λ(t, x, y), (2) λ(t, x, y) = μ(x, y) + {k:t k <t} g(t t k, x x k, y y k ; M k ). (3) Models of this type, referred to as Epidemic Type Aftershock- Sequences (ETAS) models, work by dividing earthquakes into two categories, background events and aftershock events. Background events occur independently according to a stationary Poisson process μ(x, y), with magnitudes distributed independently of μ according to j(m). Each of these earthquakes then elevates the risk of aftershocks and the elevated risk spreads in space and time according to the kernel g(t, x, y, M). Figure 2. Times of violent crimes between two rivalry gangs in Los Angeles. Many forms for g have been proposed in the literature, though in general the kernel is chosen such that the elevated risk increases with earthquake magnitude and decreases in space and time away from each event. For example, the isotropic kernel, g(t, x, y; M) = K 0 (t + c) p e α(m M 0) (x 2 + y 2 + d) q, (4) is one of a variety of kernels reviewed in Ogata (1998). Here K 0, M 0, and α are parameters that control the number of aftershocks, c and d are parameters that control the behavior of the kernel at the origin, and p and q are parameters that give the (power law) rate of decay of g. Standard models for the background intensity μ(x, y) include spline, kernel smoothing, and Voronoi estimation (Silverman 1986; Ogata and Katsura 1988; Okabe et al. 2000). In the case of fixed bandwidth kernel smoothing, the background intensity is estimated by μ(x, y) = μ u(x x k, y y k ; σ), (5) k where μ is a parameter controlling the overall background rate. The events (t k, x k, y k, M k ) are assumed to be background events and in practice can be obtained through a declustering algorithm (Zhuang, Ogata, and Vere-Jones 2002). The appropriate selection of parameter values is as critical to the modeling process as specifying accurate forms for μ, g, and j. The distance in space and time over which the risk spreads, the percentage of background events vs. aftershocks, the dependence of the increased risk on magnitude size, etc., all can have a great impact on the predictive power of a point process model. Parameter selection for ETAS models is most commonly accomplished through maximum likelihood estimation, where the log-likelihood function (Daley and Vere-Jones

3 102 Journal of the American Statistical Association, March ), l(θ) = k log{λ(t k, x k, y k ; θ)} T 0 S λ(t, x, y; θ)dy dx dt, (6) is maximized over all parameter sets θ. HereS [0, T] is the space time window of observation. More recently, nonparametric methods have been introduced for self-exciting point process estimation (Zhuang 2006; Marsan and Lenglin 2008). Consider space time point data {(t k, x k, y k )} N k=1 and a general self-exciting point process model of the form λ(t, x, y) = μ(t, x, y) + g(t t k, x x k, y y k ). (7) {k:t k <t} Assuming model correctness, the probability that event i is a background event, p ii, is given by p ii = μ(t i, x i, y i ) λ(t i, x i, y i ) and the probability that event j triggered event i, p ji, is given by p ji = g(t i t j, x i x j, y i y j ) λ(t i, x i, y i ) (Zhuang, Ogata, and Vere-Jones 2002). Let P denote the matrix with entries p ji (note that the columns sum to one). Then stochastic declustering can be used in the following way. Given an initial guess P 0 of the matrix P, we then have N(N + 1)/2 probabilistic data points {(t k, x k, y k, p kk )} N k=1 and {(t i t j, x i x j, y i y j, p ji )} i>j. Given this data, a nonparametric density estimation procedure can be used to estimate μ from {(t k, x k, y k, p kk )} N k=1 and g from {(t i t j, x i x j, y i y j, p ji )} i>j, providing estimates μ 0 and g 0. We can then proceed iteratively as follows until convergence is achieved: Step 1. Estimate μ n and g n from P n 1. Step 2. Update P n from μ n and g n using (8) and (9). For example, a simple histogram estimator is used in Marsan and Lenglin (2008)instep1. 3. A SELF EXCITING POINT PROCESS MODEL OF BURGLARY For the purpose of modeling burglary we consider an unmarked self-exciting model for the conditional intensity of the form λ(t, x, y) = ν(t)μ(x, y)+ g(t t k, x x k, y y k ). (10) {k:t k <t} Here we neglect spatially localized temporal fluctuations in the background rate and assume that the fluctuations occur globally (e.g., due to weather, seasonality, time of day, etc.) In the case of seismology, research over a number of decades was needed to refine the (parametric) form of the triggering function g. For this reason, nonparametric methods are appealing in the context of crime in order to quickly gain insight into the forms of ν, μ, and g. For this purpose we use the iterative procedure outlined in the previous section to estimate the model, with several modifications. (8) (9) Because the probabilistic data {(t k, x k, y k, p kk )} N k=1 and {(t i t j, x i x j, y i y j, p ji )} i>j is both three-dimensional and the number of data points is O(N 2 ) [where N is typically O(1000) for earthquake and crime datasets], the estimation step for μ and g is computationally expensive. The dimensionality prevents straightforward use of binning methods such as the Average Shifted Histogram (Marsan and Lenglin use a logarithmically scaled histogram on a coarse grid), as many bins may have extremely small, but nonzero, values (since the data is probabilistic, the count in each bin can be less than 1). Alternatively, the large size of the data set prevents efficient use of off-grid methods such as Kernel Density Estimation. To get around these issues we use the following Monte Carlo-based iterative procedure: Step 1. Sample background events {(ti b, xb i, yb i )}N b i=1 and offspring/parent interpoint distances {(ti o, xo i, yo i )}N o i=1 from P n 1. Step 2. Estimate ν n, μ n and g n from the sampled data using variable bandwidth Kernel Density Estimation. Step 3. Update P n from ν n, μ n and g n using (8) and (9). Because N b + N o = N, the size of the sampled data at each iteration allows for the use of Kernel Density Estimation. Another issue is that the number of background and offspring events, N b and N o, is changing at each iteration. Thus a fixed bandwidth for any density estimation technique (kernel smoothing, histogram, etc.) will over-smooth at some iterations and under-smooth at others. Therefore we employ variable bandwidth KDE (alternatively Cross Validation could be used). We give further details of our approach and provide validation using a simulated point process in the Appendix. 4. RESULTS We fit the model given by Equation (10) to a dataset collected by the Los Angeles Police Department of 5376 reported residential burglaries in an 18 km by 18 km region of the San Fernando Valley in Los Angeles occurring during the years 2004 and Each burglary is associated with a reported time window over which it could have occurred, often a few hour span (for instance, the time span over which a victim was at work), and we define the time of burglary to be the midpoint of each burglary window. In Figure 3, we plot the sampled interpoint distances {(ti o, xo i, y o i )}N o i=1 on the 75th iteration of the stochastic declustering algorithm (see Appendix for convergence verification). The number of sampled (offspring) events is 706 (13.1% of all events) and of these events approximately 63% are exact repeats (occurring at the same house). On the left, the spatial interpoint distances are plotted showing that elevated crime risk travels around 50 m 100 m from the house of an initial burglary to the location of direct offspring events. As discussed in Marsan and Lenglin (2008), the overall distance near-repeat risk travels is several times further due to the cascading property of selfexciting point processes. Note also that the risk travels vertically and horizontally (along streets), more so than it does in other directions. On the right, we plot the spatial (x-coordinate) interpoint distances against the time interpoint distances. Here exact-repeat burglaries, those occurring at the same house, are apparent along the x-axis.

4 Mohler et al.: Self-Exciting Point Process Modeling of Crime 103 Figure 3. Spatial (left) and space time (right) offspring/parent interpoint distances {(t o i, xo i, yo i )}N o i=1 sampled from P 75. In Figure 4, we plot (on a logarithmic scale) the estimated marginals g 75 (t) = g 75 (t, x, y) dx dy x y and g 75 (x) = g 75 (t, x, y) dy dt t y computed from the KDE estimate of g at the 75th iteration. Here the presence of exact-repeat events can again be seen, as g 75 (x) appears to approximate a delta distribution at the origin. The spike around 1 2 days in the plot of g 75 (t) is due to the presence of fast crime sprees, where most likely the same burglar visited several neighboring houses within a time span of a few minutes to several days. There are also several bumps in the elevated risk of burglary, for example, around 7 days. Here one possible explanation is that the routine of the burglar and/or the victim is such that a particular day of the week is a preferable time to commit the burglary. After 7 10 days, the elevated risk of repeat/near-repeat victimization drops to an intermediate level and stays relatively flat for a time span on the order of several hundred days before decaying back to baseline rates. These results are consistent with previous quantitative studies of exact-repeat burglaries (Short et al. 2009). In Johnson (2008), the authors discuss the need to model risk heterogeneity and in general it is a difficult task to separate clustering due to background heterogeneity and clustering due to self-excitation. One benefit of using the nonparametric approach outlined above is that temporal and spatial changes in the rate of crime are automatically separated into those stemming from exogenous effects and those due to self-excitation. In Figure 5, we plot the estimated marginals ν 75 (t) and μ 75 (x, y) estimated using KDE from {(ti b, xb i, yb i )}N b i=1 at the 75th iteration. Figure 4. Marginal g 75 (t) (left) and marginal g 75 (x) (right) estimated using KDE based upon offspring/parent interpoint distances sampled from P 75.

5 104 Journal of the American Statistical Association, March 2011 Figure 5. Background rate time marginal ν 75 (t) (left) and space marginal μ 75 (x, y) (right) estimated using KDE from the background events sampled from P 75. Here the estimated background rate exhibits temporal fluctuations on a time scale of months/days, separate from the fluctuations due to self-excitation. These fluctuations are likely caused by a number of factors such as seasonal, economic, and demographic changes, as well as temporal variations in burglar routine activities (Felson 1998). For example, residential burglary tends to have a higher weekday rate (when victims are at work) compared to weekends. Similarly, the background rate is also spatially variable, which is consistent with fixed environmental heterogeneity in crime opportunities, as well as variability in population density through space (Bernasco and Nieuwbeerta 2005). In seismology, declustered catalogs are of great interest as they can be used in estimating the background rate of major earthquakes. Declustered crime catalogs could potentially be used by police to distinguish between areas of a city with intrinsically high crime rates and areas with temporarily high crime rates (due to near-repeat effects). As the former arises due to structural properties of a given neighborhood and the latter from behavioral characteristics of individual burglars, police and community responses would likely need to be different in each case. 5. CRIME FORECASTING: POINT PROCESSES VERSUS HOTSPOT MAPS Crime hotspot maps are a well-established tool for visualization of space time crime patterns and can be used as a method for prediction of near-repeat crimes. Given space time crime observations (t k, x k, y k ), crime hotspot maps are generated for a time interval [t T, t] by overlaying a density plot of the function, λ(t, x, y) = g(t t k, x x k, y y k ), (11) t T<t k <t onto a city map, where g(t, x, y) is a space time kernel. By flagging the areas of the city where λ takes on its highest values, crime hotspot maps can be used to indicate which areas in the city are likely to contain future crimes (Bowers, Johnson, and Pease 2004; Chainey, Tompson, and Uhlig 2008). For example, in Bowers, Johnson, and Pease (2004) a coarse grained kernel is used that decays inversely proportional to spatial and temporal distance. In particular, with spatial distance d in units of 1/2 cell widths and time t in units of weeks, the kernel in (11) is specified as 1 g(t, d) = (12) (1 + t)(1 + d) on the domain (t, d) [0, 2 months] [0, 400 meters] and 0 otherwise. Such a crime hotspot map is referred to as prospective, as it uses past crimes, coupled with the contagious spread of crime (modeled by g), to estimate future relative crime risk across the city. It should be noted that the risk is relative because (11) is not a point process intensity. Here we compare the predictive accuracy of the self-exciting point process model developed in Section 3 to the prospective crime hotspot map given by (11) (12). Because crime is localized in small regions of the city (a commercial zone with no residential burglary may be located 100 meters from a neighborhood), we find that for predictive purposes variable bandwidth KDE is less accurate than fixed bandwidth KDE. We therefore estimate μ(x, y) in Equation (10) using fixed bandwidth Gaussian KDE, with 20-fold cross validation used to select the bandwidth (Silverman 1986). For every day k of 2005, each model assesses the risk of burglary within each of M 2 cells partitioning an 18 km by 18 km region of the San Fernando Valley in Los Angeles. Based on the data from the beginning of 2004 up through day k, then cells with the highest risk (value of λ) are flagged yielding a prediction for day k + 1. The percentage of crimes falling within the flagged cells on day k + 1 is then recorded and used to measure the accuracy of each model. In Figure 6, on the left we plot the percentage of crimes predicted averaged over the forecasting year against the percentage of flagged cells for the self-exciting point process and

6 Mohler et al.: Self-Exciting Point Process Modeling of Crime 105 Figure 6. Forecasting strategy comparison. Average daily percentage of crimes predicted plotted against percentage of cells flagged for 2005 burglary using 200 m by 200 m cells. Error bars correspond to the standard error. Prospective hotspot cutoff parameters are 400 meters and 8 weeks (left) and optimal parameters (right) are 200 meters and 39 weeks. Spatial background intensity μ(x, y) smoothing bandwidth for the point process is 300 meters (left) selected by cross validation and 130 meters (right) selected to optimize the number of crimes predicted. the prospective hotspot strategy. For example, with 10% of the city flagged the point process and prospective hotspot correctly predict 660 and 547 crimes (respectively) out of The difference in accuracy between the two methodologies can be attributed to the crime hotspot map s failure to account for the background rate of crime. While prospective crime hotspot maps used for crime prediction attempt to quantify the contagious spread of crime following past events, they fail to assess the likelihood of future background events, the initial events that trigger crime clusters. In order to disentangle the dependence of model accuracy on parameter selection, in Figure 6 on the right we repeat the same prediction exercise but with parameters of each model selected to yield the highest number of crimes predicted (L 1 norm over 1 through 15% of cells flagged). The optimal cutoff parameters for the prospective hotspot map are 200 meters and 39 weeks. With these parameter values, in particular the slow decay of g in time, Equation (11) is closer to Poisson estimation. For the point process model we only optimize the bandwidth used for μ(x, y) as the computational cost of the stochastic declustering algorithm is relatively high. Whereas the bandwidth is estimated to be approximately 300 meters using cross validation, a smaller bandwidth, 130 meters, provides a higher level of predictive accuracy. This can be attributed to the spatially localized features of neighborhoods, and hence burglary. For all percentages of cells flagged the prospective hotspot map underperforms the point process, though for certain percentages the relative underperformance is less. On the left in Figure 6, the prospective hotspot map performs better (relative to the point process) for smaller percentages of cells flagged, as the parameters are selected to account for near-repeat effects. On the right, the prospective hotspot map performs better for larger percentages of flagged cells, since for these parameter values the model is more accurately estimating fixed environmental heterogeneity. For crime types such as robbery and auto theft, where near-repeat effects play less of a role, prospective hotspot maps tailored for near-repeat effects are likely to be outperformed by simple Poisson estimation. The advantage of models of the form (10) is that the balance between exogenous and endogenous contributions to crime rates is inferred from the data as opposed to being imposed a priori. 6. DISCUSSION We showed how self-exciting point processes from seismology can be used for the purpose of crime modeling. In the future it may be desirable to tailor point process models specifically for crime, taking into account the crime type and the local geography of the city. Based upon the insights provided by nonparametric estimates, parametric models can be constructed that have advantages with respect to model fitting and simulation. Background rates can also be improved by incorporating other data types (in Johnson 2008, housing density is used to improve models of repeat victimization). In the case of gang violence, a hybrid network-point process approach may be useful for capturing the self-exciting effects stemming from gang retaliations. Here increased risk may not diffuse in geographic space, but instead may travel through the network space of gang rivalry relations. The methodology used in this study can be implemented for other applications as well, for example refining point process models of earthquakes. It could potentially be adapted, more generally, to other second-order models of point processes. The stochastic declustering algorithm opens up the door to a plethora of density estimation techniques (Silverman 1986; Scott 1992; Eggermont and LaRiccia 2001) that could be used to explore point processes in a way parametric methods do not allow. In Marsan and Lenglin (2010) it is shown that the method is an Expectation-Maximization (EM) type algorithm. At the maximization step the complete data log-likelihood function

7 106 Journal of the American Statistical Association, March 2011 decouples in terms of the background and triggering functions, which is why at each iteration the problem reduces to several decoupled density estimation problems. Several issues could potentially arise here, one being that the method could converge to a local (but not global) minimum of the observed data log-likelihood function. Another, as pointed out in Sornette and Utkin (2009), is that the sample size and domain size (relative to the support of the triggering kernel) play a key role in the accuracy of stochastic declustering. In numerical tests we have found that at least O(1000) data points are needed in three dimensions for the iterates to converge to the right densities and the domain needs to be several times larger than the support of the triggering kernel. Similar to analytical results for standard density estimation, it would be useful to have convergence results relating sample size, branching ratio, domain size, and the bandwidth of the density estimators to the solution of the fixed-point iteration. APPENDIX Given point data (t k, x k, y k ) N k=1 and a self-exciting point process model of the form, λ(t, x, y) = ν(t)μ(x, y) + g(t t k, x x k, y y k ), (A.1) {k: t k <t} we iterate the following until convergence: Step 1. Sample background events {(ti b, xb i, yb i )}N b i=1 and offspring/ parent interpoint distances {(ti o, xo i, yo i )}N o i=1 from P n 1. Step 2. Estimate ν n, μ n,andg n from the sampled data. Step 3. Update P n from ν n, μ n,andg n using (8)and(9). In order to estimate ν n, μ n,andg n from the sampled data, we use variable bandwidth Kernel Density Estimation. To estimate g n,wefirst scale the data {(ti o, xo i, yo i )}N o i=1 to have unit variance in each coordinate and based upon the rescaled data compute D i,thekth nearest neighbor distance (three-dimensional Euclidean distance) to data point i. We then transform the data back to its original scale and, letting σ x, σ y, Figure A.1. L2 error P n P n 1 2 (top left) and N b, the number of sampled background events, (top right) at the nth iteration for known point process model. L2 error P n P n 1 2 (bottom left) and N b, the number of sampled background events, (bottom right) at the nth iteration for the method applied to the 5376 burglary events in Section 3.

8 Mohler et al.: Self-Exciting Point Process Modeling of Crime 107 and σ t be the sample standard deviation of each coordinate, estimate the triggering function as g n (t, x, y) = 1 N o 1 N σ i=1 x σ y σ t (2π) (3/2) D 3 i exp ( (x xo i )2 2σx 2 (y yo i )2 D2 i 2σy 2D2 i (t to i )2 ) 2σt 2. D2 i The background rate is estimated similarly, where one-dimensional and two-dimenional Gaussian kernels are used to estimate ν n and μ n, respectively. In Zhuang, Ogata, and Vere-Jones (2002), the authors recommending using the 10th 100th nearest neighbor distance for D i. Throughout we compute D i corresponding to ν using the 100th nearest neighbor distance and in higher dimensions we use the 15th nearest neighbor distance for D i corresponding to μ and g. We validate the method by simulating (A.1) with ν(t)μ(x, y) = μ (2π)(4.5) 2 exp ( x2 2(4.5) 2 ) exp ) ( y2 2(4.5) 2 and ) ) g(t, x, y) = θωexp( ωt) exp ( x2 2σx 2 exp ( y2 2σy 2 and comparing the estimates supplied by the method with the known distribution. The simulation was carried out by first simulating all background events according to the Poisson process νμ. The rest of the simulation was carried out iteratively, where each point of each generation generates its own offspring according to the Poisson process g centered at the parent point. The process terminates at the nth generation when all events of the nth generation lie outside of the time window under consideration. In order to have a realization of the point process at steady state, the first and last 2000 points were disregarded in each simulation. In Figure A.1, we plot the L2 error P n P n 1 2 at the nth iteration and the number of sampled background events N b at the nth iteration against the true number of background events for one realization of the known point process. Here we observe that the error converges quickly for the first 10 iterations and then stabilizes as the error introduced by estimating the point process through sampling P cannot be reduced further (unless a deterministic iterative procedure is employed). We also verify that the method applied to the 5376 burglary events in Section 3 reached convergence in Figure A.1. Herewe observe a similar rate of convergence for the crime data as with the simulated point process. In Table A.1, we list the exact parameter values used for the simulated point process and the estimates averaged over the final 10 iterations of the stochastic declustering algorithm for each of five simulations of the point process. The parameter values were selected to yield point patterns with scales similar to those observed in crime data. The parameter estimates are computed using the sample variances of the coordinates of {(ti o, xo i, yo i )}N o i=1 and the values of N b, N o.assomeerror is due to sample variation, we plot in the last two columns the estimated number of background events versus the actual number of background events in each of the five simulations to assess the ability of the method to reconstruct the realized branching structure. In Figure A.2, we plot the estimated marginals of g(t, x, y) against the Table A.1. Parameter value estimates w 1 σ x σ y θ μ N b est. N b true True values Run 1 est Run 2 est Run 3 est Run 4 est Run 5 est Figure A.2. Estimated (circles) and actual (solid line) marginals of g(t, x, y) on the 75th iteration. Top is the marginal g(x), in the middle is the marginal g(y), and lower figure is marginal g(t).

9 108 Journal of the American Statistical Association, March 2011 actual distributions on the 75th iteration of the stochastic declustering algorithm. The estimated time marginal density deviates from the true density at the origin due to the jump discontinuity of the exponential distribution. However, the estimate of the parameter ω is still close to thetruevalue(seetablea.1). [Received September Revised October 2010.] REFERENCES Bernasco, W., and Nieuwbeerta, P. (2005), How Do Residential Burglars Select Target Areas? A New Approach to the Analysis of Criminal Location Choice, The British Journal of Criminology, 45, [100,104] Bowers, K. J., Johnson, S. D., and Pease, K. (2004), Prospective Hot-Spotting: The Future of Crime Mapping? The British Journal of Criminology, 44, [104] Chainey, S., Tompson, L., and Uhlig, S. (2008), The Utility of Hotspot Mapping for Predicting Spatial Patterns of Crime, Security Journal, 21, [104] Cohen, J., and Tita, G. (1999), Spatial Diffusion in Homicide: Exploring a General Method of Detecting Spatial Diffusion Processes, Journal of Quantitative Criminology, 15 (4), [100] Daley, D., and Vere-Jones, D. (2003), An Introduction to the Theory of Point Processes (2nd ed.), New York: Springer. [100,101] Eggermont, P. P. B., and LaRiccia, V. N. (2001), Maximum Penalized Likelihood Estimation: Volume I: Density Estimation, New York: Springer. [105] Farrell, G., and Pease, K. (eds.) (2001), Repeat Victimization, New York: Criminal Justice Press. [100] Felson, M. (1998), Crime and Everyday Life, Thousand Oaks: Pine Forge Press. [104] Johnson, S. D. (2008), Repeat Burglary Victimisation: A Tale of Two Theories, Journal of Experimental Criminology, 4, [100,103,105] Johnson, S. D., Bernasco, W., Bowers, K. J., Elffers, H., Ratcliffe, J., Rengert, G., and Townsley, M. (2007), Space Time Patterns of Risk: A Cross National Assessment of Residential Burglary Victimization, Journal of Quantitative Criminology, 23, [100] Marsan D., and Lenglin, O. (2008), Extending Earthquakes Reach Through Cascading, Science, 319, [102] (2010), A New Estimation of the Decay of Aftershock Density With Distance to the Mainshock, unpublished manuscript, available at dmars/ Publications.html. [105] Ogata, Y. (1998), Space Time Point Process Models for Earthquake Occurrences, Annals of the Institute of Statistical Mathematics, 50 (2), [101] Ogata, Y., and Katsura, K. (1988), Likelihood Analysis of Spatial Inhomogeneity for Marked Point Patterns, Annals of the Institute of Statistical Mathematics, 40, [101] Okabe, A., Boots, B., Sugihara, K., and Chiu, S. (2000), Spatial Tessellations (2nd ed.), Chichester: Wiley. [101] Scott, D. W. (1992), Multivariate Density Estimation, New York: Wiley. [105] Short, M. B., D Orsogna, M. R., Brantingham, P. J., and Tita, G. E. (2009), Measuring and Modeling Repeat and Near-Repeat Burglary Effects, Journal of Quantitative Criminology, 25 (3), 325. [100,103] Silverman, B. W. (1986), Density Estimation for Statistics and Data Analysis, London: Chapman & Hall. [101,104,105] Sornette, D., and Utkin, S. (2009), Limits of Declustering Methods for Disentangling Exogenous From Endogenous Events in Time Series With Foreshocks, Main Shocks and Aftershocks, Physical Review E, 79, [106] Tita, G., and Ridgeway, G. (2007), The Impact of Gang Formation on Local Patterns of Crime, Journal of Research on Crime and Delinquency,44(2), [100] Zhuang, J. (2006), Second-Order Residual Analysis of Spatiotemporal Point Processes and Applications to Model Evaluation, Journal of the Royal Statistical Society, Ser. B, 68 (4), [102] Zhuang, J., Ogata, Y., and Vere-Jones, D. (2002), Stochastic Declustering of Space Time Earthquake Occurences, Journal of the American Statistical Association, 97 (458), [101,102,107]

### GEOGRAPHIC PROFILING THROUGH SIX-DIMENSIONAL NONPARAMETRIC DENSITY ESTIMATION

GEOGRAPHIC PROFILING THROUGH SIX-DIMENSIONAL NONPARAMETRIC DENSITY ESTIMATION AUSTIN C. ALLEMAN ADVISOR: GEORGE O. MOHLER Abstract. Geographic profiling is the problem of identifying the location of the

### Using Social Media Data to Assess Spatial Crime Hotspots

Using Social Media Data to Assess Spatial Crime Hotspots 1 Introduction Nick Malleson 1 and Martin Andreson 2 1 School of Geography, University of Leeds 2 School of Criminology, Simon Fraser University,

### Exploring data assimilation and forecasting issues for an urban crime model

Exploring data assimilation and forecasting issues for an urban crime model David J.B. Lloyd, Naratip Santitissadeekorn, and Martin B. Short 2 Department of Mathematics, University of Surrey, Guildford,

### An Introduction to Point Pattern Analysis using CrimeStat

Introduction An Introduction to Point Pattern Analysis using CrimeStat Luc Anselin Spatial Analysis Laboratory Department of Agricultural and Consumer Economics University of Illinois, Urbana-Champaign

### EXPLORING SPATIAL PATTERNS IN YOUR DATA

EXPLORING SPATIAL PATTERNS IN YOUR DATA OBJECTIVES Learn how to examine your data using the Geostatistical Analysis tools in ArcMap. Learn how to use descriptive statistics in ArcMap and Geoda to analyze

### Using kernel methods to visualise crime data

Submission for the 2013 IAOS Prize for Young Statisticians Using kernel methods to visualise crime data Dr. Kieran Martin and Dr. Martin Ralphs kieran.martin@ons.gov.uk martin.ralphs@ons.gov.uk Office

### Methods of Data Analysis Working with probability distributions

Methods of Data Analysis Working with probability distributions Week 4 1 Motivation One of the key problems in non-parametric data analysis is to create a good model of a generating probability distribution,

### Tutorial on Markov Chain Monte Carlo

Tutorial on Markov Chain Monte Carlo Kenneth M. Hanson Los Alamos National Laboratory Presented at the 29 th International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Technology,

### Least Squares Estimation

Least Squares Estimation SARA A VAN DE GEER Volume 2, pp 1041 1045 in Encyclopedia of Statistics in Behavioral Science ISBN-13: 978-0-470-86080-9 ISBN-10: 0-470-86080-4 Editors Brian S Everitt & David

### Understanding crime hotspot maps

NSW Bureau of Crime Statistics and Research Bureau Brief Issue paper no. 60 April 2011 Understanding crime hotspot maps Melissa Burgess The distribution of crime across a region is not random. A number

### STA 4273H: Statistical Machine Learning

STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Statistics! rsalakhu@utstat.toronto.edu! http://www.cs.toronto.edu/~rsalakhu/ Lecture 6 Three Approaches to Classification Construct

### Predictive Policing. NGA Cybercrime and Forensic Sciences Executive Policy Forum June 2011 Snowbird, UT

Predictive Policing NGA Cybercrime and Forensic Sciences Executive Policy Forum June 2011 Snowbird, UT Dr. Craig D. Uchida Justice & Security Strategies, Inc. Susan C. Smith Shawnee, Kansas Police Department

### Alison Hayes November 30, 2005 NRS 509. Crime Mapping OVERVIEW

Alison Hayes November 30, 2005 NRS 509 Crime Mapping OVERVIEW Geographic data has been important to law enforcement since the beginning of local policing in the nineteenth century. The New York City Police

### PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION

PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION Introduction In the previous chapter, we explored a class of regression models having particularly simple analytical

### Global Seasonal Phase Lag between Solar Heating and Surface Temperature

Global Seasonal Phase Lag between Solar Heating and Surface Temperature Summer REU Program Professor Tom Witten By Abstract There is a seasonal phase lag between solar heating from the sun and the surface

### DRAFT: Statistical methodology to test for evidence of seasonal variation in rates of earthquakes in the Groningen field

DRAFT: Statistical methodology to test for evidence of seasonal variation in rates of earthquakes in the Groningen field Restricted PRELIMINARY DRAFT: SR.15.xxxxx April 2015 Restricted PRELIMINARY DRAFT:

### Stochastic modeling of a serial killer

Stochastic modeling of a serial killer M.V. Simkin and V.P. Roychowdhury Department of Electrical Engineering, University of California, Los Angeles, CA 995-594 We analyze the time pattern of the activity

### Simple Predictive Analytics Curtis Seare

Using Excel to Solve Business Problems: Simple Predictive Analytics Curtis Seare Copyright: Vault Analytics July 2010 Contents Section I: Background Information Why use Predictive Analytics? How to use

### Location matters. 3 techniques to incorporate geo-spatial effects in one's predictive model

Location matters. 3 techniques to incorporate geo-spatial effects in one's predictive model Xavier Conort xavier.conort@gear-analytics.com Motivation Location matters! Observed value at one location is

### BNG 202 Biomechanics Lab. Descriptive statistics and probability distributions I

BNG 202 Biomechanics Lab Descriptive statistics and probability distributions I Overview The overall goal of this short course in statistics is to provide an introduction to descriptive and inferential

### Implications of an inverse branching aftershock sequence model

Implications of an inverse branching aftershock sequence model D. L. Turcotte* and S. G. Abaimov Department of Geology, University of California, Davis, California 95616, USA I. Dobson Electrical and Computer

### Chapter 3 RANDOM VARIATE GENERATION

Chapter 3 RANDOM VARIATE GENERATION In order to do a Monte Carlo simulation either by hand or by computer, techniques must be developed for generating values of random variables having known distributions.

### Maximum likelihood estimation of mean reverting processes

Maximum likelihood estimation of mean reverting processes José Carlos García Franco Onward, Inc. jcpollo@onwardinc.com Abstract Mean reverting processes are frequently used models in real options. For

### Local classification and local likelihoods

Local classification and local likelihoods November 18 k-nearest neighbors The idea of local regression can be extended to classification as well The simplest way of doing so is called nearest neighbor

### Time Series Analysis

JUNE 2012 Time Series Analysis CONTENT A time series is a chronological sequence of observations on a particular variable. Usually the observations are taken at regular intervals (days, months, years),

### Exercise 1.12 (Pg. 22-23)

Individuals: The objects that are described by a set of data. They may be people, animals, things, etc. (Also referred to as Cases or Records) Variables: The characteristics recorded about each individual.

### VOLATILITY AND DEVIATION OF DISTRIBUTED SOLAR

VOLATILITY AND DEVIATION OF DISTRIBUTED SOLAR Andrew Goldstein Yale University 68 High Street New Haven, CT 06511 andrew.goldstein@yale.edu Alexander Thornton Shawn Kerrigan Locus Energy 657 Mission St.

### Introduction to General and Generalized Linear Models

Introduction to General and Generalized Linear Models General Linear Models - part I Henrik Madsen Poul Thyregod Informatics and Mathematical Modelling Technical University of Denmark DK-2800 Kgs. Lyngby

### An Adaptive Index Structure for High-Dimensional Similarity Search

An Adaptive Index Structure for High-Dimensional Similarity Search Abstract A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with

### A Comparative Study of the Pickup Method and its Variations Using a Simulated Hotel Reservation Data

A Comparative Study of the Pickup Method and its Variations Using a Simulated Hotel Reservation Data Athanasius Zakhary, Neamat El Gayar Faculty of Computers and Information Cairo University, Giza, Egypt

### A Learning Based Method for Super-Resolution of Low Resolution Images

A Learning Based Method for Super-Resolution of Low Resolution Images Emre Ugur June 1, 2004 emre.ugur@ceng.metu.edu.tr Abstract The main objective of this project is the study of a learning based method

### Local outlier detection in data forensics: data mining approach to flag unusual schools

Local outlier detection in data forensics: data mining approach to flag unusual schools Mayuko Simon Data Recognition Corporation Paper presented at the 2012 Conference on Statistical Detection of Potential

### Estimating the K-function for a univariate spatial point process on an arbitrary polygon.

Estimating the K-function for a univariate spatial point process on an arbitrary polygon. B. S. Rowlingson & P. J. Diggle University of Lancaster, Lancaster, UK December 1991 Keywords: point process; spatial

### Introduction. One of the most convincing and appealing ways in which statistical results may be presented is through diagrams and graphs.

Introduction One of the most convincing and appealing ways in which statistical results may be presented is through diagrams and graphs. Just one diagram is enough to represent a given data more effectively

### Probabilistic Seismic Hazard Analysis for Induced Earthquakes in Groningen; Update 2015. Bernard Dost and Jesper Spetzler KNMI, October 2015

1 Probabilistic Seismic Hazard Analysis for Induced Earthquakes in Groningen; Update 2015 Bernard Dost and Jesper Spetzler KNMI, October 2015 Introduction In this report an update of the Probabilistic

### Using simulation to calculate the NPV of a project

Using simulation to calculate the NPV of a project Marius Holtan Onward Inc. 5/31/2002 Monte Carlo simulation is fast becoming the technology of choice for evaluating and analyzing assets, be it pure financial

### Estimating Joint Failure Probability of Series Structural Systems

Estimating Joint Failure Probability of Series Structural Systems Yan-Gang Zhao, M.ASCE 1 ; Wei-Qiu Zhong ; and Alfredo H.-S. Ang, Hon.M.ASCE 3 Abstract: The failure probability of a series structural

### Time series analysis as a framework for the characterization of waterborne disease outbreaks

Interdisciplinary Perspectives on Drinking Water Risk Assessment and Management (Proceedings of the Santiago (Chile) Symposium, September 1998). IAHS Publ. no. 260, 2000. 127 Time series analysis as a

### Load Balancing in Cellular Networks with User-in-the-loop: A Spatial Traffic Shaping Approach

WC25 User-in-the-loop: A Spatial Traffic Shaping Approach Ziyang Wang, Rainer Schoenen,, Marc St-Hilaire Department of Systems and Computer Engineering Carleton University, Ottawa, Ontario, Canada Sources

### LABEL PROPAGATION ON GRAPHS. SEMI-SUPERVISED LEARNING. ----Changsheng Liu 10-30-2014

LABEL PROPAGATION ON GRAPHS. SEMI-SUPERVISED LEARNING ----Changsheng Liu 10-30-2014 Agenda Semi Supervised Learning Topics in Semi Supervised Learning Label Propagation Local and global consistency Graph

### Spatial significance hotspot mapping using the Gi* statistic Spencer Chainey

Spatial significance hotspot mapping using the Gi* statistic Spencer Chainey Director of Geographic Information Science Overview The value of testing for spatial significance Quick review of common hotspot

### The primary goal of this thesis was to understand how the spatial dependence of

5 General discussion 5.1 Introduction The primary goal of this thesis was to understand how the spatial dependence of consumer attitudes can be modeled, what additional benefits the recovering of spatial

### Simple Linear Regression Inference

Simple Linear Regression Inference 1 Inference requirements The Normality assumption of the stochastic term e is needed for inference even if it is not a OLS requirement. Therefore we have: Interpretation

### Time series Forecasting using Holt-Winters Exponential Smoothing

Time series Forecasting using Holt-Winters Exponential Smoothing Prajakta S. Kalekar(04329008) Kanwal Rekhi School of Information Technology Under the guidance of Prof. Bernard December 6, 2004 Abstract

### Package EstCRM. July 13, 2015

Version 1.4 Date 2015-7-11 Package EstCRM July 13, 2015 Title Calibrating Parameters for the Samejima's Continuous IRT Model Author Cengiz Zopluoglu Maintainer Cengiz Zopluoglu

### Predict the Popularity of YouTube Videos Using Early View Data

000 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050

### Probabilistic user behavior models in online stores for recommender systems

Probabilistic user behavior models in online stores for recommender systems Tomoharu Iwata Abstract Recommender systems are widely used in online stores because they are expected to improve both user

### Metric Spaces. Chapter 7. 7.1. Metrics

Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

### Least-Squares Intersection of Lines

Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a

### Algebra 2 Chapter 1 Vocabulary. identity - A statement that equates two equivalent expressions.

Chapter 1 Vocabulary identity - A statement that equates two equivalent expressions. verbal model- A word equation that represents a real-life problem. algebraic expression - An expression with variables.

### GIS and Crime Mapping

GIS and Crime Mapping Spencer Chainey Director of Geographic Information Science Established in 2001 as a permanent memorial to one of Britain s most popular TV journalists Introduction The role of place

### Evolution of a Location-based Online Social Network: Analysis and Models

Evolution of a Location-based Online Social Network: Analysis and Models Miltiadis Allamanis Computer Laboratory University of Cambridge ma536@cam.ac.uk Salvatore Scellato Computer Laboratory University

### Spatial Statistical Model for Predicting Crime Behavior Based On the Analysis of Hotspot Mapping

European Journal of Scientific Research ISSN 1450-216X Vol.54 No.1 (2011), pp.111-120 EuroJournals Publishing, Inc. 2011 http://www.eurojournals.com/ejsr.htm Spatial Statistical Model for Predicting Crime

### Decentralized Method for Traffic Monitoring

Decentralized Method for Traffic Monitoring Guillaume Sartoretti 1,2, Jean-Luc Falcone 1, Bastien Chopard 1, and Martin Gander 2 1 Computer Science Department 2 Department of Mathematics, University of

### IN current film media, the increase in areal density has

IEEE TRANSACTIONS ON MAGNETICS, VOL. 44, NO. 1, JANUARY 2008 193 A New Read Channel Model for Patterned Media Storage Seyhan Karakulak, Paul H. Siegel, Fellow, IEEE, Jack K. Wolf, Life Fellow, IEEE, and

### Multi scale random field simulation program

Multi scale random field simulation program 1.15. 2010 (Updated 12.22.2010) Andrew Seifried, Stanford University Introduction This is a supporting document for the series of Matlab scripts used to perform

### BayesX - Software for Bayesian Inference in Structured Additive Regression

BayesX - Software for Bayesian Inference in Structured Additive Regression Thomas Kneib Faculty of Mathematics and Economics, University of Ulm Department of Statistics, Ludwig-Maximilians-University Munich

### Probabilistic Forecasting of Medium-Term Electricity Demand: A Comparison of Time Series Models

Fakultät IV Department Mathematik Probabilistic of Medium-Term Electricity Demand: A Comparison of Time Series Kevin Berk and Alfred Müller SPA 2015, Oxford July 2015 Load forecasting Probabilistic forecasting

### Editorial: crime patterns in time and space: the dynamics of crime opportunities in urban areas

Newton and Felson Crime Science (2015) 4:11 DOI 10.1186/s40163-015-0025-6 EDITORIAL Open Access Editorial: crime patterns in time and space: the dynamics of crime opportunities in urban areas Andrew Newton

### Curriculum Vitae Eric S. McCord

Curriculum Vitae Eric S. McCord Assistant Professor Department of Justice Administration 215 Brigman Hall (502) 852-0376 University of Louisville Louisville, KY 40292 eric.mccord@louisville.edu Education

### Machine Learning in Statistical Arbitrage

Machine Learning in Statistical Arbitrage Xing Fu, Avinash Patra December 11, 2009 Abstract We apply machine learning methods to obtain an index arbitrage strategy. In particular, we employ linear regression

### Predictive Policing: What It Is, What It Isn t, and Where It Can Be Useful

Predictive Policing: What It Is, What It Isn t, and Where It Can Be Useful John S. Hollywood, Susan C. Smith, Carter Price, Brian McInnis, Walt Perry NLECTC Information and Geospatial Technologies Center

### Industry Environment and Concepts for Forecasting 1

Table of Contents Industry Environment and Concepts for Forecasting 1 Forecasting Methods Overview...2 Multilevel Forecasting...3 Demand Forecasting...4 Integrating Information...5 Simplifying the Forecast...6

### Spatial Data Analysis

14 Spatial Data Analysis OVERVIEW This chapter is the first in a set of three dealing with geographic analysis and modeling methods. The chapter begins with a review of the relevant terms, and an outlines

### The Method of Least Squares

The Method of Least Squares Steven J. Miller Mathematics Department Brown University Providence, RI 0292 Abstract The Method of Least Squares is a procedure to determine the best fit line to data; the

### Generating Random Numbers Variance Reduction Quasi-Monte Carlo. Simulation Methods. Leonid Kogan. MIT, Sloan. 15.450, Fall 2010

Simulation Methods Leonid Kogan MIT, Sloan 15.450, Fall 2010 c Leonid Kogan ( MIT, Sloan ) Simulation Methods 15.450, Fall 2010 1 / 35 Outline 1 Generating Random Numbers 2 Variance Reduction 3 Quasi-Monte

### Appendix E: Graphing Data

You will often make scatter diagrams and line graphs to illustrate the data that you collect. Scatter diagrams are often used to show the relationship between two variables. For example, in an absorbance

### Joint models for classification and comparison of mortality in different countries.

Joint models for classification and comparison of mortality in different countries. Viani D. Biatat 1 and Iain D. Currie 1 1 Department of Actuarial Mathematics and Statistics, and the Maxwell Institute

### A Semi-parametric Approach for Decomposition of Absorption Spectra in the Presence of Unknown Components

A Semi-parametric Approach for Decomposition of Absorption Spectra in the Presence of Unknown Components Payman Sadegh 1,2, Henrik Aalborg Nielsen 1, and Henrik Madsen 1 Abstract Decomposition of absorption

### Methodology for Emulating Self Organizing Maps for Visualization of Large Datasets

Methodology for Emulating Self Organizing Maps for Visualization of Large Datasets Macario O. Cordel II and Arnulfo P. Azcarraga College of Computer Studies *Corresponding Author: macario.cordel@dlsu.edu.ph

### Cluster Analysis for Evaluating Trading Strategies 1

CONTRIBUTORS Jeff Bacidore Managing Director, Head of Algorithmic Trading, ITG, Inc. Jeff.Bacidore@itg.com +1.212.588.4327 Kathryn Berkow Quantitative Analyst, Algorithmic Trading, ITG, Inc. Kathryn.Berkow@itg.com

### Logistic Regression (1/24/13)

STA63/CBB540: Statistical methods in computational biology Logistic Regression (/24/3) Lecturer: Barbara Engelhardt Scribe: Dinesh Manandhar Introduction Logistic regression is model for regression used

### INTRODUCTION TO GEOSTATISTICS And VARIOGRAM ANALYSIS

INTRODUCTION TO GEOSTATISTICS And VARIOGRAM ANALYSIS C&PE 940, 17 October 2005 Geoff Bohling Assistant Scientist Kansas Geological Survey geoff@kgs.ku.edu 864-2093 Overheads and other resources available

### Fairfield Public Schools

Mathematics Fairfield Public Schools AP Statistics AP Statistics BOE Approved 04/08/2014 1 AP STATISTICS Critical Areas of Focus AP Statistics is a rigorous course that offers advanced students an opportunity

### Some stability results of parameter identification in a jump diffusion model

Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss

### ANALYZER BASICS WHAT IS AN FFT SPECTRUM ANALYZER? 2-1

WHAT IS AN FFT SPECTRUM ANALYZER? ANALYZER BASICS The SR760 FFT Spectrum Analyzer takes a time varying input signal, like you would see on an oscilloscope trace, and computes its frequency spectrum. Fourier's

### Probability and Statistics

CHAPTER 2: RANDOM VARIABLES AND ASSOCIATED FUNCTIONS 2b - 0 Probability and Statistics Kristel Van Steen, PhD 2 Montefiore Institute - Systems and Modeling GIGA - Bioinformatics ULg kristel.vansteen@ulg.ac.be

### Example 1: Calculate and compare RiskMetrics TM and Historical Standard Deviation Compare the weights of the volatility parameter using,, and.

3.6 Compare and contrast different parametric and non-parametric approaches for estimating conditional volatility. 3.7 Calculate conditional volatility using parametric and non-parametric approaches. Parametric

### Poisson Models for Count Data

Chapter 4 Poisson Models for Count Data In this chapter we study log-linear models for count data under the assumption of a Poisson error structure. These models have many applications, not only to the

### Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations

56 Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Florin-Cătălin ENACHE

### 1 Example of Time Series Analysis by SSA 1

1 Example of Time Series Analysis by SSA 1 Let us illustrate the 'Caterpillar'-SSA technique [1] by the example of time series analysis. Consider the time series FORT (monthly volumes of fortied wine sales

### Comparison of Non-linear Dimensionality Reduction Techniques for Classification with Gene Expression Microarray Data

CMPE 59H Comparison of Non-linear Dimensionality Reduction Techniques for Classification with Gene Expression Microarray Data Term Project Report Fatma Güney, Kübra Kalkan 1/15/2013 Keywords: Non-linear

### Spatial sampling effect of laboratory practices in a porphyry copper deposit

Spatial sampling effect of laboratory practices in a porphyry copper deposit Serge Antoine Séguret Centre of Geosciences and Geoengineering/ Geostatistics, MINES ParisTech, Fontainebleau, France ABSTRACT

### Claudio J. Tessone. Pau Amengual. Maxi San Miguel. Raúl Toral. Horacio Wio. Eur. Phys. J. B 39, 535 (2004) http://www.imedea.uib.

Horacio Wio Raúl Toral Eur. Phys. J. B 39, 535 (2004) Claudio J. Tessone Pau Amengual Maxi San Miguel http://www.imedea.uib.es/physdept Models of Consensus vs. Polarization, or Segregation: Voter model,

### Measuring Line Edge Roughness: Fluctuations in Uncertainty

Tutor6.doc: Version 5/6/08 T h e L i t h o g r a p h y E x p e r t (August 008) Measuring Line Edge Roughness: Fluctuations in Uncertainty Line edge roughness () is the deviation of a feature edge (as

### 14. Print out the page that shows your Virtual Seismologist Certificate and ANSWERS 15. After getting all 4, turn it into the teacher.

The Process 1. Go to the website: http://www.sciencecourseware.org 2. Click on: GEOLOGY LABS ONLINE 3. Click on VIRTUAL EARTHQUAKE 4. NEXT click on: NEW: A completely revised version of Virtual Earthquake

### Examples. David Ruppert. April 25, 2009. Cornell University. Statistics for Financial Engineering: Some R. Examples. David Ruppert.

Cornell University April 25, 2009 Outline 1 2 3 4 A little about myself BA and MA in mathematics PhD in statistics in 1977 taught in the statistics department at North Carolina for 10 years have been in

### Natural Neighbour Interpolation

Natural Neighbour Interpolation DThe Natural Neighbour method is a geometric estimation technique that uses natural neighbourhood regions generated around each point in the data set. The method is particularly

### Point-process models of social network interactions: parameter estimation and missing data recovery

Under consideration for publication in Euro. Jnl of Applied Mathematics 1 Point-process models of social network interactions: parameter estimation and missing data recovery JOSEPH R. ZIPKIN 1, FREDERIC

### Why Taking This Course? Course Introduction, Descriptive Statistics and Data Visualization. Learning Goals. GENOME 560, Spring 2012

Why Taking This Course? Course Introduction, Descriptive Statistics and Data Visualization GENOME 560, Spring 2012 Data are interesting because they help us understand the world Genomics: Massive Amounts

### In comparison, much less modeling has been done in Homeowners

Predictive Modeling for Homeowners David Cummings VP & Chief Actuary ISO Innovative Analytics 1 Opportunities in Predictive Modeling Lessons from Personal Auto Major innovations in historically static

### Theory versus Experiment. Prof. Jorgen D Hondt Vrije Universiteit Brussel jodhondt@vub.ac.be

Theory versus Experiment Prof. Jorgen D Hondt Vrije Universiteit Brussel jodhondt@vub.ac.be Theory versus Experiment Pag. 2 Dangerous cocktail!!! Pag. 3 The basics in these lectures Part1 : Theory meets

### 11. Time series and dynamic linear models

11. Time series and dynamic linear models Objective To introduce the Bayesian approach to the modeling and forecasting of time series. Recommended reading West, M. and Harrison, J. (1997). models, (2 nd

### Slope and Rate of Change

Chapter 1 Slope and Rate of Change Chapter Summary and Goal This chapter will start with a discussion of slopes and the tangent line. This will rapidly lead to heuristic developments of limits and the

### Threshold Autoregressive Models in Finance: A Comparative Approach

University of Wollongong Research Online Applied Statistics Education and Research Collaboration (ASEARC) - Conference Papers Faculty of Informatics 2011 Threshold Autoregressive Models in Finance: A Comparative

### Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows

TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents