随机相交链
Random Intersection Chains
摘要:
几个特征之间的相互作用有时在预测任务中起着重要作用。但是,考虑到所有的相互作用将导致极其沉重的计算负担。对于分类特征,情况更复杂,因为如果应用独热编码,输入将是极高维和稀疏的。受关联规则挖掘的启发,我们提出了一种方法,选择分类特征的相互作用,称为随机相交链。它使用随机交叉点来检测频繁模式,然后选择其中最有意义的模式。首先,生成多个链,其中每个节点是前一个节点和随机选择的观察的交集。利用极大似然估计估计尾节点中模式的出现频率,选择出现频率最大的模式。然后,利用贝叶斯定理计算了它们的置信度。最可靠的模式最终由随机交叉链返回。我们表明,如果链的数量和长度被适当地选择,在尾节点的模式确实是最频繁的数据集中。我们分析了算法的计算复杂度,并证明了估计的收敛性。一系列的实验结果验证了该算法的效率和有效性。
英文摘要:
Interactions between several features sometimes play an important role in prediction tasks. But taking all the interactions into consideration will lead to an extremely heavy computational burden. For categorical features, the situation is more complicated since the input will be extremely high-dimensional and sparse if one-hot encoding is applied. Inspired by association rule mining, we propose a method that selects interactions of categorical features, called Random Intersection Chains. It uses random intersections to detect frequent patterns, then selects the most meaningful ones among them. At first a number of chains are generated, in which each node is the intersection of the previous node and a random chosen observation. The frequency of patterns in the tail nodes is estimated by maximum likelihood estimation, then the patterns with largest estimated frequency are selected. After that, their confidence is calculated by Bayes' theorem. The most confident patterns are finally returned by Random Intersection Chains. We show that if the number and length of chains are appropriately chosen, the patterns in the tail nodes are indeed the most frequent ones in the data set. We analyze the computation complexity of the proposed algorithm and prove the convergence of the estimators. The results of a series of experiments verify the efficiency and effectiveness of the algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。