Pith. sign in

REVIEW

Efficient Partitioning Method of Large-Scale Public Safety Spatio-Temporal Data based on Information Loss Constraints

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.12857 v3 pith:RKMLTFAY submitted 2023-06-22 cs.LG cs.IR

Efficient Partitioning Method of Large-Scale Public Safety Spatio-Temporal Data based on Information Loss Constraints

classification cs.LG cs.IR
keywords spatio-temporaldatagraphpartitioningpublicsafetyconstraintsefficient
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The storage, management, and application of massive spatio-temporal data are widely used in practical scenarios, including public safety. However, due to the unique spatio-temporal distribution characteristics of real-world data, existing methods still face limitations in preserving spatio-temporal proximity and achieving load balancing in distributed storage. This paper proposes an efficient partitioning method for large-scale public safety spatio-temporal data based on information loss constraints, named IFL-LSTP. The model combines a spatio-temporal partitioning module (STPM) and a graph partitioning module (GPM). STPM reduces the scale of data under a predefined information-loss threshold, while GPM uses graph representation learning to obtain balanced graph partitions. Experiments on multiple real-world datasets show that IFL-LSTP can reduce data scale, shorten graph model training time, preserve spatio-temporal proximity, and improve load-balancing effectiveness.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.