{'fraction_non_alphanumeric': 0.025617566331198535, 'fraction_numerical': 0.0, 'mean_word_length': 5.010989010989011, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Traffic Speed Imputation Method Based on Self-adaption and Clustering

Traffic speed estimation plays an important role in Intelligent Transportation System (ITS) since current speed collections cannot cover all roads and may lose data. A tensor completion method called high accurate low rank tensor completion (HaLRTC), one of the research methods on speed imputation, has great performances in this field. In this paper, we propose a method based on HaLRTC, and analyze how the parameters affect the method. Then we can predetermine these parameters with incomplete data. To improve the efficiency, we use variances of one road segment in all days as its feature. We do k-means++ clustering on road segments with their variance feature, as for each cluster we apply HaLRTC on it independently. Then we merge these completion tensors into a whole tensor. The proposed method HaLRTC-CSP applies HaLRTC and is based on clustering and self-adaption parameters. Experiments is implemented on the speed dataset in Guangzhou, China, and the results validate HaLRTC-CSP outperforms other methods.