随机交树
Random Intersection Trees
摘要:
在大型和高维数据集中发现变量之间的相互作用通常是一个严重的计算挑战。大多数方法都是增量地构建交互集,以贪婪的方式添加变量。缺点是可能忽略了潜在的信息高阶相互作用。在这里,我们提出了一种替代方法,用于分类问题的二元预测变量,称为随机交叉树。它的工作原理是从一个包含所有变量的最大交互作用开始,然后逐渐删除变量,如果它们没有出现在随机选择的一类感兴趣的观测中。我们发现,信息交互保留的概率很高,我们的程序的计算复杂性是为了$p^κ$的值$κ$,可以达到低至1的值非常稀疏的数据,在许多更一般的设置,它仍然会击败指数$s$时,使用暴力搜索约束到顺序$s$的相互作用。此外,通过使用一些新的想法的基础上最小明智的哈希方案,我们能够进一步降低计算成本。通过我们的算法发现的相互作用可以用于各种形式的预测建模,但它们本身也经常作为区分某个类别与其他类别的有用特征而引起兴趣。
英文摘要:
Finding interactions between variables in large and high-dimensional datasets is often a serious computational challenge. Most approaches build up interaction sets incrementally, adding variables in a greedy fashion. The drawback is that potentially informative high-order interactions may be overlooked. Here, we propose at an alternative approach for classification problems with binary predictor variables, called Random Intersection Trees. It works by starting with a maximal interaction that includes all variables, and then gradually removing variables if they fail to appear in randomly chosen observations of a class of interest. We show that informative interactions are retained with high probability, and the computational complexity of our procedure is of order $p^κ$ for a value of $κ$ that can reach values as low as 1 for very sparse data; in many more general settings, it will still beat the exponent $s$ obtained when using a brute force search constrained to order $s$ interactions. In addition, by using some new ideas based on min-wise hash schemes, we are able to further reduce the computational cost. Interactions found by our algorithm can be used for predictive modelling in various forms, but they are also often of interest in their own right as useful characterisations of what distinguishes a certain class from others.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。