{"id":170824,"date":"2016-07-03T10:26:01","date_gmt":"2016-07-03T17:26:01","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/project\/urban-computing\/"},"modified":"2018-04-07T17:32:40","modified_gmt":"2018-04-08T00:32:40","slug":"urban-computing","status":"publish","type":"msr-project","link":"https:\/\/www.microsoft.com\/en-us\/research\/project\/urban-computing\/","title":{"rendered":"Urban Computing"},"content":{"rendered":"<p class=\"asset-content\"><!-- .asset-content --><span id=\"ede837b0-77e4-40d0-a983-8ee34a533535\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Imageede837b0-77e4-40d0-a983-8ee34a533535\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-urbancomputing.jpg\" alt=\"\" \/><\/span><\/p>\n<h2>Concept\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/%e5%9f%8e%e5%b8%82%e8%ae%a1%e7%ae%97\/\">\u4e2d\u6587\u4e3b\u9875<\/a>)<\/h2>\n<p align=\"justify\"><em>Urban computing<\/em> is a process of acquisition, integration, and analysis of big and heterogeneous data generated by a diversity of sources in urban spaces, such as sensors, devices, vehicles, buildings, and human, to tackle the major issues that cities face, e.g. air pollution, increased energy consumption and traffic congestion. Urban computing connects unobtrusive and ubiquitous sensing technologies, advanced data management and analytics models, and novel visualization methods, to create win-win-win solutions that improve urban <i>environment<\/i>, <i>human<\/i> life quality, and <i>city<\/i> operation systems. Urban computing also helps us understand the nature of urban phenomena and even predict the future of cities. A survey paper on urban computing:<\/p>\n<p align=\"justify\"><b>Yu Zheng, <\/b>Licia Capra, Ouri Wolfson, Hai Yang. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/urban-computing-concepts-methodologies-and-applications\/\">Urban Computing: concepts, methodologies, and applications<\/a>. ACM Transaction on Intelligent Systems and Technology (<b>ACM TIST<\/b>). 2014.<\/p>\n<p align=\"justify\"><strong>Urban computing<\/strong> is also a\u00a0research project in Microsoft Research, led by Dr. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/yuzheng\/\"><b>Yu Zheng<\/b><\/a> since March 2008. By analyzing the big data generated in urban spaces, a series of urban computing applications have been enabled as follows. One of core research problems is\u00a0to fuse data\u00a0across different domains. The other is to learn knowledge from spatio-temporal data, e.g. trajectories.<\/p>\n<p align=\"justify\">Yu Zheng. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/methodologies-for-cross-domain-data-fusion-an-overview\/\">Methodologies for Cross-Domain Data Fusion: An Overview<\/a>. IEEE Transactions on Big Data, vol. 1, no. 1. 2015. (<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/cross-domain-data-fusion\/\">A Tutorial<\/a>)<\/p>\n<p align=\"justify\">Yu Zheng. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/trajectory-data-mining-an-overview\/\">Trajectory Data Mining: An Overview<\/a>. ACM Transaction on Intelligent Systems and Technology. 2015, vol. 6, issue 3. (<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/trajectory-data-mining\">A Tutorial<\/a>)<\/p>\n<h2 align=\"justify\">News<\/h2>\n<ul>\n<li>2017.4.9: We are organizing the 6th International Workshop on Urban Computing (<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"http:\/\/urbcomp.ist.psu.edu\/2017\">UrbComp 2017<\/a>) in conjunction with KDD 2017.<\/li>\n<li>2017.4.9: A tutorial on <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/cross-domain-data-fusion\/\">Cross-domain Data Fusion<\/a>. Download slide decks for free!<\/li>\n<\/ul>\n<h1>Representative Research<\/h1>\n<table style=\"border-collapse: collapse;border-spacing: inherit\">\n<tbody>\n<tr>\n<td style=\"padding: inherit;border: inherit;vertical-align: bottom\"><span id=\"b0727f6f-945b-4139-9f04-12d75a2b5955\" class=\"ImageBlock fn\"><img loading=\"lazy\" decoding=\"async\" id=\"Imageb0727f6f-945b-4139-9f04-12d75a2b5955\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-bigdata.jpg\" alt=\"\" width=\"370\" height=\"282\" \/><span id=\"ImageCaptionb0727f6f-945b-4139-9f04-12d75a2b5955\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/td>\n<td style=\"padding: inherit;border: inherit\"><b>Smart Transportation<\/b><\/p>\n<ul>\n<li>Finding smart driving directions<\/li>\n<li>Large-Scale dynamic taxi ridesharing<\/li>\n<li>A passenger-cabbie recommender system<\/li>\n<li>Instant travel time estimation of a path<\/li>\n<li>Traffic predictions for a bike sharing system<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<tr>\n<td style=\"padding: inherit;border: inherit\"><b>The Intelligent Environment<\/b><\/p>\n<ul>\n<li>Infer and forecast fine-grained air quality<\/li>\n<li>Suggest locations for monitoring stations<\/li>\n<li>Diagnose urban noises using big data<\/li>\n<li>Pollution emissions from vehicles<\/li>\n<\/ul>\n<\/td>\n<td style=\"padding: inherit;border: inherit\"><b>Big Data-Driven Urban Planning<\/b><\/p>\n<ul>\n<li>Discover functional regions in a city<\/li>\n<li>Glean underlying problems in road networks<\/li>\n<li>Location selection for ambulance stations<\/li>\n<li>Detecting urban black holes by human mobility<\/li>\n<li>Planning bike lanes based on sharing-bikes&#8217; trajectories<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<tr>\n<td style=\"padding: inherit;border: inherit\"><b>Urban Economy using Big Data<\/b><\/p>\n<ul>\n<li>Rank real estates based on big data<\/li>\n<li>Large-scale Dynamic City Express<\/li>\n<li>Construct popular routes from check-ins<\/li>\n<\/ul>\n<\/td>\n<td style=\"padding: inherit;border: inherit\"><b>Detecting Urban Anomalies<\/b><\/p>\n<ul>\n<li>Detect collective anomalies based on cross-domain datasets<\/li>\n<li>Detect and diagnose traffic anomalies<\/li>\n<li>Predict flow of crowds in\u00a0every region\u00a0of\u00a0a city<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<tr>\n<td style=\"padding: inherit;border: inherit\"><b>Urban Energy<\/b><\/p>\n<ul>\n<li>City-wide gas consumption of vehicles<\/li>\n<li>Indoor air quality monitoring for buildings<\/li>\n<\/ul>\n<\/td>\n<td style=\"padding: inherit;border: inherit\">\n<ul>\n<li><strong>Released Datasets<\/strong><\/li>\n<li><strong>Slide Decks, Videos and MOOCs<\/strong><\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\t\t\t<div class=\"moray-accordion\" data-show=\"false\">\n\t\t\t\t\t\t\t<div class=\"clearfix\">\n\t\t\t\t\t<div\n\t\t\t\t\t\tclass=\"btn-group align-items-center mb-g float-sm-right\"\n\t\t\t\t\t\trole=\"group\"\n\t\t\t\t\t\tdata-mount=\"collapse-controls\"\n\t\t\t\t\t\tdata-bi-aN=\"accordion-collapse-controls\"\n\t\t\t\t\t\tdata-target=\"#accordion-1\">\n\t\t\t\t\t\t<button class=\"btn btn-link m-0\" aria-disabled=\"false\" aria-pressed=\"false\" data-action=\"expand\" type=\"button\" data-bi-cN=\"Expand all\">Expand all<\/button>\n\t\t\t\t\t\t<span aria-hidden=\"true\"> | <\/span>\n\t\t\t\t\t\t<button class=\"btn btn-link m-0\" aria-disabled=\"false\" aria-pressed=\"false\" data-action=\"collapse\" type=\"button\" data-bi-cN=\"Collapse all\">Collapse all<\/button>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<ul class=\"accordion\" id=\"accordion-1\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"m-0\">\n\t\t\t<h4 class=\"accordion-header\">\n\t\t\t\t<button\n\t\t\t\t\tclass=\"btn btn-collapse m-0\"\n\t\t\t\t\ttype=\"button\"\n\t\t\t\t\tdata-mount=\"collapse\"\n\t\t\t\t\tdata-target=\"#collapse-2\"\n\t\t\t\t\taria-expanded=\"false\"\n\t\t\t\t\taria-controls=\"collapse-2\">\n\t\tIntelligent Environment\t\t\t\t<\/button>\n\t\t\t<\/h4>\n\t\t\t<div class=\"collapse\" id=\"collapse-2\">\n\t\t\t\t<div class=\"accordion-body\">\n\t\t\t\t\t\t\t\t\t\t<h1>The Intelligent Environment<\/h1>\n<h2>Tackling Air Pollution\u00a0Using Big Data<\/h2>\n<p>Refer to Urban Air&#8217;s <a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/urban-air\/\">homepage<\/a> for more details.<\/p>\n<h3>A. Real-Time Air Quality Inference<\/h3>\n<p><span id=\"637cdc8a-d832-4857-96f4-c7625ed5bb0a\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Image637cdc8a-d832-4857-96f4-c7625ed5bb0a\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-uair.jpg\" alt=\"\" \/><span id=\"ImageCaption637cdc8a-d832-4857-96f4-c7625ed5bb0a\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p><b><\/b>Public Website: <a href=\"http:\/\/urbanair.msra.cn\/\">http:\/\/urbanair.msra.cn\/<\/a> Install Windows phone App <a href=\"http:\/\/www.windowsphone.com\/s?appid=f36d5a33-2ccc-45f5-afd2-0c1afc5fc6dc\">here<\/a>.<\/p>\n<p><b>Goal<\/b>: We infer the real-time and fine-grained air quality information throughout a city, based on the (historical and real-time) air quality data reported by existing monitor stations and a variety of data sources we observed in the city, such as meteorology, traffic flow, human mobility, structure of road networks, and point of interests (POIs).<\/p>\n<p><b>Methodology<\/b>: We propose a semi-supervised learning approach based on a co-training framework that consists of two separated classifiers. One is a spatial classifier based on an artificial neural network (ANN), which takes spatially-related features (e.g., the density of POIs and length of highways) as input to model the spatial correlation between air qualities of different locations. The other is a temporal classifier based on a linear-chain conditional random field (CRF), involving temporally-related features (e.g., traffic and meteorology) to model the temporal dependency of air quality in a location.<\/p>\n<p><b>Publication:<\/b><\/p>\n<p>[1]<b> <\/b>Yu Zheng, Furui Liu, Hsun-Ping Hsie. <a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/u-air-when-urban-air-quality-inference-meets-big-data\/\">U-Air: When Urban Air Quality Inference Meets Big Data<\/a>. 19th SIGKDD conference on Knowledge Discovery and Data Mining (<b>KDD 2013<\/b>).[2] Yu Zheng, Xuxu Chen, Qiwei Jin, Yubiao Chen, Xiangyun Qu, Xin Liu, Eric Chang, Wei-Ying Ma, Yong Rui, Weiwei Sun. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/a-cloud-based-knowledge-discovery-system-for-monitoring-fine-grained-air-quality\/\">A Cloud-Based Knowledge Discovery System for Monitoring Fine-Grained Air Quality<\/a>. MSR-TR-2014-40.<\/p>\n<h3>B. Forecast Fine-Grained Air Quality<\/h3>\n<p><span id=\"9a634b9d-eed6-49b0-896d-869888af8892\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Image9a634b9d-eed6-49b0-896d-869888af8892\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/\/urbancomputing-flyer-forecast.png\" alt=\"\" \/><span id=\"ImageCaption9a634b9d-eed6-49b0-896d-869888af8892\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p><b>Goal<\/b>: We forecast the reading of an air quality monitoring station in the next 48 hours, using a data-driven method that considers the current meteorological data, weather forecasts, and the air quality data of the station and that of other stations within a few hundred kilometers to the station.<\/p>\n<p><b>Methodology:<\/b> Our predictive model is comprised of four major components: 1) a linear regression-based temporal predictor to model the local factor of air quality, 2) a neural network-based spatial predictor modeling the global factors, 3) a dynamic aggregator combining the predictions of the spatial and temporal predictors according to the meteorological data, and 4) an inflection predictor to capture the sudden changes of air quality.<\/p>\n<p><b>Publication:<\/b><\/p>\n<p>[1]<b> Yu Zheng<\/b>, Xiuwen Yi, Ming Li, Ruiyuan Li, Zhangqing Shan, Eric Chang, Tianrui Li. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/forecasting-fine-grained-air-quality-based-on-big-data\/\">Forecasting Fine-Grained Air Quality Based on Big Data<\/a>. In the Proceeding of the 21th SIGKDD conference on Knowledge Discovery and Data Mining (<b>KDD 2015<\/b>). (<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/Data-1.zip\">Data<\/a>)(<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/forecasting20air20quality-kdd2015-presentation-yuzheng.pptx\">PPT<\/a>)<\/p>\n<h3>C. Suggesting Locations for New Station Deployment<\/h3>\n<p>Given a limited budget to build a few additional air quality monitoring stations, where shall we put them? The research solves this problem from the perspective of maximizing the inference accuracy and stability.<\/p>\n<p><span id=\"1193facf-dfda-4652-8dee-7f8d09f6df91\" class=\"ImageBlock fn\"><span id=\"ImageCaption1193facf-dfda-4652-8dee-7f8d09f6df91\" class=\"ImageCaptionCoreCss ImageCaption\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-213316\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2014\/03\/urbanair_station-selection.png\" alt=\"urbanair_station-selection\" width=\"596\" height=\"203\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2014\/03\/urbanair_station-selection.png 740w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2014\/03\/urbanair_station-selection-300x102.png 300w\" sizes=\"(max-width: 596px) 100vw, 596px\" \/><\/span><\/span><\/p>\n<p><strong>Publication:<\/strong><\/p>\n<p>[1] Hsun-Ping Hsieh*, Shou-De Lin, <b>Yu Zheng<\/b>. <a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/inferring-air-quality-for-station-location-recommendation-based-on-urban-big-data\/\">Inferring Air Quality for Station Location Recommendation Based on Big Data<\/a>. In the Proceeding of the 21th SIGKDD conference on Knowledge Discovery and Data Mining (<b>KDD 2015<\/b>).<\/p>\n<h3><strong>D. Identifying the Root Cause of Air Pollution<\/strong><\/h3>\n<p>The research identifies the spatio-temporal causality between air pollutants of different cities, suggesting the root cause of air pollution based on AI\u00a0 and big data technology.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-full wp-image-417785\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2014\/03\/flyer-air-pollution-causality.png\" alt=\"\" width=\"878\" height=\"209\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2014\/03\/flyer-air-pollution-causality.png 878w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2014\/03\/flyer-air-pollution-causality-300x71.png 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2014\/03\/flyer-air-pollution-causality-768x183.png 768w\" sizes=\"(max-width: 878px) 100vw, 878px\" \/><\/p>\n<p><strong>Publication:<\/strong><\/p>\n<p>[1]\u00a0Julie Yixuan Zhu, Chao Zhang, Huichu Zhang, Shi Zhi, Victor O.K. Li, Jiawei Han, and <strong>Yu Zheng<\/strong>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/pg-causality-identifying-spatiotemporal-causal-pathways-air-pollutants-urban-big-data\/\">pg-Causality: Identifying Spatiotemporal Causal Pathways for Air Pollutants with Urban Big Data.<\/a> IEEE Transactions on Big Data. DOI: 10.1109\/TBDATA.2017.2723899<\/p>\n<p><b>Media Coverage:<\/b><\/p>\n<p>[1] <a href=\"http:\/\/www.technologyreview.com\/lists\/innovators-under-35\/2013\/visionary\/yu-zheng\/\">Analyzing newly available data about the intricacies of urban life could make cities better<\/a>.\u201d <b>MIT Technology Review<\/b>. 2013.8.21[2] Interviewed by IFeng.com. <a href=\"http:\/\/tech.ifeng.com\/talk\/specialtalk\/special\/citycomputing\/\">Big data can predict air quality<\/a>. 2013.11.29 (In Chineses)[3] ComputerWorld: <a href=\"http:\/\/www.computerworld.com\/article\/2934596\/green-it\/microsoft-predicts-chinas-air-pollution-with-data-analysis.html\">Microsoft predicts China&#8217;s air pollution with data analysis<\/a>, 2015.6.11[4] Ming Pao (HK): <a href=\"http:\/\/news.mingpao.com\/pns\/\u5fae\u8edf\u5927\u6578\u64da\u5206\u6790%20\u5be6\u6642\u76e3\u6e2c\u6e2f\u7a7a\u6c23\/web_tc\/article\/20150609\/s00002\/1433786930171\">Microsoft predicts air quality with big data<\/a>, 2015.6.10[5] GeekWire Reporter: <a href=\"http:\/\/www.geekwire.com\/2015\/pollution-beijing-reaches-extreme-levels-heres-microsoft-research-help\/\">What Microsoft Research is doing to help Beijing air pollution<\/a>.\u00a02015.11.30[6] NBC News: <a href=\"http:\/\/www.nbcnews.com\/tech\/innovation\/microsoft-ibm-eye-big-business-opportunity-china-s-air-pollution-n487001\">Microsoft, IBM Eye Big Business Opportunity in China&#8217;s Air Pollution<\/a>. 2015.12.28[7] Reuters: <a href=\"http:\/\/www.reuters.com\/article\/us-china-pollution-idUSKBN0UB1KB20151229\">Tech giants spot opportunity in forecasting China&#8217;s smog<\/a>, 2015.12.28[8] China Daily: <a href=\"http:\/\/usa.chinadaily.com.cn\/china\/2016-01\/19\/content_23145602.htm\">Microsoft, IBM eye Technology to forecast air pollution in China<\/a>. 2016.1.19<\/p>\n<p>________________________________________________________<\/p>\n<h2>Diagnosing Urban Noise Using Big Data<\/h2>\n<p><span id=\"afc46592-a618-433e-b2eb-e84bf21526f1\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Imageafc46592-a618-433e-b2eb-e84bf21526f1\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-urbannoise-flyer.png\" alt=\"\" \/><span id=\"ImageCaptionafc46592-a618-433e-b2eb-e84bf21526f1\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p>Refer to the <a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/citynoise\/\">homepage of CityNoise<\/a> for details.<\/p>\n<p><b>Goal:<\/b> we infer the fine-grained noise situation (consisting of a noise pollution indicator and the composition of noises) of different times of day for each region of NYC, by using the 311 complaint data together with social media, road network data, and Points of Interests (POIs).<\/p>\n<p><b>Methodology:<\/b> We model the noise situation of NYC with a three dimension tensor, where the three dimensions stand for regions, noise categories, and time slots, respectively. Supplementing the missing entries of the tensor through a context-aware tensor decomposition approach, we recover the noise situation throughout NYC. The information can inform people and officials\u2019 decision making.<\/p>\n<p><b>Publication<\/b>:<\/p>\n<p>[1] Yu Zheng<b>,<\/b> Tong Liu, Yilun Wang, Yanchi Liu, Yanmin Zhu, Eric Chang. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/diagnosing-new-york-citys-noises-with-ubiquitous-data\/\">Diagnosing New York City\u2019s Noises with Ubiquitous Data<\/a>. In Proceedings of the 16th ACM International Joint Conference on Pervasive and Ubiquitous Computing (<b>UbiComp 2014<\/b>).[2] Tong Liu, Yu Zheng, Lubin Liu, Yanchi Liu, Yanmin Zhu. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/methods-for-sensing-urban-noises\/\">Methods for Sensing Urban Noises<\/a>. MSR-TR-2014-66, May 2014.[3] Yilun Wang, Yu Zheng, Tong Liu. <a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/a-noise-map-of-new-york-city\/\">A Noise Map of New York City<\/a>. In Proc. of Ubicomp 2014, Demo.<\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/Context20matrices20and20tensor20data.zip\">Data<\/a> and <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/Released20codes.zip\">Code<\/a> Released.<\/p>\n<p>________________________________________________________________<\/p>\n<h2>Predicting Urban Water Quality Based on Big Data<\/h2>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-248381\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/07\/flyer-IJCAI_water-quality-1024x282.png\" alt=\"flyer-IJCAI_water quality\" width=\"836\" height=\"230\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/07\/flyer-IJCAI_water-quality-1024x282.png 1024w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/07\/flyer-IJCAI_water-quality-300x83.png 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/07\/flyer-IJCAI_water-quality-768x211.png 768w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/07\/flyer-IJCAI_water-quality.png 1134w\" sizes=\"(max-width: 836px) 100vw, 836px\" \/><\/p>\n<p>Urban water quality is of great importance to our daily lives. Prediction of urban water quality help control water pollution and protect human health. In this work, we forecast the water quality of a station over the next few hours, using a multitask multi-view learning method to fuse multiple datasets from different domains. In particular, our learning model comprises two alignments. The first alignment is the spaio-temporal view alignment, which combines local spatial and temporal information of each station. The second alignment\u00a0 is the prediction alignment among stations, which captures their spatial correlations and performs co-predictions by incorporating these correlations. This approach has been evaluated based on the data of Shenzhen city in China.<\/p>\n<p><strong>Publication:<\/strong><\/p>\n<p>[1] <span class=\"associated-people\">Ye Liu, <strong>Yu Zheng<\/strong>, Yuxuan Liang, Shuming Liu, David S. Rosenblum,<\/span>\u00a0<u><span style=\"color: #0066cc\">Urban Water Quality Prediction based on Multi-task Multi-view Learning\u00a0,<\/span><\/u><span class=\"venue\"> in Proceedings of the 25th International Joint Conference on Artificial Intelligence (<\/span><span class=\"published-in\"><strong>IJCAI 2016<\/strong>)<\/span><\/p>\n\t\t\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/li>\n\t\t\t\t\t\t<li class=\"m-0\">\n\t\t\t<h4 class=\"accordion-header\">\n\t\t\t\t<button\n\t\t\t\t\tclass=\"btn btn-collapse m-0\"\n\t\t\t\t\ttype=\"button\"\n\t\t\t\t\tdata-mount=\"collapse\"\n\t\t\t\t\tdata-target=\"#collapse-3\"\n\t\t\t\t\taria-expanded=\"false\"\n\t\t\t\t\taria-controls=\"collapse-3\">\n\t\tSmart Transportation\t\t\t\t<\/button>\n\t\t\t<\/h4>\n\t\t\t<div class=\"collapse\" id=\"collapse-3\">\n\t\t\t\t<div class=\"accordion-body\">\n\t\t\t\t\t\t\t\t\t\t<h1>Intelligent\u00a0Transportation<\/h1>\n<h2>Large-Scale Dynamic Taxi Ridesharing Service<\/h2>\n<p><span id=\"460e5776-aac9-40c0-b1a1-3a2733e61636\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Image460e5776-aac9-40c0-b1a1-3a2733e61636\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-tshare.jpg\" alt=\"\" \/><span id=\"ImageCaption460e5776-aac9-40c0-b1a1-3a2733e61636\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p><b>Abstract<\/b>: We present a large-scale taxi ridesharing service, which efficiently serves real-time requests sent by taxi users and generates ridesharing schedules that reduce the total travel distance significantly. We first propose a taxi searching algorithm using a spatio-temporal index to quickly retrieve candidate taxies that could satisfy a user query. A schedule allocation algorithm is then proposed to check each candidate taxi so as to insert the user\u2019s trip into the schedule of the taxi. Our service can serve 40% additional taxi users while saving 15% travel distance over no ridesharing on average.<\/p>\n<p><b>Publications: <\/b><\/p>\n<p>[1] Shuo Ma, Yu Zheng, Ouri Wolfson. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/t-share-a-large-scale-dynamic-taxi-ridesharing-service\/\">T-Share: A Large-Scale Dynamic Taxi Ridesharing Service<\/a>. IEEE International Conference on Data Engineering (<b>ICDE 2013<\/b>) <b>Best Paper Runner-up Award.<\/b>[2] Shuo Ma*, <b>Yu Zheng<\/b>, Ouri Wolfson. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/real-time-city-scale-taxi-ridesharing\/\">Real-Time City-Scale Taxi Ridesharing<\/a>. IEEE Transactions on Knowledge and Data Engineering (<b>TKDE<\/b>), vol. 27, No. 7, July 2015. [<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"http:\/\/www.cs.uic.edu\/~sma\/ridesharing\/\">Codes<\/a>] [<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/t-drive-trajectory-data-sample\/\">Data<\/a>]<\/p>\n<h2>Travel Time Estimation of a Path Based on Trajectories<\/h2>\n<p><strong><span id=\"6623a069-a3df-4364-8253-5a6e24cca0b9\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Image6623a069-a3df-4364-8253-5a6e24cca0b9\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-pathtravtime.png\" alt=\"\" \/><span id=\"ImageCaption6623a069-a3df-4364-8253-5a6e24cca0b9\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/strong><\/p>\n<p><strong>Abstract<\/strong>: We propose a citywide and real-time model for estimating the travel time of any path (represented as a sequence of connected road segments)\u00a0in a city instantly, based on the GPS trajectories of vehicles received in current time slots and over a period of history as well as map data sources.\u00a0The 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.\u00a0Second, 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. Third, we need to instantly answer users\u2019 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.<\/p>\n<p><strong>Publications:<\/strong><\/p>\n<p>[1] Yilun Wang, Yu Zheng, Yexiang Xue. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/travel-time-estimation-of-a-path-using-sparse-trajectories\/\">Travel Time Estimation of a Path using Sparse Trajectories<\/a>. In Proceedings of the 20th SIGKDD conference on Knowledge Discovery and Data Mining (<b>KDD 2014<\/b>). (<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/Data20and20codes.zip\">Data and codes<\/a>)<\/p>\n<h2>Smart Driving Directions Based on Taxi Trajectories<\/h2>\n<p><span id=\"b133fa8f-f9e1-440d-a58c-cd19f4ff3233\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Imageb133fa8f-f9e1-440d-a58c-cd19f4ff3233\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-drivedirections.jpg\" alt=\"\" \/><span id=\"ImageCaptionb133fa8f-f9e1-440d-a58c-cd19f4ff3233\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p><b>Goal<\/b>: In this research, we aim to mine the time-dependent and practically quickest driving route for end users using GPS-equipped taxicabs traveling in a city.<\/p>\n<p><b>Insight<\/b>: The time that a driver traverses a route depends on three aspects: 1) The physical feature of a route, such as distance, the number of traffic lights and direction turns; 2) The time-dependent traffic flow on the route; 3) A user\u2019s drive behavior. Thus, a good routing service should consider these three aspects (routes, traffic and drivers), which are far beyond the scope of the shortest path computing.<\/p>\n<p>GPS-equipped taxis can be regarded as mobile sensors probing traffic flows on road surfaces, and taxi drivers are usually experienced in finding the fastest (quickest) route to a destination based on their knowledge. Consequently, the trajectories of taxicabs already have the knowledge of experienced drivers, physical routes and traffic conditions.<\/p>\n<table>\n<tbody>\n<tr>\n<td style=\"width: 145px;vertical-align: middle\"><span id=\"d36c210f-fc8a-4c06-9858-e6c4fbcfd27d\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Imaged36c210f-fc8a-4c06-9858-e6c4fbcfd27d\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-landmarkgraph.jpg\" alt=\"\" \/><span id=\"ImageCaptiond36c210f-fc8a-4c06-9858-e6c4fbcfd27d\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/td>\n<td>\n<p>In the beginning of this work, we mine smart driving directions from the historical GPS trajectories of a large number of taxis, and provide a user with the practically fastest route to a given destination at a given departure time. We build our system based on a trajectory dataset generated by over 33,000 taxis in a period of 3 months. According to extensive synthetic experiments and in-the-field evaluations, this system saves 5 minutes per 30-minute trip. See details in the following publications.<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><b>Publications<\/b><\/p>\n<p>[1] Jing Yuan, Yu Zheng, et al. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/t-drive-driving-directions-based-on-taxi-trajectories\/\">T-Drive: Driving Directions Based on Taxi Trajectories<\/a>. In ACM SIGSPATIAL GIS 2010, <b>The<\/b> <b>Best Paper Runner-Up Award<\/b>.[2] Jing Yuan, Yu Zheng, et al, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/t-drive-enhancing-driving-directions-with-taxi-drivers-intelligence\/\">T-Drive: Enhancing Driving Directions with Taxi Drivers&#8217; Intelligence<\/a>. Transactions on Knowledge and Data Engineering<b> (TKDE)<\/b>.<\/p>\n<p><b>Media Reports<\/b><\/p>\n<p>[1] <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"http:\/\/www.technologyreview.com\/computing\/26686\/?p1=A2\">Adding cabbie know-how to online maps<\/a>, MIT Technology Review, 2010.11.6[2] <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"http:\/\/www.newscientist.com\/article\/dn19703-follow-that-cab-racing-google-maps-on-city-streets.html\">Follow that cab! Racing Google Maps on city streets<\/a>, NewScientist, 2010.11.5<\/p>\n<p><b>Further Research<\/b>: Later, we expanded this research by considering the drive behavior and traffic prediction as well as other factors affecting driving, such as weather conditions. Specifically, we proposed a model incorporating day of the week, time of day, weather conditions, and individual driving strategies (both of the taxi drivers and of the end user for whom the route is being computed). Using this model, our system predicts the traffic conditions of a future time (when the computed route is actually driven) and performs a self-adaptive driving direction service for a particular user. This service gradually learns a user\u2019s driving behavior from the user\u2019s GPS logs and customizes the fastest route for the user. Refer to the following publication for details.<\/p>\n<p><b>Publications<\/b><\/p>\n<p>[1] Jing Yuan, Yu Zheng, et al. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/driving-with-knowledge-from-the-physical-world\/\">Driving with Knowledge from the Physical World<\/a>. 17th SIGKDD conference on Knowledge Discovery and Data Mining (<b>KDD 2011<\/b>).<\/p>\n<p><b>Media Reports<\/b><\/p>\n<p>[1] &#8220;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"http:\/\/www.technologyreview.com\/communications\/38454\/?a=f\">A driving route made just for you<\/a>&#8220;, MIT Technology Review, 2011.8.30.<\/p>\n<h2>A Passenger-Cabbie Recommender System<\/h2>\n<p><span id=\"d2df8c5c-c264-4469-bbce-5da546881354\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Imaged2df8c5c-c264-4469-bbce-5da546881354\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-taxirecommender.jpg\" alt=\"\" \/><span id=\"ImageCaptiond2df8c5c-c264-4469-bbce-5da546881354\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p><b>Abstract<\/b>: We present a recommender for taxi drivers and people expecting to take a taxi, using the knowledge of 1) passengers\u2019 mobility patterns and 2) taxi drivers\u2019 pick-up behaviors learned from the GPS trajectories of taxicabs. First, this recommender provides taxi drivers with some locations (and the routes to these locations), towards which they are more likely to pick up passengers quickly (during the routes or at the parking places) and maximize the profit. Second, it recommends people with some locations (within a walking distance) where they can easily find vacant taxis. In our method, we propose a parking place detection algorithm and learn the above knowledge (represented by probabilities) from trajectories. Then, we feed the knowledge into a probabilistic model which estimates the profit of a parking place for a particular driver based on where and when the driver requests for the recommendation. We validate our recommender using trajectories generated by 12,000 taxis in 110 days.<\/p>\n<p><b>Publications<\/b><\/p>\n<p>[1] Jing Yuan, Yu Zheng, Liuhang Zhang, Xing Xie. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/where-to-find-my-next-passenger\/\">Where to Find My Next Passenger?<\/a> , 13th ACM International Conference on Ubiquitous Computing (<b>UbiComp 2011<\/b>).[2] Nicholas Jing Yuan, Yu Zheng, Liuhang Zhang, Xing Xie. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/t-finder-a-recommender-system-for-finding-passengers-and-vacant-taxis\/\">T-Finder: A Recommender System for Finding Passengers and Vacant Taxis<\/a>. accepted by IEEE Transactions on Knowledge and Data Engineering (<b>TKDE<\/b>).<\/p>\n<h2>Traffic Prediction in a Bike Sharing System<\/h2>\n<p><span id=\"9e5fb397-3fe9-4bfc-b7bb-c1233e73ce24\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Image9e5fb397-3fe9-4bfc-b7bb-c1233e73ce24\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/03\/\/urbancomputing-flyer-bike.png\" alt=\"\" \/><span id=\"ImageCaption9e5fb397-3fe9-4bfc-b7bb-c1233e73ce24\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p align=\"justify\"><strong>Abstract<\/strong>: Bike-sharing systems are widely deployed in many major cities, providing a conven\u00adient tra\u00adn\u00ads\u00ad\u00adpor\u00adtation mode for citizens\u2019 comm\u00adutes. As the rents\/returns of bikes at different stations in different periods are unbalanced, the bikes in a system need to be rebalanced frequently. In this paper, we propose a hierarchical prediction model to predict the number of bikes that will be rent from\/returned to each station cluster in a future period so that reallocation can be executed in advance.<\/p>\n<p align=\"justify\"><strong>Methodology<\/strong>: We first propose a bipartite clustering algori\u00adthm to cluster bike stations into groups, formula\u00adting a two-level hier\u00adarchy of stations. The total number of bikes that will be rent in a city is predicted by a Gradient Boosting Regression Tree (GBRT). Then a multi-similarity-based infer\u00aden\u00adce model is propo\u00adsed to predi\u00adct the rent propor\u00adtion across clusters and the inter-cluster transition, based on which the number of bikes rent from\/ returned to each cluster can be easily inferred.<\/p>\n<p><strong>Publication<\/strong>:<\/p>\n<p>[1] Yexin Lee, Yu Zheng, Huichu Zhang, Lei Chen. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/traffic-prediction-in-a-bike-sharing-system\/\">Traffic Prediction in a Bike Sharing System<\/a>, In Proceedings of the 23rd ACM International Conference on Advances in Geographical Information Systems (ACM SIGSPATIAL 2015) (<a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/Data.zip\">Data<\/a>)(<a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/Codes.zip\">Codes<\/a>)<\/p>\n\t\t\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/li>\n\t\t\t\t\t\t<li class=\"m-0\">\n\t\t\t<h4 class=\"accordion-header\">\n\t\t\t\t<button\n\t\t\t\t\tclass=\"btn btn-collapse m-0\"\n\t\t\t\t\ttype=\"button\"\n\t\t\t\t\tdata-mount=\"collapse\"\n\t\t\t\t\tdata-target=\"#collapse-4\"\n\t\t\t\t\taria-expanded=\"false\"\n\t\t\t\t\taria-controls=\"collapse-4\">\n\t\tData Driven Urban Planning\t\t\t\t<\/button>\n\t\t\t<\/h4>\n\t\t\t<div class=\"collapse\" id=\"collapse-4\">\n\t\t\t\t<div class=\"accordion-body\">\n\t\t\t\t\t\t\t\t\t\t<h1>Data-Driven Urban Planning<\/h1>\n<h2>Discovering Region of Different\u00a0Functions in a City Using Human Mobility and POIs<\/h2>\n<p><span id=\"01bfe410-8811-43d8-a705-50f518b449aa\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Image01bfe410-8811-43d8-a705-50f518b449aa\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-functionalregion.jpg\" alt=\"\" \/><span id=\"ImageCaption01bfe410-8811-43d8-a705-50f518b449aa\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p align=\"justify\"><strong>Goal<\/strong>: We propose a framework (titled DRoF) that Discovers Regions of different Functions, such as educational areas and business districts,\u00a0in a city using both human mobility among regions and points of interests (POIs) located in a region. The results generated by our framework can benefit a variety of applications, including urban planning, location choosing for a business, and social recommendations.<\/p>\n<p align=\"left\"><strong>Insight<\/strong>: We segment a city into disjointed regions according to major roads, such as highways and urban express ways. We infer the functions of each region using a topic-based inference model, which regards a region as a document, a function as a topic, categories of POIs (e.g., restaurants and shopping malls) as metadata (like authors, affiliations, and key words), and human mobility patterns (when people reach\/leave a region and where people come from and leave for) as words. As a result, a region is represented by a distribution of functions, and a function is featured by a distribution of mobility patterns.<\/p>\n<p align=\"left\"><strong>Publications: <\/strong><\/p>\n<p align=\"left\">[1] Jing Yuan, Yu Zheng, Xing Xie.\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/discovering-regions-of-different-functions-in-a-city-using-human-mobility-and-pois\/\">Discovering regions of different functions in a city using human mobility and POIs<\/a>. 18th SIGKDD conference on Knowledge Discovery and Data Mining (<b>KDD 2012<\/b>).<\/p>\n<p align=\"justify\">[2] Nicholas Jing Yuan, <b>Yu Zheng<\/b>, Xing Xie, Yingzi Wang, Kai Zheng, Hui Xiong. <a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/discovering-urban-functional-zones-using-latent-activity-trajectories\/\">Discovering Urban Functional Zones Using Latent Activity Trajectories<\/a>, IEEE Transactions on Knowledge and Data Engineering (<b>TKDE<\/b>), 2016.<\/p>\n<h2 align=\"left\">Glean the underlying problems in a City&#8217;s Road Network<\/h2>\n<p><span id=\"c22a4b02-48f9-4ffd-9327-f6ea51bc4945\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Imagec22a4b02-48f9-4ffd-9327-f6ea51bc4945\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-urbanplanning.jpg\" alt=\"\" \/><span id=\"ImageCaptionc22a4b02-48f9-4ffd-9327-f6ea51bc4945\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p align=\"left\"><b>Abstract<\/b>: Urban computing for city planning is one of the most significant applications in Ubiquitous computing. In this paper we detect flawed urban planning using the GPS trajectories of taxicabs traveling in urban areas. The detected results consist of 1) pairs of regions with salient traffic problems and 2) the linking structure as well as correlation among them. These results can evaluate the effectiveness of the carried out planning, such as a newly built road and subway lines in a city, and remind city planners of a problem that has not been recognized when they conceive future plans. We conduct our method using the trajectories generated by 30,000 taxis from March to May in 2009 and 2010 in Beijing, and evaluate our results with the real urban planning of Beijing.<\/p>\n<p><b>Publications<\/b><\/p>\n<p>[1] Yu Zheng, Yanchi Liu, Jing Yuan, Xing Xie, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/urban-computing-with-taxicabs\/\">Urban Computing with Taxicabs<\/a>, 13th ACM International Conference on Ubiquitous Computing (<b>UbiComp 2011<\/b>), Beijing, China, Sep. 2011. <b>The best paper nominee award<\/b>.[2] A technical report describing the map segmentation and trajectory projection details.<\/p>\n<p><b>Media Reports<\/b><\/p>\n<p>[1] &#8220;<a href=\"http:\/\/futureoftech-discuss.nbcnews.com\/_news\/2011\/09\/29\/8038525-taxicab-data-helps-ease-traffic?chromedomain=cosmiclog\">Taxicab data helps ease traffic<\/a>&#8220;. Future of Technology on NBCNEWS.com. 2011.9.30[2] &#8220;<a href=\"http:\/\/www.technologyreview.com\/communications\/38679\/?p1=MstRcnt\">GPS Data on Beijing Cabs Reveals the Cause of the Traffic Jams<\/a>&#8220;. MIT Technology Review, 2011.9.27. Featured on the first page.[3] &#8220;Urban computing based on taxicabs&#8221;. <a href=\"http:\/\/technews.acm.org\/archives.cfm?fo=2011-09-sep\/sep-28-2011.html#543781\">Reported by ACM TechNews<\/a>. 2011.9.27<\/p>\n<h2>Detect Urban Black holes Based on Human Mobility<\/h2>\n<p><span id=\"53a486c5-e955-401b-86df-c98d01288a31\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Image53a486c5-e955-401b-86df-c98d01288a31\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/03\/\/urbancomputing-blackholes-flyer.png\" alt=\"\" \/><span id=\"ImageCaption53a486c5-e955-401b-86df-c98d01288a31\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p align=\"left\"><strong>Abstract<\/strong>: An urban\u00a0black hole is a subgraph (or a region)\u00a0that has the overall inflow greater than the overall outflow by a threshold, while a volcano is a subgraph with the overall outflow greater than the overall inflow by a threshold. The online detection of black holes\/volcanos can timely reflect anomalous events, such as disasters, catastrophic accidents, and therefore help keep public safety. The patterns of black holes\/volcanos and the relations between them reveal human mobility patterns in a city, thus help formulate a better city planning or improve a system\u2019s operation efficiency.<\/p>\n<p align=\"left\"><strong>Publication<\/strong>:<\/p>\n<p align=\"left\">[1] Liang Hong, <b>Yu Zheng<\/b>, Duncan Yung, Jingbo Shang, Lei Zou. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/detecting-urban-black-holes-based-on-human-mobility-data\/\">Detecting Urban Black Holes Based on Human Mobility Data<\/a>. In Proceedings of the 23rd ACM International Conference on Advances in Geographical Information Systems (<b>ACM SIGSPATIAL 2015<\/b>). (<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/Source20Code.zip\">Codes<\/a>) (<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/citibike20tripdata.zip\">Data<\/a>)<\/p>\n<h2 align=\"left\">Planning Bike Lanes based on Sharing-Bikes\u2019 Trajectories<\/h2>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-full wp-image-391343\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2017\/06\/bike-kdd2017-flyer.png\" alt=\"\" width=\"960\" height=\"219\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/06\/bike-kdd2017-flyer.png 960w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/06\/bike-kdd2017-flyer-300x68.png 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/06\/bike-kdd2017-flyer-768x175.png 768w\" sizes=\"(max-width: 960px) 100vw, 960px\" \/><\/p>\n<p>Cycling as a green transportation mode has been promoted by many governments all over the world. As a result, constructing effective bike lanes has become a crucial task for governments promoting the cycling life style, as well-planned bike paths can reduce traffic congestion and decrease safety risks for both cyclists and motor vehicle drivers. Unfortunately, existing trajectory mining approaches for bike lane planning do not consider key realistic government constraints: 1) budget limitations, 2) construction convenience, and 3) bike lane utilization.\u00a0In this project, we propose a data-driven approach to develop bike lane construction plans based on large-scale real world bike trajectory data. We enforce these constraints to formulate our problem and introduce a flexible objective function to tune the benefit between coverage of the number of users and the length of their trajectories. We prove the NP-hardness of the problem and propose greedy-based heuristics to address it. Finally, we deploy our system on Microsoft Azure, providing extensive experiments and case studies to demonstrate the effectiveness of our approach.<\/p>\n<p><strong>Publications:<\/strong><\/p>\n<p>[1] Jie Bao, Tianfu He, Sijie Ruan, Yanhua Li, <strong>Yu Zheng<\/strong>. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/planning-bike-lanes-based-sharing-bikes-trajectories\/\">Planning bike lanes based on Sharing-bike\u2019s trajectories<\/a>. <span class=\"venue\">in Proceedings of the 23th SIGKDD conference on Knowledge Discovery and Data Mining (<\/span><span class=\"published-in\"><strong>KDD 2017<\/strong>).<\/span><\/p>\n\t\t\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/li>\n\t\t\t\t\t\t<li class=\"m-0\">\n\t\t\t<h4 class=\"accordion-header\">\n\t\t\t\t<button\n\t\t\t\t\tclass=\"btn btn-collapse m-0\"\n\t\t\t\t\ttype=\"button\"\n\t\t\t\t\tdata-mount=\"collapse\"\n\t\t\t\t\tdata-target=\"#collapse-5\"\n\t\t\t\t\taria-expanded=\"false\"\n\t\t\t\t\taria-controls=\"collapse-5\">\n\t\tUrban Energy Based on Big Data\t\t\t\t<\/button>\n\t\t\t<\/h4>\n\t\t\t<div class=\"collapse\" id=\"collapse-5\">\n\t\t\t\t<div class=\"accordion-body\">\n\t\t\t\t\t\t\t\t\t\t<h1>Urban Energy Based on Big Data<\/h1>\n<h3>A. Gas Consumption and Vehicle Emissions on Roads<\/h3>\n<p><span id=\"2261767c-127b-4f4f-9a3d-a6e3ac7bfff3\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Image2261767c-127b-4f4f-9a3d-a6e3ac7bfff3\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-gasconsumption.png\" alt=\"\" \/><span id=\"ImageCaption2261767c-127b-4f4f-9a3d-a6e3ac7bfff3\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p><b>Goal:<\/b> We instantly infers the gas consumption and pollution emission of vehicles traveling on a city\u2019s road network in a current time slot, using GPS trajectories from a sample of vehicles (e.g., taxicabs). The knowledge can be used to suggest cost-efficient driving routes as well as identifying road segments where gas has been wasted significantly.<\/p>\n<p><b>Methodology:<\/b> We propose a Travel Speed Estimation (TSE) model based on a context-aware matrix factorization approach. TSE leverages features learned from other data sources, e.g., map data and historical trajectories, to deal with the data sparsity problem. We then propose a Traffic Volume Inference (TVI) model to infer the number of vehicles passing each road segment per minute. TVI is an unsupervised Bayesian Network that incorporates multiple factors, such as travel speed, weather conditions and geographical features of a road. Given the travel speed and traffic volume of a road segment, gas consumption and emissions are calculated based on existing environmental theories. Refer to publication [1] for details.<\/p>\n<h3>B. Sensing Urban Refueling Behavior<\/h3>\n<p><span id=\"4c8653f8-f876-4d3e-a4f6-b0db8a6ace31\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Image4c8653f8-f876-4d3e-a4f6-b0db8a6ace31\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-urbanrefuel.jpg\" alt=\"\" \/><span id=\"ImageCaption4c8653f8-f876-4d3e-a4f6-b0db8a6ace31\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p>We propose a step toward real-time sensing of refueling behavior and citywide petrol consumption. We use reported trajectories from a fleet of GPS-equipped taxicabs to detect gas station visits, measure the time spent, and estimate overall demand. For times and stations with sparse data, we use collaborative filtering to estimate conditions. Our system provides real-time estimates of gas stations\u2019 wait times, from which recommendations could be made, an indicator of overall gas usage, from which macro-scale economic decisions could be made, and a geographic view of the efficiency of gas station placement. refer to publication [2] and [3] for details.<\/p>\n<p><b>Publications:<\/b><\/p>\n<p>[1] Jingbo Shang*,<b> Yu Zheng, <\/b>Wenzhu Tong, Eric Chang. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/inferring-gas-consumption-and-pollution-emission-of-vehicles-throughout-a-city\/\">Inferring Gas Consumption and Pollution Emission of Vehicles throughout a City<\/a>. In the Proceeding of the 20th SIGKDD conference on Knowledge Discovery and Data Mining (<b>KDD 2014<\/b>).<b> <\/b>[2] Fuzhen Zhang, David Wilkie, Yu Zheng, Xing Xie. <a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/sensing-the-pulse-of-urban-refueling-behavior\/\">Sensing the Pulse of Urban Refueling Behavior<\/a>. 15th ACM International Conference on Ubiquitous Computing (<b>UbiComp 2013<\/b>)[3] Fuzheng Zhang*, Nicholas Jing Yuan, David Wilkie, <b>Yu Zheng<\/b>, Xing Xie. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/sensing-the-pulse-of-urban-refueling-behavior-a-perspective-from-taxi-mobility\/\">Sensing the Pulse of Urban Refueling Behavior: A Perspective from Taxi Mobility<\/a>. ACM Transaction on Intelligent Systems and Technology (<b>ACM TIST<\/b>). 2015.<\/p>\n<p><b>Media coverage<\/b>: <a href=\"http:\/\/unglobalpulse.org\/node\/14803\">featured by United Nations<\/a>.<\/p>\n\t\t\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/li>\n\t\t\t\t\t\t<li class=\"m-0\">\n\t\t\t<h4 class=\"accordion-header\">\n\t\t\t\t<button\n\t\t\t\t\tclass=\"btn btn-collapse m-0\"\n\t\t\t\t\ttype=\"button\"\n\t\t\t\t\tdata-mount=\"collapse\"\n\t\t\t\t\tdata-target=\"#collapse-6\"\n\t\t\t\t\taria-expanded=\"false\"\n\t\t\t\t\taria-controls=\"collapse-6\">\n\t\tUrban Anomalies and Public Security\t\t\t\t<\/button>\n\t\t\t<\/h4>\n\t\t\t<div class=\"collapse\" id=\"collapse-6\">\n\t\t\t\t<div class=\"accordion-body\">\n\t\t\t\t\t\t\t\t\t\t<h1>Urban Anomalies and Security<\/h1>\n<h3>A. Forecasting Flow of Crowds Based on Big Data<\/h3>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-full wp-image-320762\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/09\/CrowdFlow_GIS06_Zheng.png\" alt=\"crowdflow_gis06_zheng\" width=\"882\" height=\"234\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/09\/CrowdFlow_GIS06_Zheng.png 882w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/09\/CrowdFlow_GIS06_Zheng-300x80.png 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/09\/CrowdFlow_GIS06_Zheng-768x204.png 768w\" sizes=\"(max-width: 882px) 100vw, 882px\" \/><\/p>\n<p><strong>Abstract<\/strong>: Predicting the movement of crowds in a city is strategically important for traffic management, risk assessment, and public safety. In this project, we propose predicting two types of flows of crowds in every region of a city based on big data, including human mobility data, weather conditions, and road network data. To develop a practical solution for citywide traffic prediction, we first partition the map of a city into regions using both its road network and historical records of human mobility. Our problem is different than the predictions of each individual\u2019s movements and each road segment\u2019s traffic conditions, which are computationally costly and not necessary from the perspective of public safety on a citywide scale. To model the multiple complex factors affecting crowd flows, we decompose flows into three components: seasonal (periodic patterns), trend (changes in periodic patterns), and residual flows (instantaneous changes). The seasonal and trend models are built as intrinsic Gaussian Markov random fields which can cope with noisy and missing data, whereas a residual model exploits the spatio-temporal dependence among different flows and regions, as well as the effect of weather.<\/p>\n<p><strong>Publications<\/strong><\/p>\n<p>[1] Minh X. Hoang, <strong>Yu Zheng<\/strong>, Ambuj K. Singh. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/forecasting-citywide-crowd-flows-based-big-data\/\">FCCF: Forecasting Citywide Crowd Flows Based on Big Data<\/a>. <span class=\"venue\">in Proceedings of the 24th ACM International Conference on Advances in Geographical Information Systems\u00a0(<\/span><span class=\"published-in\"><strong>ACM SIGSPATIAL 2016<\/strong>) (<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/09\/FCCF_GIS2016_YuZheng.pptx\">PPT<\/a>)<\/span><\/p>\n<p><span class=\"published-in\">Download <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/1drv.ms\/u\/s!AsWQUIUFkRXPgsNwTFBXLcPbPj1hfA\">Code and Data<\/a>!<\/span><\/p>\n<h3>B. Deep Learning-Based Crowd Flow Prediction<\/h3>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-large wp-image-320765\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/07\/DDN_ST_AAAI17_Zheng-1024x360.png\" alt=\"ddn_st_aaai17_zheng\" width=\"1024\" height=\"360\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/07\/DDN_ST_AAAI17_Zheng-1024x360.png 1024w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/07\/DDN_ST_AAAI17_Zheng-300x105.png 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/07\/DDN_ST_AAAI17_Zheng-768x270.png 768w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/07\/DDN_ST_AAAI17_Zheng.png 1164w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/p>\n<p><strong>Abstract<\/strong>: Forecasting the flow of crowds is of great importance to traffic management and public safety, yet a very challenging task affected by many complex factors, such as inter-region traffic, events and weather. In this paper, we propose a deep-learning-based approach, called ST-ResNet, to <em>collectively<\/em> forecast the in-flow and out-flow of crowds in each and every region through a city. We design the end-to-end structure of ST-ResNet based on unique properties of spatio-temporal data. More specifically, we employ the framework of the residual neural networks to model the temporal smoothness, period, and trend properties of crowd traffic, respectively. For each property, we design a branch of residual convolutional blocks, each of which models the spatial properties of crowd traffic. ST-ResNet learns to dynamically aggregate the output of the three residual neural networks based on data, assigning different weights to different branches and regions. The aggregation is further combined with external factors, such as weather and day of week, to predict the final traffic of crowds in each and every region. We evaluate ST-ResNet based on two types of crowd flows in Beijing and NYC, finding its performance outperforming the state-of-the-art.<\/p>\n<p><strong>Publications:<\/strong><\/p>\n<p>[1] Junbo Zhang, <strong>Yu Zheng<\/strong>, Dekang Qi. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/deep-spatio-temporal-residual-networks-for-citywide-crowd-flows-prediction\/\">Deep Spatio-Temporal Residual Networks for Citywide Crowd Flows Prediction<\/a>. In Proceedings of the\u00a0Thirty-First AAAI Conference on Artificial Intelligence (<strong>AAAI 2017<\/strong>) [<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/github.com\/lucktroy\/DeepST\/tree\/master\/scripts\/papers\/AAAI17\">code<\/a>][<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/github.com\/lucktroy\/DeepST\/tree\/master\/data\">data<\/a>][<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"http:\/\/urbanflow.sigkdd.com.cn\/\">system<\/a>][2] Junbo Zhang, <strong>Yu Zheng<\/strong>, Dekang Qi, Ruiyuan Li, Xiuwen Yi. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/dnn-based-prediction-model-spatial-temporal-data\/\">DNN-Based Prediction Model for Spatial-Temporal Data<\/a>. <span class=\"venue\">in Proceedings of the 24th ACM International Conference on Advances in Geographical Information Systems\u00a0(<\/span><span class=\"published-in\"><strong>ACM SIGSPATIAL 2016<\/strong>)<\/span> Demo Paper (<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"http:\/\/arxiv.org\/abs\/1610.00081\">arXiv version<\/a>)<\/p>\n<p><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"http:\/\/urbanflow.sigkdd.com.cn\/\">A Demo System<\/a><\/p>\n<h2>C. Detect Collective Anomalies from Cross-Domain Data<\/h2>\n<p><span id=\"8e2fd584-3efe-41b0-b119-2c364847a627\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Image8e2fd584-3efe-41b0-b119-2c364847a627\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/\/urbancomputing-collective_anomaly_flyer.png\" alt=\"\" \/><span id=\"ImageCaption8e2fd584-3efe-41b0-b119-2c364847a627\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p><strong>Abstract<\/strong>: The collective anom\u00adaly denotes a collection of nearby locations that are anomalous during a few consecutive time intervals in terms of phenomena collectively witnessed by multiple datasets. The collective anoma\u00adlies suggest there are underlying problems that may not be identified based on a single data source or in a single location. It also assoc\u00adiates individual locations and time intervals, formulating a panora\u00admic view of an event. To detect a collective anomaly is very challe\u00adn\u00adging, however, as different data\u00adsets have diff\u00aderent densities, distributions, and scales. Additional\u00adly, to find the spatio-temporal scope of a collective anomaly is time consu\u00adming as there are many ways to combine regions and time slots.<\/p>\n<p><strong>Publications<\/strong><\/p>\n<p>[1] Yu Zheng, Huichu Zhang, Yong Yu. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/detecting-collective-anomalies-from-multiple-spatio-temporal-datasets-across-different-domains\/\">Detecting Collective Anomalies from Multiple Spatio-Temporal Datasets across Different Domains<\/a>. In Proceedings of the 23rd ACM International Conference on Advances in Geographical Information Systems (<b>ACM SIGSPATIAL 2015<\/b>). (<a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/release_data.zip\">Data<\/a>) (<a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/release_code.zip\">Codes<\/a>)<\/p>\n<h2>d. Crowd Sensing of Traffic Anomalies in a City<\/h2>\n<p><b>[1] Detecting Traffic Anomalies<\/b>: We detect anomalies in a city according to the taxi trajectories. The anomaly could be caused by unexpected or sudden accidents, such as traffic control, protests, concerts, parades, celebrations, and large-scale sale promotion. In many cases, the anomaly occurs before the corresponding accident actually happens. If detecting the unusual mobility pattern of people in this region in advance, we can solve the problem early and avoid the happening of the tragedy.<\/p>\n<p><span id=\"b87ff041-aafb-44eb-adcb-2a3117318d3f\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Imageb87ff041-aafb-44eb-adcb-2a3117318d3f\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-anomaly.jpg\" alt=\"\" \/><span id=\"ImageCaptionb87ff041-aafb-44eb-adcb-2a3117318d3f\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p>[a] Wei Liu, Yu Zheng, Sanjay Chawla, Jing Yuan and Xing Xie. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/discovering-spatio-temporal-causal-interactions-in-traffic-data-streams\/\">Discovering Spatio-Temporal Causal Interactions in Traffic Data Streams<\/a>. In <b>KDD 2011<\/b>.[b] Linsey Xiaolin Pang, Sanjay Chawla, Wei Liu, and Yu Zheng. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/on-mining-anomalous-patterns-in-road-traffic-streams\/\">On Mining Anomalous Patterns in Road Traffic Streams<\/a>. In the 7th International Conference on Advanced Data Mining and Applications (ADMA 2011). <b>The best paper award<\/b><\/p>\n<p><b>[2] Diagnose and Describe Traffic Anomalies<\/b>: In publication , we identify the source traffic flow that results in an anomaly. In publication [d], we address the problem of detecting and describing traffic anomalies using crowd sensing with two forms of data, human mobility and social media.<\/p>\n<p><span id=\"fe976c7b-6578-4f70-bdab-13f2d6be3600\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Imagefe976c7b-6578-4f70-bdab-13f2d6be3600\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-crowdsensing_anomalies.png\" alt=\"\" \/><span id=\"ImageCaptionfe976c7b-6578-4f70-bdab-13f2d6be3600\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p> Sanjay Chawla, Yu Zheng, and Jiafeng Hu. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/inferring-the-root-cause-in-road-traffic-anomalies\/\">Inferring the root cause in road traffic anomalies<\/a>, IEEE International Conference on Data Mining (<b>ICDM 2012<\/b>).[d] Bei Pan, Yu Zheng, David Wilkie, and Cyrus Shahabi. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/crowd-sensing-of-traffic-anomalies-based-on-human-mobility-and-social-media\/\">Crowd Sensing of Traffic Anomalies based on Human Mobility and Social Media<\/a>. <b>ACM SIGSPATIAL<\/b> GIS 2013<\/p>\n\t\t\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/li>\n\t\t\t\t\t\t<li class=\"m-0\">\n\t\t\t<h4 class=\"accordion-header\">\n\t\t\t\t<button\n\t\t\t\t\tclass=\"btn btn-collapse m-0\"\n\t\t\t\t\ttype=\"button\"\n\t\t\t\t\tdata-mount=\"collapse\"\n\t\t\t\t\tdata-target=\"#collapse-7\"\n\t\t\t\t\taria-expanded=\"false\"\n\t\t\t\t\taria-controls=\"collapse-7\">\n\t\tUrban Economy\t\t\t\t<\/button>\n\t\t\t<\/h4>\n\t\t\t<div class=\"collapse\" id=\"collapse-7\">\n\t\t\t\t<div class=\"accordion-body\">\n\t\t\t\t\t\t\t\t\t\t<h2>Ranking Real Estates Using Big Data<\/h2>\n<p><span id=\"fe33aa0c-ffc2-4bc6-a926-d2fa537375e5\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Imagefe33aa0c-ffc2-4bc6-a926-d2fa537375e5\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-realestateranking.png\" alt=\"\" \/><span id=\"ImageCaptionfe33aa0c-ffc2-4bc6-a926-d2fa537375e5\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/p>\n<p><b>Abstract<\/b>: Ranking residential real estate based on a diversity of big data around a real estate: 1) geographical data, such as road network and points of interests (POI), 2) human mobility data, like public commuting data and taxi traces, and 3) people&#8217;s comments and reviews on these real estates and their surrounding POIs in online services. These datasets reveal the popularity and quality of the location where a real estate is located.<\/p>\n<p><b>Publications<\/b>:<\/p>\n<p>[1] Yanjie Fu, Hui Xiong, Yong Ge, Zijun Yao, Yu Zheng. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/exploiting-geographic-dependencies-for-real-estate-appraisal-a-mutual-perspective-of-ranking-and-clustering\/\">Exploiting Geographic Dependencies for Real Estate Appraisal: A Mutual Perspective of Ranking and Clustering<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>. In the Proceeding of the 20th SIGKDD conference on Knowledge Discovery and Data Mining (<b>KDD 2014<\/b>).[2] Yanjie Fu, Yong Ge, <b>Yu Zheng<\/b>, Zijun Yao, Yanchi Liu, Hui Xiong, Nicholas Jing Yuan. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/sparse-real-estate-ranking-with-online-user-reviews-and-offline-moving-behaviors\/\">Sparse Real Estate Ranking with Online User Reviews and Offline Moving Behaviors<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>. IEEE International Conference on Data Mining (ICDM 2014).<\/p>\n<h2>Large-Scale and Dynamic City Express<\/h2>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-large wp-image-282923\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/08\/cityexpress-zheng-tkde-1024x234.png\" alt=\"cityexpress-zheng-tkde\" width=\"1024\" height=\"234\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/cityexpress-zheng-tkde-1024x234.png 1024w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/cityexpress-zheng-tkde-300x68.png 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/cityexpress-zheng-tkde-768x175.png 768w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/08\/cityexpress-zheng-tkde.png 1406w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/p>\n<p><strong>Abstract<\/strong>: Due to the large number of requirements for city express services in recent years, the current city express system is found to be unsatisfactory for both the service providers and customers. In this paper, we are the first to systematically study the large-scale dynamic city express problem. We aim to increase both the effectiveness and the efficiency of the scheduling algorithm. The challenges of the problem stem from the highly dynamic environment, the NP-completeness with respect to the number of requests, and real-time demands for the scheduling result. our solution can save 37.5% manpower to achieve 80% satisfaction ratio compared to the basic solution.<\/p>\n<p><strong>Publications<\/strong>:<\/p>\n<p>[1] Siyuan Zhang, Lu Qin, <strong>Yu Zheng<\/strong>, and Hong Cheng. <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/effective-and-efficient-large-scale-dynamic-city-express\/\">Effective and Efficient: Large-scale Dynamic City Express<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>. IEEE Transactions on Data Engineering (<strong>TKDE<\/strong>)<\/p>\n<h2>Selecting Locations for Billboards Based on Trajectories of Vehicles<\/h2>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-large wp-image-283625\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/07\/billboard_VAST16_Zheng-1024x385.png\" alt=\"billboard_VAST16_Zheng\" width=\"1024\" height=\"385\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/07\/billboard_VAST16_Zheng-1024x385.png 1024w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/07\/billboard_VAST16_Zheng-300x113.png 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/07\/billboard_VAST16_Zheng-768x289.png 768w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/07\/billboard_VAST16_Zheng.png 1406w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/p>\n<p><strong>Abstract<\/strong>: The problem of formulating solutions immediately and comparing them rapidly for billboard placements has plagued advertising planners for a long time, owing to the lack of efficient tools for in-depth analyses to make informed decisions. In this study, we attempt to employ visual analytics that combines the state-of-the-art mining and visualization techniques to tackle this problem using large-scale GPS trajectory data. In particular, we present SmartAdP, an interactive visual analytics system that deals with the two major challenges including finding good solutions in a huge solution space and comparing the solutions in a visual and intuitive manner. An interactive framework that integrates a novel visualization-driven data mining model enables advertising planners to effectively and efficiently formulate good candidate solutions.<\/p>\n<p><strong>Publications:<\/strong><\/p>\n<p>[1] Dongyu Liu, Di Weng, Yuhong Li, Yingcai Wu, Jie Bao, <strong>Yu Zheng<\/strong>, Huaming Qu, \u201c<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/smartadp-visual-analytics-large-scale-taxi-trajectories-selecting-billboard-locations\/\">SmartAdP: Visual Analytics of Large-scale Taxi Trajectories for Selecting Billboard Locations<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>\u201d, in The IEEE Conference on Visual Analytics Science and Technology (<strong>IEEE VAST 2016<\/strong>).<\/p>\n<h2>Constructing Popular Routes from User Check-in Data<\/h2>\n<h2><span id=\"03273bd8-40a0-47ec-9280-6a8958f26846\" class=\"ImageBlock fn\"><img decoding=\"async\" id=\"Image03273bd8-40a0-47ec-9280-6a8958f26846\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/lbsn-poproute.jpg\" alt=\"\" \/><span id=\"ImageCaption03273bd8-40a0-47ec-9280-6a8958f26846\" class=\"ImageCaptionCoreCss ImageCaption\"><\/span><\/span><\/h2>\n<p><b>Abstract<\/b>: We present a Route Inference framework based on Collective Knowledge (RICK) to construct the popular routes from uncertain trajectories, e.g., a user&#8217;s check-in sequence in FourSquare, geo-tagged photos in Flickr, or the migratory trails of a bird. Explicitly, given a location sequence and a time span, the RICK is able to construct the top-k routes which sequentially pass through the locations within the specified time span, by aggregating such uncertain trajectories in a mutual reinforcement way (i.e., uncertain + uncertain \u2192 certain). Our work can benefit trip planning, traffic management, and animal movement studies.<\/p>\n<p><b>Publications<\/b>:<\/p>\n<p>[1] Ling-Yin Wei, Yu Zheng, Wen-Chih Peng, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/constructing-popular-routes-from-uncertain-trajectories\/\">Constructing Popular Routes from Uncertain Trajectories<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>. 18th SIGKDD conference on Knowledge Discovery and Data Mining (<b>KDD 2012<\/b>). (<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/www.dropbox.com\/s\/4nwb7zpsj25ibyh\/check-in%20data.zip\">Data<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>)[2] Hechen Liu, Ling-Yin We, Yu Zheng, Markus Schneider, Wen-Chih Peng. Route Discovery from Mining Uncertain Trajectories. Demo Paper, in IEEE International Conference on Data Mining (ICDM 2011).<\/p>\n\t\t\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/li>\n\t\t\t\t\t\t\t\t\t<\/ul>\n\t\t<\/div>\n\t\t\n<h1>Released Datasets<\/h1>\n<p>[1] <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/t-drive-trajectory-data-sample\/\"><b>T-Drive Taxi Trajectroies<\/b><\/a>: This is a sample of T-Drive taxi trajectory dataset which was generated by over 10,000 taxis in a period of one week in Beijing.<\/p>\n<p>[2] <a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/geolife-gps-trajectory-dataset-user-guide\/\"><b>GeoLife Trajectory Dataset<\/b><\/a>: This is a GPS trajectory dataset collected in (Microsoft Research Asia) <a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/geolife-gps-trajectory-dataset-user-guide\/\">GeoLife<\/a> project by 167 users in a period of over two years (from April 2007 to Dec. 2010). This trajectory dataset can be used for many research theme, such as mobility pattern mining, user activity recognition, location-based social networks, location privacy, and location recommendation.<\/p>\n<p>[3] <a href=\"http:\/\/www.cs.uic.edu\/~sma\/ridesharing\/\"><b>Taxi request simulator<\/b><\/a>: This simulator can generate people&#8217;s request for taxicabs on different road segments, using the knowledge mined from a large-scale real taxi trajectories. Each query consists of an origin, destination, and a timestamp.<\/p>\n<p>[4] <a href=\"https:\/\/www.dropbox.com\/s\/4nwb7zpsj25ibyh\/check-in%20data.zip\"><b>Check-in data from Foursquare<\/b><\/a>: Each check-in includes a venue ID, the category of the venue, a timestamp, and a user ID.<\/p>\n<p>[5] <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/u-air-when-urban-air-quality-inference-meets-big-data\/\"><b>Air quality data of Beijing and Shanghai<\/b><\/a><b>:<\/b> The data set is comprised of one-year (2013-2-8 to 2014-2-8) air quality data from air quality monitoring stations in Beijing and Shanghai.<\/p>\n<p>[6] <a href=\"https:\/\/onedrive.live.com\/redir?resid=CF159105855090C5!2774&authkey=!AFBIXgrChcesYC4&ithint=file,.zip\"><b>Traffic and geographical features of each road segments<\/b><\/a>: The package is comprised of six parts of data that were extracted from the GPS trajectories of taxicabs, road networks, POIs of Beijing, and video clips recording real traffic on roads.<\/p>\n<p>[7] <b><\/b><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/diagnosing-new-york-citys-noises-with-ubiquitous-data\/\"><b>Noise complaint data and geographical data of NYC<\/b><\/a>: This package is comprised of three parts of data. 1) tensors representing the 311 complaints on urban noise; 2) geographical feature of each region in NYC; 3) Real noise levels of 36 locations in NYC. Please cite the following two papers when using the dataset.<\/p>\n<p>[8] <a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/Data-1.zip\"><b>Air quality data, meteorological data and weather forecasts of 43 cities in China<\/b><\/a>. The dataset was used for air quality forecast and real-time inference. It also can be used for test cross-domain data fusion methods.<\/p>\n<p>[9] <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/traffic-prediction-in-a-bike-sharing-system\/\"><strong>Bike Sharing data coupled with weather conditions<\/strong><\/a>. The dataset contains bike usage (denoted by the number of check-outs and check-ins)\u00a0at each bike sharing station in NYC and Chicago. The weather condition data during the period,\u00a0in which\u00a0the bike sharing data is collected,\u00a0is also shared.<\/p>\n<p>[10] <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/detecting-collective-anomalies-from-multiple-spatio-temporal-datasets-across-different-domains\/\"><strong>Three datasets for detecting collective anomalies<\/strong><\/a>: This dataset is comprised of five parts\u00a0of\u00a0data, named Taxi Trip Data, Bike sharing data, 311 data, POIs and road network data of NYC.<\/p>\n<p>[11] <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/deep-spatio-temporal-residual-networks-for-citywide-crowd-flows-prediction\/\"><b>Inflow and outflow of crowds in each and every region of a city<\/b><\/a>: This data set\u00a0consists of\u00a0two types of\u00a0crowd flows.\u00a0One is a five-year\u00a0taxis flow in Beijing. The other is\u00a0bike usage in a bike sharing system in New York City. A research on predicting flow of crowds have been conducted based on this dataset. Please cite the following paper when using the dataset.\u00a0\u00a0(<a href=\"https:\/\/github.com\/lucktroy\/DeepST\/tree\/master\/scripts\/papers\/AAAI17\">code<\/a>)(<a href=\"https:\/\/github.com\/lucktroy\/DeepST\/tree\/master\/data\">data<\/a>)(<a href=\"http:\/\/urbanflow.sigkdd.com.cn\/\">system<\/a>)<\/p>\n<h1>Slide Decks and Videos of Speeches<\/h1>\n<h3>2017<\/h3>\n<ul>\n<li>Keynote at UrbComp2017: <a href=\"http:\/\/videolectures.net\/kdd2017_zheng_intelligent_cities\/\">Urban Computing: Enabling Intelligent Cities with AI and Big Data<\/a> (50 minutes), 2017.8, video.<\/li>\n<li>Tutorial at KDD 2017: <a href=\"http:\/\/uctutorial.chinacloudsites.cn\/\">Urban Computing: Enabling Intelligent Cities with AI and Big Data<\/a> (4hours), 2017.8<\/li>\n<li>Tutorial at DASFFA 2017: <a href=\"https:\/\/www.dropbox.com\/s\/g06kw73dhv58nka\/Urban%20computing-overview-2016-80min-tutorial.pptx?dl=0\">Urban Computing: Enabling Intelligent Cities with AI and Big Data\u00a0<\/a> (2hours), 2017.6<\/li>\n<\/ul>\n<h3>2016<\/h3>\n<ul>\n<li>2016.11.1: <a href=\"https:\/\/1drv.ms\/p\/s!AsWQUIUFkRXPgsNZxdjvBUkcJlp_nw\">keynote speech at\u00a0IWGS 2016<\/a>\u00a0in conjunction with\u00a0ACM SIGSPATIAL 2016<\/li>\n<li>2016.9.18\uff1a<a href=\"http:\/\/pan.baidu.com\/s\/1hsQBa3U\">Urban Computing for Urban Planning <\/a>(60min)<\/li>\n<li>2016.8.30: <a href=\"https:\/\/1drv.ms\/p\/s!AsWQUIUFkRXPgsNOfR9n5w52FKn7xw\">Urban Big Data Platform <\/a>(30min)<\/li>\n<li>2016.8.15: <a href=\"http:\/\/yun.baidu.com\/share\/link?shareid=659570496&uk=3693320195\">Urban Computing: An Overview<\/a> (Invited Talk at KDD 2016)<\/li>\n<li>2016.8.1\uff1a<a href=\"http:\/\/pan.baidu.com\/s\/1miJERzi\">Urban Computing for Transportation<\/a><\/li>\n<li>2016.2.1\uff1a<a href=\"http:\/\/pan.baidu.com\/s\/1skryatv\" target=\"_self\">a slide deck for a 90-minute overview on Urban Computing<\/a>.<\/li>\n<li>2016.1.1: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/trajectory-data-mining\/\">Tutorial on Trajectory Data Mining <\/a>(Download free slide decks)<\/li>\n<\/ul>\n<h3>2015<\/h3>\n<ul>\n<li>2015.10\uff1a<a href=\"http:\/\/pan.baidu.com\/s\/1bnHP3zT\" target=\"_self\">Slides for 2-hour Overview on Urban Computing<\/a><\/li>\n<li>2015.10: <a href=\"https:\/\/onedrive.live.com\/?authkey=%21AP2HUwAWevrJpH0&id=CF159105855090C5%2112099&cid=CF159105855090C5\">MOOC\u00a0about Urban Computing <\/a>(at XuetangX)(<a href=\"http:\/\/www.icourse163.org\/course\/msra-416001#\/info\" target=\"_self\">at iCourse<\/a>)<\/li>\n<li><a href=\"http:\/\/pan.baidu.com\/s\/1sj0YhHF\">20-minute presentation about Urban Air<\/a><\/li>\n<li>2015.1: Dr. Zheng&#8217;s Speech at the <a href=\"http:\/\/lkycic.sutd.edu.sg\/lkycic-events\/roundtable-of-thought-leaders-on-innovation-in-cities-data-social-behaviour-policy-2\/\">Roundtable of Thought Leaders on Innovation in Cities<\/a>: (<a href=\"https:\/\/www.youtube.com\/watch?v=pFwcsNb7Oig&feature=youtu.be&noredirect=1\">Video<\/a>)<\/li>\n<li>60-minute presentation for Universities<\/li>\n<li>70-minute presentation: <a href=\"https:\/\/onedrive.live.com\/view.aspx?resid=CF159105855090C5!21590&ithint=file%2cpptx&app=PowerPoint&authkey=!AAYiQfscedwzVZQ\">urban computing for the environment<\/a><\/li>\n<li>60-minute presentation: <a href=\"https:\/\/onedrive.live.com\/view.aspx?resid=CF159105855090C5!21591&ithint=file%2cpptx&app=PowerPoint&authkey=!APHw5HXkDvk5xyY\">urban computing for tackling air pollution<\/a><\/li>\n<\/ul>\n<h3>2014<\/h3>\n<ul>\n<li>2014.12: Prof. Zheng&#8217;s <a href=\"http:\/\/www.comp.hkbu.edu.hk\/v1\/?page=news&id=295\">Distinguished Lecture at Hong Kong Baptist University<\/a> (<a href=\"http:\/\/hkbutube.lib.hkbu.edu.hk\/st\/display.php?bibno=b3722768\">Video<\/a>)<\/li>\n<li><a href=\"http:\/\/hkbutube.lib.hkbu.edu.hk\/st\/display.php?bibno=b3722768\">1-hour MOOC on Urban Computing<\/a>.<\/li>\n<li><a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-urban_computing_with_big_data_2014-60min.pdf\">A slide deck for a 1-hour presentation<\/a><\/li>\n<li><a href=\"https:\/\/onedrive.live.com\/redir?resid=CF159105855090C5!3084&authkey=!ABhoo6evLJw8HhU&ithint=file,pptx\">A ppt for a 30-minute presentation<\/a><\/li>\n<\/ul>\n<h3>2013<\/h3>\n<ul>\n<li><a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-urban_computing_with_bigdata_2013_university.pdf\">A slide deck for 1-hour presentation<\/a><\/li>\n<\/ul>\n<h3>2012<\/h3>\n<ul>\n<li>A slide deck for a 20-minute presentation<\/li>\n<li><a class=\"invalidLink\" href=\"https:\/\/www.microsoft.com\/en-us\/research\/uploads\/prod\/2016\/02\/urbancomputing-urbancomputing_1h.pdf\">A slide deck for a 3-hour tutorial<\/a><\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Concept\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (\u4e2d\u6587\u4e3b\u9875) Urban computing is a process of acquisition, integration, and analysis of big and heterogeneous data generated by a diversity of sources in urban spaces, such as sensors, devices, vehicles, buildings, and human, to tackle the major issues that cities face, e.g. air pollution, increased energy consumption and traffic congestion. Urban computing connects unobtrusive [&hellip;]<\/p>\n","protected":false},"featured_media":0,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"footnotes":""},"research-area":[13555],"msr-locale":[268875],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-170824","msr-project","type-msr-project","status-publish","hentry","msr-research-area-search-information-retrieval","msr-locale-en_us","msr-archive-status-active"],"msr_project_start":"2008-03-18","related-publications":[391322,391331,370280,327593,291227,291221,295991,297851,277359,282911,241937,241931,241868,238349,238172,238350,168685,168705,168707,168722,168704,168634,168066,168662,168446,168410,166822,167467,167017,167887,167650,164619,166461,166674,166675,166189,167058,166986,166981,166730,166731,166676,166411,165884,165515,162505,165167,164935,165446,163788,163787,163766,164094,161748,162285,163738,163511,162898,162856,162703,163177,162007,162006,162382,162112,161563,161297,161298,159391,159482,160123,160121,160122,159125,159101,159126,158934,158734,156572],"related-downloads":[],"related-videos":[],"related-groups":[],"related-events":[],"related-opportunities":[],"related-posts":[],"related-articles":[],"tab-content":[],"slides":[],"related-researchers":[],"msr_research_lab":[199560],"msr_impact_theme":[],"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-project\/170824"}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-project"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-project"}],"version-history":[{"count":13,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-project\/170824\/revisions"}],"predecessor-version":[{"id":478629,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-project\/170824\/revisions\/478629"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=170824"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=170824"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=170824"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=170824"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=170824"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}