Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anar Amgalan

dblp:276/7610 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0001-8210-5030ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry
spatial statistics
0.412020
Fast Spatial Autocorrelation · ICDM 2020

Methods — techniques the papers use, named apart from their topics

linear-time algorithm · 0.9agglomeration order · 0.9
YearPublicationVenuePosition
2022 Fast spatial autocorrelation
Anar Amgalan, Lilianne R. Mujica-Parodi, Steven Skiena
Knowl. Inf. Syst.1
2020 Fast Spatial Autocorrelation
abstract
Physical or geographic location proves to be an important feature in many data science models, because many diverse natural and social phenomenon have a spatial component. Spatial autocorrelation measures the extent to which locally adjacent observations of the same phenomenon are correlated. Although statistics like Moran's I and Geary's C are widely used to measure spatial autocorrelation, they are slow: all popular methods run in Ω(n2) time, rendering them unusable for large data sets, or long time-courses with moderate numbers of points. We propose a new SAstatistic based on the notion that the variance observed when merging pairs of nearby clusters should increase slowly for spatially autocorrelated variables. We give a linear-time algorithm to calculate SAfor a variable with an input agglomeration order (available at https://github.com/aamgalan/spatial_autocorrelation). For a typical dataset of n ≈ 63,000 points, our SAautocorrelation measure can be computed in 1 second, versus 2 hours or more for Moran's I and Geary's C. Through simulation studies, we demonstrate that SAidentifies spatial correlations in variables generated with spatially-dependent model half an order of magnitude earlier than either Moran's I or Geary's C. Finally, we prove several theoretical properties of SA: namely that it behaves as a true correlation statistic, and is invariant under addition or multiplication by a constant.
Anar Amgalan, Lilianne R. Mujica-Parodi, Steven Skiena
ICDM1