Article
Computer Science, Information Systems
Jin Zhu, Dayu Cheng, Weiwei Zhang, Ci Song, Jie Chen, Tao Pei
Summary: This paper proposes an accurate and reasonable indoor trajectory similarity measure, ISTSM, which considers the features of indoor trajectories and indoor semantic information simultaneously. Experimental results demonstrate that ISTSM is more accurate and reasonable compared to other popular trajectory similarity measures.
ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION
(2021)
Article
Chemistry, Multidisciplinary
Ondrej Rozinek, Jan Mares
Summary: The article introduces a new mathematical basis for similarity space and describes the relationship between distance and similarity from set theory. It derives generally valid relations for the conversion between similarity and a metric, as well as presents a general solution for the normalization of a given similarity space or metric space. The derived solutions unify various similarity and distance functions, such as the Jaccard coefficient, Tanimoto coefficient, Steinhaus distance, Ruzicka similarity, Gaussian similarity, edit distance and edit similarity.
APPLIED SCIENCES-BASEL
(2021)
Article
Computer Science, Artificial Intelligence
Franka Bause, Erich Schubert, Nils M. Kriege
Summary: In this study, we propose an efficient method for querying the graph edit distance in large databases. By using lower and upper bounds, we reduce the number of exact computations required. We derive new lower bounds from tree metrics and combine them for effective filtering. Our method can handle large databases and the lower bounds are already close to the exact graph edit distance.
DATA MINING AND KNOWLEDGE DISCOVERY
(2022)
Article
Economics
Martin Sveda, Michala Sladekova Madajova
Summary: This paper attempts to reveal the spatial variations of the distance decay effect on movements in urban space through the utilization of mobile phone data. The findings suggest that for daily mobility within the urban area, the polynomial-exponential function describes the impedance of travel distance more preferably. However, a significant proportion of urban grids have recorded weak or even no decay, which could be a result of a specific functional structure of the study area or an advanced stage of urban evolution.
JOURNAL OF TRANSPORT GEOGRAPHY
(2023)
Article
Computer Science, Hardware & Architecture
Yandong Zheng, Rongxing Lu, Yunguo Guan, Jun Shao, Hui Zhu
Summary: Similarity query over time series data is important in various applications. Existing solutions still have issues in supporting queries with different lengths, and have limitations in query accuracy and efficiency. In this article, we propose a new efficient and privacy-preserving similarity range query scheme using the time warp edit distance (TWED) as the similarity metric. Our scheme leverages a kd-tree and symmetric homomorphic encryption technique to improve query efficiency and protect data privacy.
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
(2022)
Article
Transportation Science & Technology
Loic Bonnetain, Angelo Furno, Nour-Eddin El Faouzi, Marco Fiore, Razvan Stanica, Zbigniew Smoreda, Cezary Ziemlicki
Summary: This study introduces a novel framework called TRANSIT, capable of accurately inferring mobility phases and stationary activities from Network Signaling Data, and reconstructing fine-grained human mobility trajectories. Validation results demonstrate the superior performance of TRANSIT in identifying movement periods and trajectory estimation.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
(2021)
Article
Computer Science, Information Systems
Dayu Cheng, Guo Yue, Tao Pei, Mingbo Wu
Summary: Indoor positioning data reflects human mobility in indoor spaces, and clustering methods are essential for identifying patterns in indoor trajectories. However, the specific characteristics of indoor trajectory data, such as clear semantic attributes and complex spatial shapes, make it challenging for clustering methods to measure trajectory similarity. To address these challenges, a new method called E-DBSCAN was proposed, which extends DBSCAN and uses a Weighted Edit Distance algorithm to measure trajectory similarity effectively.
ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION
(2021)
Article
Computer Science, Artificial Intelligence
In-Hyuk Choi, Il-Seok Oh
Summary: This study proposes a genetic algorithm optimized weighted edit distance method for calculating intermolecular similarity. Compared to the traditional edit distance method, this method achieves better results and has been validated with four well-known datasets.
PATTERN ANALYSIS AND APPLICATIONS
(2023)
Article
Engineering, Mechanical
Zhuo Wang, Pengjian Shang, Xuegeng Mao
Summary: This article proposes an ordinal network-based affine invariant Riemannian measure (ONAIRM) method to measure the shape-based similarity of dynamic evolution between systems. The effectiveness of ONAIRM is verified by simulation data and applied to multidimensional scaling, classification, and prediction algorithms, showing better performance.
NONLINEAR DYNAMICS
(2023)
Article
Physics, Multidisciplinary
Hamidreza Hamedi, Rouzbeh Shad, Seyed Ali Ziaee
Summary: This paper investigates the similarity evaluation of lane change trajectories using three models: longest common subsequence, edit distance on real sequences, and dynamic time warping. Contextual data is found to be a crucial parameter in influencing movements.
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
(2022)
Article
Computer Science, Artificial Intelligence
R. Rueda, M. P. Cuellar, L. G. B. Ruiz, M. C. Pegalajar
Summary: Finding a balance between diversity and convergence is crucial in evolutionary algorithms, especially for solving symbolic regression problems. This paper proposes a similarity measure based on edit distance and combines it with the CHC algorithm strategy to control diversity in the population, thus avoiding local optima.
EXPERT SYSTEMS WITH APPLICATIONS
(2022)
Article
Computer Science, Artificial Intelligence
Juthika Mahanta, Subhasis Panda
Summary: The text discusses the research hotspot of distance measure in Pythagorean fuzzy environment, introduces a novel distance measure for PFSs, and demonstrates its superiority and reasonability through numerical examples. Applications of this measure include multi-attribute decision-making, pattern recognition, and medical diagnosis.
NEURAL COMPUTING & APPLICATIONS
(2021)
Article
Computer Science, Artificial Intelligence
Iman Mohamad Sharaf
Summary: Pythagorean fuzzy sets (PFSs) have proven to be effective in handling uncertainty and vagueness in multi-criteria group decision-making (MCGDM). This study introduces a new approach called the differential measure (DFM) for comparing PFSs, aiming to eliminate unfair arguments resulting from the equal treatment of contradicting parameters. The study also proposes a novel method for MCGDM based on the introduced DFM, along with a technique for computing expert weights. The applicability and validity of the method are demonstrated through two applications and comparison with existing methods.
COMPLEX & INTELLIGENT SYSTEMS
(2023)
Article
Computer Science, Information Systems
Jongik Kim
Summary: This paper studies the importance of identifying similarity between graphs in tasks such as data mining, machine learning and pattern recognition. It proposes a top-k graph similarity search method based on the graph edit distance (GED) measure. By introducing incremental GED computation algorithms and search frameworks, as well as utilizing state-of-the-art indexing techniques, the proposed method achieves faster top-k search.
Article
Computer Science, Hardware & Architecture
Nikolai Karpov, Haoyu Zhang, Qin Zhang
Summary: This paper addresses the problem of computing similarity joins under edit distance on a set of strings. Previous algorithms for this problem have limitations in scalability and accuracy. The authors propose a new algorithm based on string partitioning, which can find all similar pairs with high probability and runs in linear time. Experimental results show that their algorithm outperforms state-of-the-art algorithms in terms of running time and achieves perfect accuracy on most datasets.
Article
Multidisciplinary Sciences
Yihong Yuan, Monica Medel
Proceedings Paper
Computer Science, Information Systems
Yihong Yuan
ADVANCES IN GEOCOMPUTATION
(2017)
Article
Computer Science, Interdisciplinary Applications
Yihong Yuan, Yu Liu, Guixing Wei
COMPUTERS ENVIRONMENT AND URBAN SYSTEMS
(2017)
Article
Geography
Yihong Yuan, Martin Raubal
Article
Computer Science, Interdisciplinary Applications
Yihong Yuan, Martin Raubal, Yu Liu
COMPUTERS ENVIRONMENT AND URBAN SYSTEMS
(2012)
Article
Computer Science, Interdisciplinary Applications
Yu Liu, Yihong Yuan, Danqing Xiao, Yi Zhang, Jiangquan Hu
COMPUTERS ENVIRONMENT AND URBAN SYSTEMS
(2010)