Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Non-Neighbors Also Matter to Kriging: A New Contrastive-Prototypical Learning (2401.12681v1)

Published 23 Jan 2024 in cs.LG and cs.AI

Abstract: Kriging aims at estimating the attributes of unsampled geo-locations from observations in the spatial vicinity or physical connections, which helps mitigate skewed monitoring caused by under-deployed sensors. Existing works assume that neighbors' information offers the basis for estimating the attributes of the unobserved target while ignoring non-neighbors. However, non-neighbors could also offer constructive information, and neighbors could also be misleading. To this end, we propose ``Contrastive-Prototypical'' self-supervised learning for Kriging (KCP) to refine valuable information from neighbors and recycle the one from non-neighbors. As a pre-trained paradigm, we conduct the Kriging task from a new perspective of representation: we aim to first learn robust and general representations and then recover attributes from representations. A neighboring contrastive module is designed that coarsely learns the representations by narrowing the representation distance between the target and its neighbors while pushing away the non-neighbors. In parallel, a prototypical module is introduced to identify similar representations via exchanged prediction, thus refining the misleading neighbors and recycling the useful non-neighbors from the neighboring contrast component. As a result, not all the neighbors and some of the non-neighbors will be used to infer the target. To encourage the two modules above to learn general and robust representations, we design an adaptive augmentation module that incorporates data-driven attribute augmentation and centrality-based topology augmentation over the spatiotemporal Kriging graph data. Extensive experiments on real-world datasets demonstrate the superior performance of KCP compared to its peers with 6% improvements and exceptional transferability and robustness. The code is available at https://github.com/bonaldli/KCP

Definition Search Book Streamline Icon: https://streamlinehq.com
References (61)
  1. Kriging convolutional networks. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 3187–3194.
  2. Adaptive graph convolutional recurrent network for traffic forecasting. Advances in neural information processing systems, 33:17804–17815.
  3. Bostan, P. (2017). Basic kriging methods in geostatistics. Yuzuncu Yıl University Journal of Agricultural Sciences, 27(1):10–20.
  4. Xgboost: A scalable tree boosting system. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 785–794.
  5. Self-pu: Self boosted and calibrated positive-unlabeled training. In International Conference on Machine Learning, pages 1510–1519. PMLR.
  6. Bayesian low-rank matrix completion with dual-graph embedding: Prior analysis and tuning-free inference. Signal Processing, 204:108826.
  7. Fast-moco: Boost momentum-based contrastive learning with combinatorial patches. In Computer Vision–ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part XXVI, pages 290–306. Springer.
  8. Cuturi, M. (2013). Sinkhorn distances: lightspeed computation of optimal transport. In Proceedings of the 26th International Conference on Neural Information Processing Systems, pages 2292–2300.
  9. Temporal multi-view graph convolutional networks for citywide traffic volume inference. In 2021 IEEE International Conference on Data Mining (ICDM), pages 1042–1047. IEEE.
  10. Graph neural networks with precomputed node features. arXiv preprint arXiv:2206.00637.
  11. Performance evaluation of predictive models for missing data imputation in weather data. In International Conference on Advances in Computing, Communications and Informatics (ICACCI), pages 1327–1334. IEEE.
  12. Spatiotemporal multi-graph convolution network for ride-hailing demand forecasting. In Proceedings of the AAAI conference on Artificial Intelligence, volume 33, pages 3656–3663.
  13. Goovaerts, P. (1998). Ordinary cokriging revisited. Mathematical Geology, 30:21–42.
  14. Bootstrap your own latent-a new approach to self-supervised learning. Advances in Neural Information Processing Systems, 33:21271–21284.
  15. Inductive representation learning on large graphs. In Proceedings of the 31st International Conference on Neural Information Processing Systems, pages 1025–1035.
  16. Dr. vic: Decomposition and reasoning for video individual counting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 3083–3092.
  17. G-mixup: Graph data augmentation for graph classification. In International Conference on Machine Learning, pages 8230–8248. PMLR.
  18. Contrastive multi-view representation learning on graphs. In International Conference on Machine Learning, pages 4116–4126. PMLR.
  19. Provable tensor factorization with missing data. Advances in Neural Information Processing Systems, 27.
  20. Categorical reparameterization with gumbel-softmax. In International Conference on Learning Representations.
  21. Multivariate time series forecasting with dynamic graph neural odes. IEEE Transactions on Knowledge and Data Engineering.
  22. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907.
  23. Positive-unlabeled learning with non-negative risk estimator. Advances in Neural Information Processing Systems, 30.
  24. Positional encoder graph neural networks for geographic data. In International Conference on Artificial Intelligence and Statistics, pages 1379–1389. PMLR.
  25. Krige, D. G. (1951). A statistical approach to some basic mine valuation problems on the witwatersrand. Journal of the Southern African Institute of Mining and Metallurgy, 52(6):119–139.
  26. Arterial travel time estimation based on vehicle re-identification using wireless magnetic sensors. Transportation Research Part C: Emerging Technologies, 17(6):586–606.
  27. Bayesian kernelized matrix factorization for spatiotemporal traffic data imputation and kriging. IEEE Transactions on Intelligent Transportation Systems, 23(10):18962–18974.
  28. Multi-sensor based landslide monitoring via transfer learning. Journal of Quality Technology, 53(5):474–487.
  29. Diffusion convolutional recurrent neural network: Data-driven traffic forecasting. In International Conference on Learning Representations.
  30. Diffusion convolutional recurrent neural network: Data-driven traffic forecasting. In International Conference on Learning Representations (ICLR ’18).
  31. Tensor completion for weakly-dependent data on graph for metro passenger flow prediction. In proceedings of the AAAI conference on Artificial Intelligence, volume 34, pages 4804–4810.
  32. A multi-stream feature fusion approach for traffic prediction. IEEE transactions on intelligent transportation systems, 23(2):1456–1466.
  33. Long-short term spatiotemporal tensor prediction for passenger flow profile. IEEE Robotics and Automation Letters, 5(4):5010–5017.
  34. Dynamic causal graph convolutional network for traffic prediction. arXiv preprint arXiv:2306.07019.
  35. Vehicle trajectory recovery on road network based on traffic camera video data. In Proceedings of the 29th International Conference on Advances in Geographic Information Systems, pages 389–398.
  36. Self-supervised consensus representation learning for attributed graph. In Proceedings of the 29th ACM International Conference on Multimedia, pages 2654–2662.
  37. Graph self-supervised learning: A survey. IEEE Transactions on Knowledge and Data Engineering.
  38. Lovász, L. (2012). Large networks and graph limits, volume 60. American Mathematical Soc.
  39. Jointly contrastive representation learning on road network and trajectory. In Proceedings of the 31st ACM International Conference on Information & Knowledge Management, pages 1501–1510.
  40. City-wide traffic volume inference with loop detector data and taxi trajectories. In Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 1–10.
  41. Collaborative filtering with graph information: Consistency and scalable methods. Advances in Neural Information Processing Systems, 28.
  42. Gaussian processes for machine learning, volume 1. Springer.
  43. Scalable probabilistic matrix factorization with graph-based priors. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 5851–5858.
  44. Unifying visual contrastive learning for object recognition from a graph perspective. In Computer Vision–ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part XXVI, pages 649–667. Springer.
  45. Large-scale representation learning on graphs via bootstrapping. arXiv preprint arXiv:2102.06514.
  46. Unsupervised representation learning for time series with temporal neighborhood coding. arXiv preprint arXiv:2106.00750.
  47. Kriging water levels with a regional-linear and point-logarithmic drift. Groundwater, 40(2):185–193.
  48. Visualizing data using t-sne. Journal of Machine Learning Research, 9(11).
  49. Short-term renewable energy forecasting in Greece using prophet decomposition and tree-based ensembles. In Database and Expert Systems Applications-DEXA 2021 Workshops: BIOKDD, IWCFS, MLKgraphs, AI-CARES, ProTime, AISys 2021, Virtual Event, September 27–30, 2021, Proceedings 32, pages 227–238. Springer.
  50. Inductive graph neural networks for spatiotemporal kriging. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, pages 4478–4485.
  51. Spatial aggregation and temporal convolution networks for real-time kriging. arXiv preprint arXiv:2109.12144.
  52. Graph wavenet for deep spatial-temporal graph modeling. In Proceedings of the 28th International Joint Conference on Artificial Intelligence, pages 1907–1913.
  53. Real-time spatiotemporal prediction and imputation of traffic status based on lstm and graph laplacian regularized matrix factorization. Transportation Research Part C: Emerging Technologies, 129:103228.
  54. Graph contrastive learning with augmentations. Advances in Neural Information Processing Systems, 33:5812–5823.
  55. When does self-supervision help graph convolutional networks? In International Conference on Machine Learning, pages 10871–10880. PMLR.
  56. Spatio-temporal graph convolutional networks: a deep learning framework for traffic forecasting. In Proceedings of the 27th International Joint Conference on Artificial Intelligence, pages 3634–3640.
  57. Citywide traffic volume inference with surveillance camera records. IEEE Transactions on Big Data, 7(6):900–912.
  58. Network-wide traffic flow estimation with insufficient volume detection and crowdsourcing data. Transportation Research Part C: Emerging Technologies, 121:102870.
  59. Increase: Inductive graph representation learning for spatio-temporal kriging. In Proceedings of the ACM Web Conference 2023, pages 673–683.
  60. Kernelized probabilistic matrix factorization: Exploiting graphs and side information. In Proceedings of the 2012 SIAM International Conference on Data Mining, pages 403–414. SIAM.
  61. Graph contrastive learning with adaptive augmentation. In Proceedings of the Web Conference 2021, pages 2069–2080.
Citations (5)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Github Logo Streamline Icon: https://streamlinehq.com

GitHub

  1. GitHub - bonaldli/KCP (3 stars)
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets