基于图的多层K-means++(G-MLKM)在受限空间中的感知模式分析
Graph Based Multi-layer K-means++ (G-MLKM) for Sensory Pattern Analysis in Constrained Spaces
摘要:
本文提出了一种新的无监督机器学习算法--基于图的多层k均值算法(G-MLKM),用于解决目标在受限空间中运动且传感器只能获取最少信息的数据-目标关联问题。与传统的基于统计概率的数据-目标关联方法不同,G-MLKM通过数据聚类来解决问题。首先,我们将开发多层K-means++(MLKM)方法,用于在局部空间进行数据-目标关联,给出简化的受限空间情况。当局部空间相互连通时,提出了一个p-对偶图来表示一般的约束空间。基于对偶图和图论,我们将MLKM推广到G-MLKM,首先理解局部数据-目标关联,然后提取跨局部数据-目标关联,数学分析该空间的交叉点处的数据关联。为了排除潜在的数据-目标关联错误,不遵守物理规则,我们还开发了纠错机制,以进一步提高准确性。大量的仿真例子来证明G-MLKM的性能。
英文摘要:
In this paper, we focus on developing a novel unsupervised machine learning algorithm, named graph based multi-layer k-means++ (G-MLKM), to solve data-target association problem when targets move on a constrained space and minimal information of the targets can be obtained by sensors. Instead of employing the traditional data-target association methods that are based on statistical probabilities, the G-MLKM solves the problem via data clustering. We first will develop the Multi-layer K-means++ (MLKM) method for data-target association at local space given a simplified constrained space situation. Then a p-dual graph is proposed to represent the general constrained space when local spaces are interconnected. Based on the dual graph and graph theory, we then generalize MLKM to G-MLKM by first understanding local data-target association and then extracting cross-local data-target association mathematically analyze the data association at intersections of that space. To exclude potential data-target association errors that disobey physical rules, we also develop error correction mechanisms to further improve the accuracy. Numerous simulation examples are conducted to demonstrate the performance of G-MLKM.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。