Pith. sign in

REVIEW 3 major objections 7 minor 44 references

Attention in Geometry: Scalable Spatial Modeling via Adaptive Density Fields and FAISS-Accelerated Kernels

T0 review · 3 major / 7 minor · reviewed 2026-08-03 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Spatial influence can be modeled as a continuous field whose value at any query is a score-weighted sum of Gaussian kernels centered on the query's nearest neighbors, with kernel widths inversely proportional to point scores.

desk verdict Clean operator formulation, honestly framed, but the case-study evaluation is circular — same kinematic baseline generates both the ADF input and the ground truth, and the detection threshold is tuned to match baseline prevalence — so the empirical claims don't stand; the framework itself is a candidate for a reworked validation. read the letter →

arxiv 2601.06135 v3 pith:SDL5BSR4 submitted 2026-01-05 cs.LG cs.CVcs.GR

Zhaowen Fan , Yunxiang Han This is my paper
classification cs.LGcs.CVcs.GR
keywords adaptivedensityfieldgeometricattentionspatialaggregationkernelestimationapproximatenearestneighborpointofinterestdetectiontrajectoryanalysisscalablemodeling
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper introduces the Adaptive Density Field (ADF), an operator that converts a set of scored spatial points into a continuous numerical field. At any query location, the field value is a sum of Gaussian kernels centered on the location's nearest neighbors, with each kernel's width inversely proportional to the neighbor's score: high-score points contribute sharply, low-score points spread diffusely. The authors argue that this aggregation is a form of geometric attention — the query location is the attention query, neighbor positions are the keys, scores are the values, and physical distance is the similarity measure. They treat the k-nearest-neighbor selection and the approximate search that accelerates it as part of the operator's definition, not as an implementation shortcut. If the paper is right, spatial analysts get a single, interpretable, scalable primitive that subsumes several existing methods and runs fast enough for real-time queries.

What carries the argument

The central object is the ADF operator itself: a query-conditioned sum of score-weighted isotropic Gaussian kernels, where each kernel's standard deviation is σ0/(s_j+ε). The supporting machinery is an inverted-file approximate nearest-neighbor index that partitions space into Voronoi-like cells and probes only the cells nearest the query, so the operator's neighbor set is retrieved in sub-linear time. The framework explicitly leaves kernel shape, score-to-bandwidth mapping, and index parameters as free design choices; the identity that carries the argument is the equation F(x)=Σ s_j K_j(x) together with the bandwidth modulation rule.

What would settle it

Shuffle the POI scores across locations and recompute ADF with the same pipeline; if precision and recall against the kinematic baseline remain roughly unchanged, then the score-modulated bandwidth is not what drives the reported match. Conversely, if random scores destroy the match, the adaptive weighting is doing the work.

Watch

Extended reading notes

Core claim

The central claim is that F(x) = Σ_{j=1}^k s_{i_j} exp(−½‖x−x_{i_j}‖²/σ_j²) with σ_j = σ0/(s_{i_j}+10⁻⁶), computed over the k approximate nearest neighbors of x, is a well-defined spatial attention operator. The bandwidth rule is the key adaptation: a point with twice the score gets a narrower kernel, so it influences a tighter region; low-score points provide broad background. The paper shows this operator can be evaluated per query in about 0.1 milliseconds on a dataset of millions of points, and that the resulting field, when thresholded per trajectory, reproduces kinematic anomaly locations with precision above 80% at 200 m and above 90% beyond 400 m, with recall around 60–70%. The autho

Load-bearing premise

The load-bearing premise of the validation is that the kinematic motion-residual pipeline is an independent ground truth for POI locations, and that the per-method 75th-percentile threshold yields comparable detection prevalence; if either assumption fails, the reported precision/recall numbers do not independently confirm ADF.

Editorial extensions

If this is right

  • Any scored point set — POIs, sensor readings, event logs — can be turned into a continuously queryable field, enabling on-demand spatial queries rather than batch computations.
  • Because the k-nearest-neighbor truncation and approximate search are absorbed into the operator, approximation error is controlled by k and search depth rather than by dataset size.
  • The framework subsumes adaptive kernel density estimation and weighted k-NN as special cases, giving a common ground for comparing spatial influence methods.
  • In the flight-trajectory case, ADF-based points of interest match a kinematic anomaly baseline with precision above 90% at 500 m tolerance while running roughly 100x faster than brute-force evaluation.
  • Because the formulation is operator-level, downstream tasks such as anomaly detection, accessibility estimation, and trajectory risk assessment can use the field directly without retraining.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the score-to-bandwidth mapping is as flexible as claimed, a learned or adaptive mapping could improve detection beyond the fixed reciprocal rule; the paper leaves this as a design choice but does not test it.
  • The per-trajectory relative threshold used for POI extraction suggests a natural 'excess field' anomaly detector — flag points where the field exceeds a learned local baseline — which the paper gestures at but does not develop.
  • The geometric attention framing implies ADF could be composed with time or velocity-aligned anisotropic kernels to create spatiotemporal attention fields, an extension the paper lists as future work.
  • The claim that approximation is intrinsic suggests a testable conjecture: for a fixed field accuracy, the required k and search depth should scale with the intrinsic dimension of the point distribution, not the total number of points; if this fails, the scalability promise is limited.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 7 minor

Summary. The paper proposes the Adaptive Density Field (ADF), a query-conditioned spatial aggregation operator defined as F(x)=Σ_{j=1}^k s_{i_j} exp(−½‖x−x_{i_j}‖²/σ_j²) with score-modulated bandwidth σ_j=σ0/(s_{i_j}+10⁻⁶), computed over FAISS-retrieved k-nearest neighbors. The authors position ADF as a geometry-embedded attention operator that unifies adaptive kernel methods, GIS aggregation, and attention mechanisms, with approximation treated as intrinsic to the operator. The manuscript gives a complexity analysis, a flight-trajectory POI-extraction case study, ablations of bandwidth, FAISS, nprobe and k, and conceptual comparisons with KDE and attention. The mathematical core is internally consistent, but the empirical validation is compromised by circularity: the POIs used to construct the ADF field are themselves outputs of the kinematic baseline that is later used as ground truth, and the ADF detection threshold is set to the 75th percentile to match baseline prevalence. Additional arithmetic inconsistencies in Table 1 further undermine the quantitative claims.

Significance. If the ADF operator is taken on its purely conceptual terms, it is a reasonable synthesis of adaptive-kernel aggregation, kNN sparsification, and attention-style weighting, and the explicit treatment of approximation in the operator definition is a useful perspective. The code is publicly available, and the complexity analysis is standard and clearly stated. However, the case study does not provide independent empirical validation of the 'geometry-embedded attention' claim: the reported precision/recall numbers measure the consistency of a smoothed, thresholded version of the baseline's own scores against that baseline. The arithmetic problem in Table 1 additionally makes the quantitative results unreliable as reported. The conceptual contribution may still be publishable, but the empirical section needs to be fundamentally reworked or reframed.

major comments (3)
  1. [§3.1–§3.4, Appendix §3.1–§3.2] The evaluation is circular. Section 3.1 states that the POI dataset is produced by the physics-based motion-residual pipeline, and Section 3.2 says the ADF is instantiated on that same nationwide POI dataset, using the same POI scores. The ground truth in Section 3.4 is the same kinematic baseline. Moreover, Section 3.3 explicitly sets the ADF threshold to the 75th percentile 'to maintain consistency with the baseline prevalence.' Consequently, the reported precision/recall values compare a Gaussian-smoothed, thresholded version of the baseline's own scores against the baseline. This is at best a consistency check of the smoothing kernel, not an independent confirmation that ADF 'resolves coarse kinematic anomalies into fine-grained behavioral clusters.' To support the empirical claim, the authors should use an independent ground truth (e.g., manually labeled events or a separately const
  2. [Table 1] The numbers in Table 1 are arithmetically inconsistent under the stated cardinality matching. With N=20,769, matched=16,606, ADF-unique=4,163, the ADF column sums correctly to 20,769. But the baseline column gives 16,606+10,758=27,364, not 20,769. If the two methods are supposed to have the same total after matching, the baseline unique count is incompatible. This is not a typographical detail: it undermines the precision/recall definitions and makes the table unusable as reported. The authors need to clarify the confusion-matrix convention, define recall explicitly, and provide counts that sum consistently.
  3. [Appendix Eq. (1.2.2)] The ECEF-to-ENU rotation matrix is incorrect as written. The standard ECEF-to-ENU rotation has rows involving −sinλ, cosλ, and −sinφcosλ, etc.; the matrix in Eq. (1.2.2) is not a valid rotation and its rows are not orthonormal. Since the baseline pipeline uses these converted coordinates to compute velocities, accelerations, and curvature in the loss computation, this error would propagate into the POI scores. If the case study is to be retained, the coordinate transformation must be corrected or the paper must clarify that ENU coordinates are not actually used in the experiments.
minor comments (7)
  1. [§2.3.2] The text 'we can derive the componentwise squared2_j' appears to have a missing symbol or word; Eq. (5) should be introduced cleanly.
  2. [Tables 4 and 5] The latency for FAISS at nprobe=16 is reported as 0.1145 ms/query in Table 4 but 0.1596 ms/query in Table 5 for the same configuration. This discrepancy should be reconciled.
  3. [§4.1] The sentence 'In Table 2 and 3, we demonstrated the comparison between fixed bandwidth (250, 500, 750 meters) and adaptive bandwidth under 150 and 200 meters tolerance threshold' is confusingly worded; the 150/200 values are thresholds, while the bandwidths are 250/500/750. Clarify.
  4. [§3.1] The baseline threshold is described as 'the 75% percentile'; this should be 'the 75th percentile.'
  5. [§5.1 / Table 7] The KNN baseline reports 'False Positives exceeding 28,000 points per run,' but if the total evaluation set is 20,769 points as in Table 1, this is arithmetically impossible. The evaluation set size and the definitions of precision/recall for this baseline need to be stated.
  6. [§6.2] The term 'dominance factor' is used in the methodological reflections but is not defined anywhere in the manuscript.
  7. [§6.1] The phrase 'This way, interestingly, aligns even more closely...' is grammatically awkward and should be rewritten.

Circularity Check

2 steps flagged · score 6.0 of 10

Case-study validation is circular: ADF is built from the same kinematic-baseline POIs it is tested against, and its detection threshold is set to match baseline prevalence.

  1. self definitional [Sections 3.1–3.2 and 3.4 (case study construction and validation)]
    "To collect the POI data, we applied a physics-based motion residual analysis pipeline as an example of 'manually labelled' POI baseline. ... We instantiated the ADF framework on the nationwide POI dataset by specifying the coordinate system, kernel parameterizations, and neighbor search configurations. ... The comparative validation demonstrates a high degree of spatial consistency between the ADF framework and the kinematic baseline."

    The ADF field is instantiated on the nationwide POI dataset produced by the Section 3.1 kinematic pipeline, and the same kinematic pipeline is then used as the 'baseline' ground truth in Section 3.4. Since ADF values are score-modulated Gaussian aggregates of those same baseline POI scores, the reported precision/recall measure how well a smoothed, thresholded version of the baseline's own scores reproduces the baseline's labels. This is a consistency check of the smoothing kernel, not an independent confirmation of ADF detection.

  2. fitted input called prediction [Section 3.3 (POI extraction threshold), rule Ft ≥ P75({Ft})]
    "A trajectory point at time t is labeled as a POI if: Ft ≥ P75({Ft}) where P75 represents the 75th percentile of field intensities experienced by that specific flight, this percentile was selected to maintain consistency with the baseline prevalence discussed in Section 3.1."

    The ADF threshold is explicitly set to the 75th percentile to match the baseline's prevalence, so both methods label the same fraction of points per trajectory. This 'statistical parity' is a calibration to the evaluation target, not an independent detection criterion; it forces the comparison to be one-to-one and inflates agreement between ADF detections and baseline POIs, which are both top-quartile selections of related per-flight score quantities.

full rationale

The ADF operator itself, Eq. (8), is a definition rather than a derived prediction; its mathematical construction is not circular. The FAISS-versus-brute-force ablation (Section 4.2) is an independent efficiency result, and the KNN comparison (Section 5.1) is less circular because it does not use the baseline scores as input. However, the load-bearing empirical validation in the case study is circular: the Section 3.1 kinematic pipeline generates both the POI scores on which the ADF field is built and the 'baseline' ground truth used in Section 3.4, so reported precision/recall partly measure how well a score-modulated Gaussian smoothing of the baseline's own scores can be thresholded to recover the baseline's labels. Section 3.3 further sets the ADF threshold to the 75th percentile to match baseline prevalence, forcing label parity. There is no load-bearing self-citation or imported uniqueness theorem. The Table 1 arithmetic inconsistency (16,606 matched + 10,758 baseline-unique vs. N=20,769) is a separate data-integrity issue and does not change the circularity verdict. The paper's own caveat that 'some details may therefore be approximate, incomplete, or provisional' (Section 6.2) supports treating the case study as illustrative. Hence score 6: partial circularity in evaluation, independent formulation-level content.

Assumptions & free parameters 6 free parameters · 6 assumptions · 0 invented entities

The central formula (Eq. 8) depends on hand-chosen hyperparameters (sigma0, k, nprobe, reciprocal bandwidth mapping) and on domain assumptions about metric validity, kernel isotropy, and the validity of the kinematic baseline as ground truth. Most are admitted by the authors as design choices; the baseline-dependence is the most serious.

free parameters (6)
  • sigma0 (global bandwidth scale) = 500 m
    Chosen by hand in Section 3.2 ('the global spatial scale parameter was fixed to sigma0 = 500 meters for all experiments'); controls the physical influence scale and is not cross-validated.
  • k (neighborhood size) = 100
    Selected in Section 4.3 based on F1/latency; F(x) in Eq. 8 sums over k neighbors, so this is a load-bearing hyperparameter.
  • nprobe (FAISS search depth) = 16
    Selected in Section 4.3 as optimal; determines the approximation quality of the neighbor set.
  • ADF detection threshold (per-trajectory percentile) = 75th percentile
    Section 3.3: 'this percentile was selected to maintain consistency with the baseline prevalence'; this calibrates the method to the evaluation target.
  • score-to-bandwidth mapping sigma = sigma0/(s + 1e-6) = reciprocal mapping, epsilon=1e-6
    Ad hoc functional form introduced in Eq. (3); the paper itself calls it a design choice and allows any monotonic mapping.
  • baseline POI score threshold = si >= 0.75
    Appendix 3.2 fixes the threshold that defines which kinematic anomalies become POI scores and ground truth; prevalence and evaluation depend on this.
assumptions (6)
  • domain assumption Input scores si are non-negative (or transformed via softplus) so bandwidth sigma_j remains positive.
    Section 2.3.2 assumes si>=0; negative scores would make sigma_j non-positive and the kernel ill-defined.
  • domain assumption Euclidean distance in ECEF coordinates is the appropriate metric for spatial influence.
    Section 2.3.2 uses ||x - x_ij||^2 in ECEF; this ignores geodesic/ellipsoidal distance corrections.
  • domain assumption Isotropic Gaussian kernels suffice for the case study.
    Section 2.3.2 explicitly sets Sigma = sigma^2 I and defers anisotropic covariances to future work.
  • domain assumption FAISS IVF with nprobe=16 retrieves neighborhoods equivalent to exact kNN for the ADF field.
    Section 4.2 shows identical metrics at 200 m on this dataset, but equivalence is asserted for the general framework, not proven.
  • domain assumption The kinematic motion-residual baseline is a valid ground truth for POI detection.
    Section 3.1 treats the physics-based baseline as 'manually labelled' ground truth; this is load-bearing because ADF inputs are derived from it.
  • domain assumption Per-trajectory 75th-percentile threshold yields statistical parity with baseline prevalence.
    Section 3.3 states the percentile was chosen to maintain consistency with baseline prevalence, making the precision/recall comparison dependent on this assumption.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Attention in Geometry: Scalable Spatial Modeling via Adaptive Density Fields and FAISS-Accelerated Kernels." pith.science (2026). https://pith.science/paper/SDL5BSR4

@misc{pith2026260106135,
  author       = {Pith},
  title        = {Pith review of: Attention in Geometry: Scalable Spatial Modeling via Adaptive Density Fields and FAISS-Accelerated Kernels},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SDL5BSR4}},
  note         = {Machine review of arXiv:2601.06135}
}
read the original abstract

Spatial computation in geographic systems increasingly requires query-conditioned, local, interpretable aggregation under metric constraints. Many classical approaches rely on global summation and treat approximation as an implementation concern, limiting interpretability and scalability at large scales. We propose the Adaptive Density Field (ADF), a geometric attention framework that formulates spatial aggregation as a query-conditioned, metric-induced attention operator in continuous space. Given a set of labelled spatial points with associated scalar scores, ADF defines a continuous intensity field over space. For a given query location, the field value is obtained via a local adaptive Gaussian kernel mixture centered on the query's nearest neighbors, where kernel bandwidths are modulated by point-specific scores to evaluate local aggregated influence. Additionally, approximate nearest-neighbor search is introduced, enabling scalable execution while preserving locality. The proposed ADF bridges concepts from adaptive kernel methods, classical GIS methods, and attention mechanisms by reinterpreting spatial influence as geometry-embedded attention, grounded in physical distance rather than learned latent projections. The proposed framework is formulation-level rather than algorithm-specific, allowing flexible kernel choices, score-to-bandwidth mappings, and approximation parameters. This approach provides a unifying perspective on spatial influence modeling that emphasizes structure, scalability, and geometric interpretability, with relevance to geographic information systems and spatial machine learning.

Figures

Figures reproduced from arXiv: 2601.06135 by the authors.

Figure 1
Figure 1. An overview of the proposed framework 4 [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. ADF Spatial Fidelity Sensitivity Analysis. This plot illustrates the performance metrics of the ADF framework, including Precision, Recall, and F1-score, relative to the kinematic baseline across an expanding distance threshold (100 m to 500 m). The asymptotic increase in precision beyond 400 m demonstrates that the ADF method anchors to kinematic behavioral anomalies while maintaining high spatial concordance, even… view at source ↗
Figure 3
Figure 3. Spatial Distribution of Extracted POIs in Chengdu Region. This 2D projection illustrates the geographic distribution of points identified by the ADF framework (cyan) and the kinematic baseline (red). While all compu￾tations in Section 3, including neighbor retrieval and density field construction, were performed in 3D ECEF Cartesian space to ensure metric integrity, the results are visualized here in 2D geodetic coo… view at source ↗

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

44 extracted references · 3 linked inside Pith

  1. [1]

    Defense Mapping Agency.Department of Defense World Geodetic System 1984: its definition and relationships with local geodetic systems, volume 8350

    United States. Defense Mapping Agency.Department of Defense World Geodetic System 1984: its definition and relationships with local geodetic systems, volume 8350. Defense Mapping Agency, 1987

    1984

  2. [2]

    A genetic- based incremental local outlier factor algorithm for efficient data stream processing

    Omar Alghushairy, Raed Alsini, Xiaogang Ma, and Terence Soule. A genetic- based incremental local outlier factor algorithm for efficient data stream processing. InProceedings of the 2020 4th International Conference on Compute and Data Analysis, pages 38–49, 2020

    2020

  3. [3]

    John Wiley & Sons, 2001

    Yaakov Bar-Shalom, X Rong Li, and Thiagalingam Kirubarajan.Estimation with applications to tracking and navigation: theory algorithms and software. John Wiley & Sons, 2001

    2001

  4. [4]

    A weighted k-nearest neighbor density estimate for geometric inference

    Gérard Biau, Frédéric Chazal, David Cohen-Steiner, Luc Devroye, and Carlos Rodriguez. A weighted k-nearest neighbor density estimate for geometric inference. 2011

    2011

  5. [5]

    Springer, 2006

    Christopher M Bishop and Nasser M Nasrabadi.Pattern recognition and machine learning, volume 4. Springer, 2006

    2006

  6. [6]

    On the opportunities and risks of foundation models

    Rishi Bommasani. On the opportunities and risks of foundation models. arXiv preprint arXiv:2108.07258, 2021

    arXiv 2021

  7. [7]

    Geometric deep learning: Grids, groups, graphs, geodesics, and gauges

    Michael M Bronstein, Joan Bruna, Taco Cohen, and Petar Veličković. Geometric deep learning: Grids, groups, graphs, geodesics, and gauges. arXiv preprint arXiv:2104.13478, 2021

    arXiv 2021

  8. [8]

    Anomaly detection: A survey.ACM computing surveys (CSUR), 41(3):1–58, 2009

    Varun Chandola, Arindam Banerjee, and Vipin Kumar. Anomaly detection: A survey.ACM computing surveys (CSUR), 41(3):1–58, 2009

    2009

Show all 44 references
  1. [9]

    Rethinking attention with performers.arXiv preprint arXiv:2009.14794, 2020

    Krzysztof Choromanski, Valerii Likhosherstov, David Dohan, Xingyou Song, Andreea Gane, Tamas Sarlos, Peter Hawkins, Jared Davis, Afroz Mohiuddin, Lukasz Kaiser, et al. Rethinking attention with performers.arXiv preprint arXiv:2009.14794, 2020

    2009 arXiv

  2. [10]

    Nearest neighbor pattern classification

    Thomas Cover and Peter Hart. Nearest neighbor pattern classification. IEEE transactions on information theory, 13(1):21–27, 1967

    1967

  3. [11]

    springer New York, 1978

    Carl De Boor and Carl De Boor.A practical guide to splines, volume 27. springer New York, 1978

    1978

  4. [12]

    Spatial data mining: A database approach

    Martin Ester, Hans-Peter Kriegel, and Jörg Sander. Spatial data mining: A database approach. InInternational symposium on spatial databases, pages 47–66. Springer, 1997. 23

    1997

  5. [13]

    Evaluating pattern matching queries for spatial databases.The VLDB Journal, 28(5):649–673, 2019

    Yixiang Fang, Yun Li, Reynold Cheng, Nikos Mamoulis, and Gao Cong. Evaluating pattern matching queries for spatial databases.The VLDB Journal, 28(5):649–673, 2019

    2019

  6. [14]

    Geographical information science.International journal of geographical information systems, 6(1):31–45, 1992

    Michael F Goodchild. Geographical information science.International journal of geographical information systems, 6(1):31–45, 1992

    1992

  7. [15]

    Exploration- based statistical learning for selecting kernel density estimates of spatial point patterns.Transactions in GIS, 29(2):e70051, 2025

    Michael Govorov, Giedr˙ e Beconyt˙ e, and Gennady Gienko. Exploration- based statistical learning for selecting kernel density estimates of spatial point patterns.Transactions in GIS, 29(2):e70051, 2025

    2025

  8. [16]

    Global positioning system: theory and practice

    Bernhard Hofmann-Wellenhof, Herbert Lichtenegger, and James Collins. Global positioning system: theory and practice. Springer Science & Business Media, 2012

    2012

  9. [17]

    Product quantization for nearest neighbor search.IEEE transactions on pattern analysis and machine intelligence, 33(1):117–128, 2011

    Hervé Jégou, Matthijs Douze, and Cordelia Schmid. Product quantization for nearest neighbor search.IEEE transactions on pattern analysis and machine intelligence, 33(1):117–128, 2011

    2011

  10. [18]

    Billion-scale similarity search with gpus.IEEE Transactions on Big Data, 2017

    Jeff Johnson, Matthijs Douze, and Hervé Jégou. Billion-scale similarity search with gpus.IEEE Transactions on Big Data, 2017

    2017

  11. [19]

    Caglar Koylu, Chang Zhao, and Wei Shao. Deep neural networks and kernel density estimation for detecting human activity patterns from geo-tagged images: A case study of birdwatching on flickr.ISPRS international journal of geo-information, 8(1):45, 2019

    2019

  12. [20]

    Trajectory clustering: a partition-and-group framework

    Jae-Gil Lee, Jiawei Han, and Kyu-Young Whang. Trajectory clustering: a partition-and-group framework. InProceedings of the 2007 ACM SIGMOD international conference on Management of data, pages 593–604, 2007

    2007

  13. [21]

    Yirong Luo and Zhisen Lin. Spatial accessibility analysis and optimization simulation of urban riverfront space based on space syntax and pois: A case study of songxi county, china.Sustainability, 15(20):14929, 2023

    2023

  14. [22]

    P. C. Mahalanobis. On the generalized distance in statistics.Proceedings of the National Institute of Sciences of India, 1936

    1936

  15. [23]

    Data-driven geography.Geo- Journal, 80(4):449–461, 2015

    Harvey J Miller and Michael F Goodchild. Data-driven geography.Geo- Journal, 80(4):449–461, 2015

    2015

  16. [24]

    Knn-kernel based clustering for spatio-temporal database

    Aina Musdholifah, Siti Zaiton Bt Mohd Hashim, and Ito Wasito. Knn-kernel based clustering for spatio-temporal database. InInternational Conference on Computer and Communication Engineering (ICCCE’10), pages 1–6. IEEE, 2010

    2010

  17. [25]

    Continuous spatial query processing: A survey of safe region based techniques.ACM Computing Surveys (CSUR), 51(3):1–39, 2018

    Jianzhong Qi, Rui Zhang, Christian S Jensen, Kotagiri Ramamohanarao, and Jiayuan He. Continuous spatial query processing: A survey of safe region based techniques.ACM Computing Surveys (CSUR), 51(3):1–39, 2018. 24

    2018

  18. [26]

    A pid-based knn query processing algorithm for spatial data.Sensors, 22(19):7651, 2022

    Baiyou Qiao, Ling Ma, Linlin Chen, and Bing Hu. A pid-based knn query processing algorithm for spatial data.Sensors, 22(19):7651, 2022

    2022

  19. [27]

    John Wiley & Sons, 2015

    David W Scott.Multivariate density estimation: theory, practice, and visualization. John Wiley & Sons, 2015

    2015

  20. [28]

    Benchmarking spatial big data

    Shashi Shekhar, Michael R Evans, Viswanath Gunturi, KwangSoo Yang, and Daniel Cintra Cugler. Benchmarking spatial big data. InWorkshop on Big Data Benchmarks, pages 81–93. Springer, 2012

    2012

  21. [29]

    Springer Science & Business Media, 2007

    Shashi Shekhar and Hui Xiong.Encyclopedia of GIS. Springer Science & Business Media, 2007

    2007

  22. [30]

    B. W. Silverman.Density Estimation for Statistics and Data Analysis. Chapman and Hall, 1986

    1986

  23. [31]

    Variable kernel density estimation

    George R Terrell and David W Scott. Variable kernel density estimation. The Annals of Statistics, pages 1236–1265, 1992

    1992

  24. [32]

    Ancient lowland maya neighborhoods: Average nearest neighbor analysis and kernel density models, environments, and urban scale.PloS one, 17(11):e0275916, 2022

    Amy E Thompson, John P Walden, Adrian SZ Chase, Scott R Hut- son, Damien B Marken, Bernadette Cap, Eric C Fries, M Rodrigo Guz- man Piedrasanta, Timothy S Hare, Sherman W Horn III, et al. Ancient lowland maya neighborhoods: Average nearest neighbor analysis and kernel density ...

    2022

  25. [33]

    Research on urban landscape accessibility assessment model based on gis and spatial analysis.GeoJournal, 90(2):67, 2025

    Yunzhi Tian and Yi Jiang. Research on urban landscape accessibility assessment model based on gis and spatial analysis.GeoJournal, 90(2):67, 2025

    2025

  26. [34]

    Solution of incorrectly formulated problems and the regularization method.Sov Dok, 4:1035–1038, 1963

    Andrei N Tikhonov. Solution of incorrectly formulated problems and the regularization method.Sov Dok, 4:1035–1038, 1963

    1963

  27. [35]

    Attention is all you need.Advances in Neural Information Processing Systems, 2017

    Ashish Vaswani et al. Attention is all you need.Advances in Neural Information Processing Systems, 2017

    2017

  28. [36]

    Scipy 1.0: fundamental algorithms for scientific computing in python.Nature methods, 17(3):261–272, 2020

    Pauli Virtanen, Ralf Gommers, Travis E Oliphant, Matt Haberland, Tyler Reddy, David Cournapeau, Evgeni Burovski, Pearu Peterson, Warren Weckesser, Jonathan Bright, et al. Scipy 1.0: fundamental algorithms for scientific computing in python.Nature methods, 17(3):261–272, 2020

    2020

  29. [37]

    Fast computation of multivariate kernel estimators.Journal of Computational and Graphical Statistics, 3(4):433–445, 1994

    MP Wand. Fast computation of multivariate kernel estimators.Journal of Computational and Graphical Statistics, 3(4):433–445, 1994

    1994

  30. [38]

    Guiming Zhang, A-Xing Zhu, and Qunying Huang. A gpu-accelerated adap- tive kernel density estimation approach for efficient point pattern analysis on spatial big data.International Journal of Geographical Information Science, 31(10):2068–2097, 2017

  31. [39]

    Trajectory data mining: an overview.ACM Transactions on Intelligent Systems and Technology (TIST), 6(3):1–41, 2015

    Yu Zheng. Trajectory data mining: an overview.ACM Transactions on Intelligent Systems and Technology (TIST), 6(3):1–41, 2015. 25 Appendix: Physics-informed Trajectory POI De- tection Pipeline The appendix provides implementation-level details and mathemati- cal formulations su...

    2015

  32. [40]

    coords": [],

    Preprocessing the Flight Data 1.1. Coordinate Conversion [16]: WGS84 Geodetic to ECEF Given: •latitudeφ(rad) •longitudeλ(rad) •ellipsoidal heighth(m) •WGS84 parameters: –semi-major axisa= 6378137.0 –flattening ratef= 1 298.257223563 –first eccentricity squarede 2 = 6.694379990...

  33. [41]

    Position Prediction To estimate future aircraft positions, I applied aphysics-based interpolation modelthat blends two motion predictors:

  34. [42]

    Constant-Acceleration (CA) model[3] — reliable for nearly straight trajectories 27

  35. [43]

    Cubic Hermite Spline interpolation[11] — smooth and accurate for curved motion The spline utilizes local velocity vectors as tangents at each waypoint, providing a geometrically consistent path [36] that complements the CA model’s acceleration- based predictions." The blending...

  36. [44]

    These points often correspond to sharp maneuvers, abnormal motion, or sensor irregularities, and they serve as valuable markers for downstream analysis

    POI Detection After computing the time-normalized Mahalanobis loss for each flight, the next step is to identifyPoints of Interest (POIs)—locations where the prediction error is unusually high. These points often correspond to sharp maneuvers, abnormal motion, or sensor irregu...

Pith tools

Reviewed August 3, 2026 · model on record in the stance chip above.