Related papers: Similarity Classification of Public Transit Statio…
We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs. As the core operation of graph similarity search, pairwise graph similarity computation is a…
In this paper we aim to demonstrate how physical perspective enriches usual statistical analysis when dealing with a complex system of many interacting agents of non-physical origin. To this end, we discuss analysis of urban public…
We report an analysis of the accessibility between different locations in big cities, which is illustrated with respect to London and Paris. The effects of the respective underground systems in facilitating more uniform access to diverse…
We consider a stylized formal model of public transportation, where a set of agents need to travel along a given road, and there is a bus that runs the length of this road. Each agent has a left terminal and a right terminal between which…
Equitable access to essential Points of Interest (POIs) such as healthcare facilities and grocery stores via public transit is a critical urban planning challenge. This paper introduces an interactive tool that analyzes the ease and equity…
Comparing the ranking of candidates by different voters is an important topic in social and information science with a high relevance from the point of view of practical applications. In general, ties and pairs of incomparable candidates…
The role of spatial data in tackling city-related tasks has been growing in recent years. To use them in machine learning models, it is often necessary to transform them into a vector representation, which has led to the development in the…
While existing social networking services tend to connect people who know each other, people show a desire to also connect to yet unknown people in physical proximity. Existing research shows that people tend to connect to similar people.…
We calculate an extensive set of characteristics for Internet AS topologies extracted from the three data sources most frequently used by the research community: traceroutes, BGP, and WHOIS. We discover that traceroute and BGP topologies…
We analyze the public transport networks (PTNs) of a number of major cities of the world. While the primary network topology is defined by a set of routes each servicing an ordered series of given stations, a number of different…
Measuring similarity between complex objects is a fundamental task in many scientific fields. When objects are represented as graphs, graph similarity/distance measures offer a powerful framework for quantifying structural resemblance.…
With people constantly migrating to different urban areas, our mobility needs for work, services and leisure are transforming rapidly. The changing urban demographics pose several challenges for the efficient management of transit services.…
Joint ranking statistics are used to distinguish real from random coincidences, ideally considering whether shared parameters are consistent with each other as well as whether the individual candidates are distinguishable from noise. We…
Similarity searching finds application in a wide variety of domains including multilingual databases, computational biology, pattern recognition and text retrieval. Similarity is measured in terms of a distance function, edit distance, in…
We investigate the behavior of extended urban traffic networks within the framework of percolation theory by using real and synthetic traffic data. Our main focus shifts from the statistical properties of the cluster size distribution…
Street network analysis holds appeal as a tool for the assessment of pedestrian connectivity and its relation to the intensity and mix of land-uses; however, application within urban-design triggers a range of questions on implementary…
Benchmarks stand as vital cornerstones in elevating SLAM algorithms within mobile robotics. Consequently, ensuring accurate and reproducible ground truth generation is vital for fair evaluation. A majority of outdoor ground truths are…
This work briefly explores the possibility of approximating spatial distance (alternatively, similarity) between data points using the Isolation Forest method envisioned for outlier detection. The logic is similar to that of isolation: the…
We investigate the unsupervised node classification problem on random hypergraphs under the non-uniform Hypergraph Stochastic Block Model (HSBM) with two equal-sized communities. In this model, edges appear independently with probabilities…
Automated construction of bilingual dictionaries using monolingual embedding spaces is a core challenge in machine translation. The end performance of these dictionaries relies upon the geometric similarity of individual spaces, i.e., their…