ICCS 2019 Main Track (MT) Session 15

Time and Date: 10:15 - 11:55 on 14th June 2018

Room: 1.3

Chair: To be announced

106 A Novel Partition Method for Busy Urban Area Based on Spatial-Temporal Information [abstract]
Abstract: Finding the regions where people appear plays a key role in many fields like user behavior analysis, urban planning, etc. Therefore, as the first step, how to partition the world, especially the urban areas where people are crowd and active, into regions is very crucial. In this paper, we propose a novel method called Restricted Spatial-Temporal DBSCAN(RST-DBSCAN). The key idea is to partition busy urban areas based on spatial-temporal information. Arbitrary and separated shapes of regions in urban areas would be then obtained. Besides, we would further get busier region earlier by RST-DBSCAN. Experimental results show that our approach yields significant improvements over existing methods on a real-world dataset extracted from Gowalla, a location-based social network.
Ai Zhengyang, Zhang Kai, Shupeng Wang, Chao Li, Xiao-Yu Zhang and Shicong Li
116 Simple Spatial Scaling Rules behind Complex Cities [abstract]
Abstract: Although most of wealth and innovation have been the result of human interaction and cooperation, we are not yet able to quantitatively predict the spatial distributions of three main elements of cities: population, roads, and socioeconomic interactions. By a simple model mainly based on spatial attraction and matching growth mechanisms, we reveal that the spatial scaling rules of these three elements are in a consistent framework, which allows us to use any single observation to infer the others. All numerical and theoretical results are consistent with empirical data from ten representative cities. In addition, our model can also provide a general explanation of the origins of the universal super- and sub-linear aggregate scaling laws and accurately predict kilometre-level socioeconomic activity. And the theoretical analysis method is original which is based on growth instead of mean-field assumptions. The active population (AP) concept proposed by us is another contribution, which is a mixture of residential and working populations according to the duration of their activities in the region. AP is a more appropriate proxy than simply residential population for estimating socioeconomic activities. The density distribution of AP is ρ(r)∝r^(-β) (R_t^(1+β)-r^(1+β) )~r^(-β) which can also reconcile the conflict between area-size allometry and the exponential decay of population from city centre to urban fringe found in the literature. Our work opens a new avenue for uncovering the evolution of cities in terms of the interplay among urban elements, and it has a broad range of applications.
Ruiqi Li, Xinmiao Sun and Gene Stanley
144 Mention Recommendation with Context-aware Probabilistic Matrix Factorization [abstract]
Abstract: Mention as a key feature on social networks can break through the effect of structural trapping and expand the visibility of a message. Although existing works usually use rank learning as implementation strategy before performing mention recommendation, these approaches may interfere with the influening factor exploration and cause some biases. In this paper, we propose a novel Context-aware Mention recommendation model based on Probabilistic Matrix Factorization (CMPMF). This model considers four important mention contextual factors including topic relevance, mention affinity, user profile similarity and message semantic similarity to measure the relevance score from users and messages dimensions. We fuse these mention contextual factors in latent spaces into the framework of probabilistic matrix factorization to improve the performance of mention recommendation. Through evaluation on a real-world dataset from Weibo, the empirically study demonstrates the effectiveness of discovered mention contextual factors. We also observe that topic relevance and mention affinity play a much significant role in the mention recommendation task. The results demonstrate our proposed method outperforms the state-of-the-art algorithms.
Bo Jiang, Ning Li and Zhigang Lu
167 Synchronization under control in complex networks for a panic model [abstract]
Abstract: After a sudden catastrophic event occurring in a population of individuals, panic can spread, persist and become more problematic than the catastrophe itself. In this paper, we explore through a computational approach the possibility to control the panic level in complex networks built with a recent behavioral model. After stating a rigorous theoretical framework, we propose a numerical investigation in order to establish the effect of the topology of the network on this control process, with randomly generated networks, and we compare the panic level for two distinct topology sets on a given network.
Cantin Guillaume, Lanza Valentina and Verdière Nathalie
214 Personalized Ranking in Dynamic Graphs Using Nonbacktracking Walks [abstract]
Abstract: Centrality has long been studied as a method of identifying node importance in networks. In this paper we study a variant of several walk-based centrality metrics based on the notion of a nonbacktracking walk, where the pattern iji is forbidden in the walk. Specifically, we focus our analysis on dynamic graphs, where the underlying data stream the network is drawn from is constantly changing. Efficient algorithms for calculating nonbactracking walk centrality scores in static and dynamic graphs are provided and experiments on graphs with several million vertices and edges are conducted. For the static algorithm, comparisons to a traditional linear algebraic method of calculating scores show that our algorithm produces scores of high accuracy within a theoretically guaranteed bound. Comparisons of our dynamic algorithm to the static show speedups of several orders of magnitude as well as a significant reduction in space required.
Eisha Nathan, Geoffrey Sanders and Van Henson