反向最近邻热图:一种影响探索工具
Reverse Nearest Neighbor Heat Maps: A Tool for Influence Exploration
摘要:
我们研究了通过寻找二维空间中每个点的RNN集来构造反向最近邻热图的问题。基于一个点的RNN集,我们获得了一个定量的影响(即,热)为题。热图提供了关于空间中影响力分布的全局视图,因此支持许多应用中的探索性分析,例如营销和资源管理。为了构建这样的热图,我们首先将其简化为一个称为区域着色(RC)的问题,该问题将空间划分为不相交的区域,其中所有点都具有相同的RNN集。然后,我们提出了一种新的算法名为CREST,有效地解决了RC问题,通过标记每个区域与其包含点的热量值。在CREST中,我们提出了创新技术,以避免处理昂贵的RNN查询,并大大减少区域标记操作的数量。我们对CREST算法的复杂性和RC问题的下界进行了详细的分析,并证明了CREST算法在最坏情况下是渐近最优的。真实和合成数据集的大量实验表明,CREST优于替代算法的几个数量级。
英文摘要:
We study the problem of constructing a reverse nearest neighbor (RNN) heat map by finding the RNN set of every point in a two-dimensional space. Based on the RNN set of a point, we obtain a quantitative influence (i.e., heat) for the point. The heat map provides a global view on the influence distribution in the space, and hence supports exploratory analyses in many applications such as marketing and resource management. To construct such a heat map, we first reduce it to a problem called Region Coloring (RC), which divides the space into disjoint regions within which all the points have the same RNN set. We then propose a novel algorithm named CREST that efficiently solves the RC problem by labeling each region with the heat value of its containing points. In CREST, we propose innovative techniques to avoid processing expensive RNN queries and greatly reduce the number of region labeling operations. We perform detailed analyses on the complexity of CREST and lower bounds of the RC problem, and prove that CREST is asymptotically optimal in the worst case. Extensive experiments with both real and synthetic data sets demonstrate that CREST outperforms alternative algorithms by several orders of magnitude.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。