Complex networks are nowadays employed in several applications. Modeling urban street networks is one of them, and in particular to analyze criminal aspects of a city. Several research groups have focused on such application, but until now, there is a lack of a well-defined methodology for employing complex networks in a whole crime analysis process, i.e. from data preparation to a deep analysis of criminal communities. Furthermore, the “toolset” available for those works is not complete enough, also lacking techniques to maintain up-to-date, complete crime datasets and proper assessment measures. In this sense, we propose a threefold methodology for employing complex networks in the detection of highly criminal areas within a city. Our methodology comprises three tasks: (i) Mapping of Urban Crimes; (ii) Criminal Community Identification; and (iii) Crime Analysis. Moreover, it provides a proper set of assessment measures for analyzing intrinsic criminality of communities, especially when considering different crime types. We show our methodology by applying it to a real crime dataset from the city of San Francisco—CA, USA. The results confirm its effectiveness to identify and analyze high criminality areas within a city. Hence, our contributions provide a basis for further developments on complex networks applied to crime analysis.
Other works include the proposals of Galbrun @cite_3 , who focus on crime mapping to estimate the probability of a crime occurrence within a street segment; of Fitterer @cite_4 , who use a statistical model to predict crimes in the city of Vancouver; and of Bogomolov @cite_9 , who predict in London by using mobile data. Our work differs from theirs because (i) we consider crimes within a more complete and up-to-date period; (ii) we map crimes directly, there is no space summarization in the crime mapping phase; and (iii) we benefit from complex networks, which are a reliable toolset to design georeferenced data.
@cite_9 @cite_4 @cite_3
2199318833 2056712395 121858502 2113796482 2301635754 2155458379 144670803 1978208906 2007027649 9248908 1484003379 1998797494 2144475703 1776456436 2105042294 2739269730 2140200133 1883704353 1991818741 265421414
Advancements in mobile technology and computing have fostered the collection of a large number of civic datasets that capture the pulse of urban life. Furthermore, the open government and data initiative has led many local authorities to make these datasets publicly available, hoping to drive innovation that will further improve the quality of life for the city-dwellers. In this paper, we develop a novel application that utilizes crime data to provide safe urban navigation. Specifically, using crime data from Chicago and Philadelphia we develop a risk model for their street urban network, which allows us to estimate the relative probability of a crime on any road segment. Given such model we define two variants of the SafePaths problem where the goal is to find a short and low-risk path between a source and a destination location. Since both the length and the risk of the path are equally important but cannot be combined into a single objective, we approach the urban-navigation problem as a biobjective shortest path problem. Our algorithms aim to output a small set of paths that provide tradeoffs between distance and safety. Our experiments demonstrate the efficacy of our algorithms and their practical applicability. Crime is classically âunpredictableâ. It is not necessarily random, but neither does it take place consistently in space or time. A better theoretical understanding is needed to facilitate practical crime prevention solutions that correspond to specific places and times. In this study, we discuss the preliminary results of a crime forecasting model developed in collaboration with the police department of a United States city in the Northeast. We first discuss our approach to architecting datasets from original crime records. The datasets contain aggregated counts of crime and crime-related events categorized by the police department. The location and time of these events is embedded in the data. Additional spatial and temporal features are harvested from the raw data set. Second, an ensemble of data mining classification techniques is employed to perform the crime forecasting. We analyze a variety of classification methods to determine which is best for predicting crime âhotspotsâ. We also investigate classification on increase or emergence. Last, we propose the best forecasting approach to achieve the most stable outcomes. The result of our research is a model that takes advantage of implicit and explicit spatial and temporal data to make reliable crime predictions. It is undoubtedly cliche to say that we are in the Age of Big Data Analytics or Data Science; every computing and IT publication you find talks about Big Data and companies no longer are interested in software engineers and analysts but instead they are looking for Data Scientists! In spite of the excessive use of the term, the truth of the matter is that data has never been more available and the increase in computation power allows for more sophisticated tools to identify patterns in the data and on the networks that governs these systems (complex networks). Crime is not different, the open data phenomena has spread to thousand of cities in the world, which are making data about crime activity available for any citizen to look at. Furthermore, new criminology studies argue that criminals typically commit crimes in areas in which they are familiar, usually close to home. Using this information we propose a new model based on networks to build links between crimes in close physical proximity. We show that the structure of the criminal activity can be partially represented by this spatial network of sites. In this paper we describe this process and the analysis of the networks we have constructed to find patterns in the underlying structure of criminal activity. This study proposes a street-level space‐time hotspot detection method to analyse crime incidents recorded at the street-address level and provides description of the micro-level variation of crime incidents over space and time. It expands the notion of search-window techniques widely used in crime science by developing a method that can account for the spatial‐temporal distribution of crime incidents measured in network distance. The study first describes the methodological framework by presenting the concept of a new type of search window and how it is used in the process of statistical testing for detecting crime hotspots. This is followed by analyses using 1 a simulated distribution of points along the street network, and 2 a set of real street-crime incident data. The simulation study demonstrates that the proposed method is effective in identifying space‐time hotspots, which include those that are not detected by a non-temporal method. The empirical analysis of the drug markets and assaults in downtown Buffalo, New York, revealed a detailed space‐time signature of each type of crime, highlighting the recurrent nature of drug dealing at specific locations as well as the sporadic tendency of assault incidents. Abstract Street profile analysis is a new method for analyzing temporal and spatial crime patterns along major roadways in metropolitan areas. This crime mapping technique allows for the identification of crime patterns along these street segments. These are linear spaces where aggregate crime patterns merge with crime attractors generators and human movement to demonstrate how directionality is embedded in city infrastructures. Visually presenting the interplay between these criminological concepts and land use can improve police crime management strategies. This research presents how this crime mapping technique can be applied to a major roadway in Burnaby, Canada. This technique is contrasted with other crime mapping methods to demonstrate the utility of this approach when analyzing the rate and velocity of crime patterns overtime and in space. Motivated by empirical observations of spatio-temporal clusters of crime across a wide variety of urban settings, we present a model to study the emergence, dynamics, and steady-state properties of crime hotspots. We focus on a two-dimensional lattice model for residential burglary, where each site is characterized by a dynamic attractiveness variable, and where each criminal is represented as a random walker. The dynamics of criminals and of the attractiveness field are coupled to each other via specific biasing and feedback mechanisms. Depending on parameter choices, we observe and describe several regimes of aggregation, including hotspots of high criminal activity. On the basis of the discrete system, we also derive a continuum model; the two are in good quantitative agreement for large system sizes. By means of a linear stability analysis we are able to determine the parameter values that will lead to the creation of stable hotspots. We discuss our model and results in the context of established crim... Prior work on criminal incident prediction has relied primarily on the historical crime record and various geospatial and demographic information sources. Although promising, these models do not take into account the rich and rapidly expanding social media context that surrounds incidents of interest. This paper presents a preliminary investigation of Twitter-based criminal incident prediction. Our approach is based on the automatic semantic analysis and understanding of natural language Twitter posts, combined with dimensionality reduction via latent Dirichlet allocation and prediction via linear modeling. We tested our model on the task of predicting future hit-and-run crimes. Evaluation results indicate that the model comfortably outperforms a baseline model that predicts hit-and-run incidents uniformly across all days. Abstract This short paper introduces the six papers comprising the Special Section on Crime Forecasting. A longer title for the section could have been “Forecasting crime for policy and planning decisions and in support of tactical deployment of police resources.” Crime forecasting for police is relatively new. It has been made relevant by recent criminological theories, made possible by recent information technologies including geographic information systems (GIS), and made desirable because of innovative crime management practices. While focused primarily on the police component of the criminal justice system, the six papers provide a wide range of forecasting settings and models including UK and US jurisdictions, long- and short-term horizons, univariate and multivariate methods, and fixed boundary versus ad hoc spatial cluster areal units for the space and time series data. Furthermore, the papers include several innovations for forecast models, with many driven by unique features of the problem area and data. We present a method for automatically identifying and validating predictive relationships between the visual appearance of a city and its non-visual attributes (e.g. crime statistics, housing prices, population density etc.). Given a set of street-level images and (location, city-attribute-value) pairs of measurements, we first identify visual elements in the images that are discriminative of the attribute. We then train a predictor by learning a set of weights over these elements using non-linear Support Vector Regression. To perform these operations efficiently, we implement a scalable distributed processing framework that speeds up the main computational bottleneck (extracting visual elements) by an order of magnitude. This speedup allows us to investigate a variety of city attributes across 6 different American cities. We find that indeed there is a predictive relationship between visual elements and a number of city attributes including violent crime rates, theft rates, housing prices, population density, tree presence, graffiti presence, and the perception of danger. We also test human performance for predicting theft based on street-level images and show that our predictor outperforms this baseline with 33 higher accuracy on average. Finally, we present three prototype applications that use our system to (1) define the visual boundary of city neighborhoods, (2) generate walking directions that avoid or seek out exposure to city attributes, and (3) validate user-specified visual elements for prediction. Planners and social psychologists have suggested that the recognizability of the urban environment is linked to people's socio-economic well-being. We build a web game that puts the recognizability of London's streets to the test. It follows as closely as possible one experiment done by Stanley Milgram in 1972. The game picks up random locations from Google Street View and tests users to see if they can judge the location in terms of closest subway station, borough, or region. Each participant dedicates only few minutes to the task (as opposed to 90 minutes in Milgram's). We collect data from 2,255 participants (one order of magnitude a larger sample) and build a recognizability map of London based on their responses. We find that some boroughs have little cognitive representation; that recognizability of an area is explained partly by its exposure to Flickr and Foursquare users and mostly by its exposure to subway passengers; and that areas with low recognizability do not fare any worse on the economic indicators of income, education, and employment, but they do significantly suffer from social problems of housing deprivation, poor living conditions, and crime. These results could not have been produced without analyzing life off- and online: that is, without considering the interactions between urban places in the physical world and their virtual presence on platforms such as Flickr and Foursquare. This line of work is at the crossroad of two emerging themes in computing research - a crossroad where "web science" meets the "smart city" agenda. Preface to the Fifth Edition Acknowledgments About the Authors Chapter 1: Eight Fallacies about Crime The Dramatic Fallacy The Cops and Courts Fallacy The Not-Me Fallacy The Innocent- Youth Fallacy The Ingenuity Fallacy The Organized Crime Fallacy The Big Gang Fallacy The Agenda Fallacy Chapter 2: The Chemistry for Crime Risky Settings Stages of a Criminal Act First Three Elements of a Criminal Act Eck's Crime Triangle Predatory Crimes Calming the Waters and Looking after Places Hot Products The General Chemistry of Crime Chapter 3: Offenders Make Decisions The Decision to Commit a Crime Offenders Respond to Everyday Cues Odd and Bizarre Crimes Chapter 4: How Violence Erupts Making Students Angry in a Lab In Real Life Fights vs. Predatory Attacks Violent Decisions It Might Not Work Out Well Chapter 5: Bringing Crime to You Four Stages in the History of Everyday Life Life and Crime in the Convergent City Crime and the Divergent Metropolis Population Density, Shifts, and Patterns of Crime The Great Paradox: Central City Problems Versus Self-Report Evidence Chapter 6: Teenage Crime Perspective on Youth Crime Teenage Zigzags Chapter 7: Big Gang Theory What are Gang Crimes? Fundamentals The Puzzle The Reason for a Gang Chapter 8: Crime Multipliers One Crime Requires Another One Crime Disinhibits Another One Crime Advertises Another One Crime Entices Another One Crime Sets Up Another One Crime Escalates Into Another One Crime Starts A Victim Chain One Co-Offender Attacks Another Chapter 9: Moving Stolen Goods The Thief and the Public Inviting People to Steal More It's Easier to Sell Stolen Goods to the Poor New Avenues for Stolen Goods Chapter 10: Situational Crime Prevention Four Natural Experiments Situational Prevention and Crime Analysis Diverse Applications of Situational Crime Prevention Chapter 11: Local Design Against Crime Remarkable Research on Local Supervision Oscar Newman's Four Types of Space Versions of a Village The Offender-Target Convergence Process Seven Studies in Reducing Local Crime Chapter 12: "White-Collar" Crime How Offenders Get to Their Targets Crimes of Specialized Access Organizational Rank The Specialized-Access Crime Grid Chapter 13: Crime and Social Change Technology, Rightly Understood The Clean Water Example A General Approach: Summing Up This Book How to Think about Changing Crime References Index In this paper we focus on the locations explicit and implicit in users descriptions of their surroundings. We propose a statistical language modeling approach to identifying locations in arbitrary text, and investigate several ways to estimate the models, based on the term frequency and the user frequency. The geotagged public photos in Flickr serve as a convenient ground truth. Our results show that we can predict location within a one kilometer by one kilometer cell with 17 accuracy, and within a three kilometer radius around such a one kilometer cell with 40 accuracy, using only a photo's tags. This is significantly better than the state of the art. Further we examine several estimation strategies that leverage the physical proximity of places, and show that for sparsely represented locations, smoothing from the immediate neighborhood improves results. We also show that estimation strategies based on user frequency are much more reliable than approaches based on the raw term frequency. In this paper, we propose a citywide and real-time model for estimating the travel time of any path (represented as a sequence of connected road segments) in real time in a city, based on the GPS trajectories of vehicles received in current time slots and over a period of history as well as map data sources. Though this is a strategically important task in many traffic monitoring and routing systems, the problem has not been well solved yet given the following three challenges. The first is the data sparsity problem, i.e., many road segments may not be traveled by any GPS-equipped vehicles in present time slot. In most cases, we cannot find a trajectory exactly traversing a query path either. Second, for the fragment of a path with trajectories, they are multiple ways of using (or combining) the trajectories to estimate the corresponding travel time. Finding an optimal combination is a challenging problem, subject to a tradeoff between the length of a path and the number of trajectories traversing the path (i.e., support). Third, we need to instantly answer users' queries which may occur in any part of a given city. This calls for an efficient, scalable and effective solution that can enable a citywide and real-time travel time estimation. To address these challenges, we model different drivers' travel times on different road segments in different time slots with a three dimension tensor. Combined with geospatial, temporal and historical contexts learned from trajectories and map data, we fill in the tensor's missing values through a context-aware tensor decomposition approach. We then devise and prove an object function to model the aforementioned tradeoff, with which we find the most optimal concatenation of trajectories for an estimate through a dynamic programming solution. In addition, we propose using frequent trajectory patterns (mined from historical trajectories) to scale down the candidates of concatenation and a suffix-tree-based index to manage the trajectories received in the present time slot. We evaluate our method based on extensive experiments, using GPS trajectories generated by more than 32,000 taxis over a period of two months. The results demonstrate the effectiveness, efficiency and scalability of our method beyond baseline approaches. Our goal is to automatically detect patterns of crime. Among a large set of crimes that happen every year in a major city, it is challenging, time-consuming, and labor-intensive for crime analysts to determine which ones may have been committed by the same individual(s). If automated, data-driven tools for crime pattern detection are made available to assist analysts, these tools could help police to better understand patterns of crime, leading to more precise attribution of past crimes, and the apprehension of suspects. To do this, we propose a pattern detection algorithm called Series Finder, that grows a pattern of discovered crimes from within a database, starting from a "seed" of a few crimes. Series Finder incorporates both the common characteristics of all patterns and the unique aspects of each specific pattern, and has had promising results on a decade's worth of crime pattern data collected by the Crime Analysis Unit of the Cambridge Police Department. Recent research has shown that surprisingly rich models of human behavior can be learned from GPS (positional) data. However, most research to date has concentrated on modeling single individuals or aggregate statistical properties of groups of people. Given noisy real-world GPS data, we—in contrast—consider the problem of modeling and recognizing activities that involve multiple related individuals playing a variety of roles. Our test domain is the game of capture the flag—an outdoor game that involves many distinct cooperative and competitive joint activities. We model the domain using Markov logic, a statistical relational language, and learn a theory that jointly denoises the data and infers occurrences of high-level activities, such as capturing a player. Our model combines constraints imposed by the geometry of the game area, the motion model of the players, and by the rules and dynamics of the game in a probabilistically and logically sound fashion. We show that while it may be impossible to directly detect a multi-agent activity due to sensor noise or malfunction, the occurrence of the activity can still be inferred by considering both its impact on the future behaviors of the people involved as well as the events that could have preceded it. We compare our unified approach with three alternatives (both probabilistic and nonprobabilistic) where either the denoising of the GPS data and the detection of the high-level activities are strictly separated, or the states of the players are not considered, or both. We show that the unified approach with the time window spanning the entire game, although more computationally costly, is significantly more accurate. We present an efficient method for geolocalization in urban environments starting from a coarse estimate of the location provided by a GPS and using a simple untextured 2.5D model of the surrounding buildings. Our key contribution is a novel efficient and robust method to optimize the pose: We train a Deep Network to predict the best direction to improve a pose estimate, given a semantic segmentation of the input image and a rendering of the buildings from this estimate. We then iteratively apply this CNN until converging to a good pose. This approach avoids the use of reference images of the surroundings, which are difficult to acquire and match, while 2.5D models are broadly available. We can therefore apply it to places unseen during training. The high degree of variance of crime rates across space (and across time) is one of the oldest puzzles in the social sciences (see Quetelet (1835)). Our empirical work strongly suggests that this variance is not the result of observed or unobserved geographic attributes. This paper presents a model where social interactions create enough covariance across individuals to explain the high cross- city variance of crime rates. This model provides a natural index of social interactions which can compare the degree of social interaction across crimes, across geographic 1units and across time. Our index gives similar results for different data samples and suggests that the amount of social interactions are highest in petty crimes (such as larceny and auto theft), moderate in more serious crimes (assault, burglary and robbery) and almost negligible in murder and rape. The index of social interactions is also applied to non-criminal choices and we find that there is substantial interaction in schooling choice. This chapter examines the possibility to analyze and compare human activities in an urban environment based on the detection of mobile phone usage patterns. Thanks to an unprecedented collection of counter data recording the number of calls, SMS, and data transfers resolved both in time and space, we confirm the connection between temporal activity profile and land usage in three global cities: New York, London, and Hong Kong. By comparing whole cities’ typical patterns, we provide insights on how cultural, technological, and economical factors shape human dynamics. At a more local scale, we use clustering analysis to identify locations with similar patterns within a city. Our research reveals a universal structure of cities, with core financial centers all sharing similar activity patterns and commercial or residential areas with more city-specific patterns. These findings hint that as the economy becomes more global, common patterns emerge in business areas of different cities across the globe, while the impact of local conditions still remains recognizable on the level of routine people activity. There is a need for event organizers and emergency response personnel to detect emerging, potentially critical crowd situations at an early stage during city-wide mass gatherings. In this work, we introduce and describe mathematical methods based on pedestrian-behavior models to infer and visualize crowd conditions from pedestrians' GPS location traces. We tested our approach during the 2011 Lord Mayor's Show in London by deploying a system able to infer and visualize in real-time crowd density, crowd turbulence, crowd velocity and crowd pressure. To collection location updates from festival visitors, a mobile phone app that supplies the user with event-related information and periodically logs the device's location was distributed. We collected around four million location updates from over 800 visitors. The City of London Police consulted the crowd condition visualization to monitor the event. As an evaluation of the usefulness of our approach, we learned through interviews with police officers that our approach helps to assess occurring crowd conditions and to spot critical situations faster compared to the traditional video-based methods. With that, appropriate measure can be deployed quickly helping to resolve a critical situation at an early stage. Human observers make a variety of perceptual inferences about pictures of places based on prior knowledge and experience. In this paper we apply computational vision techniques to the task of predicting the perceptual characteristics of places by leveraging recent work on visual features along with a geo-tagged dataset of images associated with crowd-sourced urban perception judgments for wealth, uniqueness, and safety. We perform extensive evaluations of our models, training and testing on images of the same city as well as training and testing on images of different cities to demonstrate generalizability. In addition, we collect a new densely sampled dataset of streetview images for 4 cities and explore joint models to collectively predict perceptual judgments at city scale. Finally, we show that our predictions correlate well with ground truth statistics of wealth and crime.