We present several algorithms designed to learn a pattern of correspondence between two data sets in situations where it is desirable to match elements that exhibit a relationship belonging to a known parametric model. In the motivating case study, the challenge is to better understand micro-RNA regulation in the striatum of Huntington's disease model mice. The algorithms unfold in two stages. First, an optimal transport plan P and an optimal affine transformation are learned, using the Sinkhorn-Knopp algorithm and a mini-batch gradient descent. Second, P is exploited to derive either several co-clusters or several sets of matched elements. A simulation study illustrates how the algorithms work and perform. The real data application further illustrates their applicability and interest.
翻译:我们提出几种算法,目的是在两个数据集之间学习一种对应模式,如果需要将显示属于已知参数模型的元素匹配起来。在激励性案例研究中,挑战在于如何更好地理解亨廷顿病样鼠病样图的微-RNA规则。算法分两个阶段展开。首先,利用Sinkhorn-Knopp算法和微型批次梯级下降法,学习了最佳运输计划P和最佳方形转换法。第二,P被利用来获取若干组或数组匹配元素。模拟研究说明了算法如何运作和运行。实际数据应用进一步说明了其适用性和兴趣。</s>