KNH:基于K-最近超平面图的多视图错误信息检测模型
KNH: Multi-View Modeling with K-Nearest Hyperplanes Graph for Misinformation Detection
摘要:
图是表示数据点及其关系的最有效的结构之一,并且它们已被广泛用于不同的应用。以前,节点之间的高阶关系已经通过称为超图的图的推广来建模。在超图中,边由一组节点定义,即,超边以展示数据之间的高阶关系。然而,节点本身没有显式的高阶泛化。在这项工作中,我们介绍了一种新的推广图,即,K-最近超平面图(KNH),其中节点由高阶欧几里得子空间定义,用于节点的多视图建模。事实上,在KNH中,节点是超平面,或者更精确地说是m平面,而不是数据点。我们在两个多方面数据集上对KNH图进行了实验评估,用于错误信息检测。实验结果表明,使用KNH图的文章的多视图建模在分类性能方面优于经典的KNN图。
英文摘要:
Graphs are one of the most efficacious structures for representing datapoints and their relations, and they have been largely exploited for different applications. Previously, the higher-order relations between the nodes have been modeled by a generalization of graphs known as hypergraphs. In hypergraphs, the edges are defined by a set of nodes i.e., hyperedges to demonstrate the higher order relationships between the data. However, there is no explicit higher-order generalization for nodes themselves. In this work, we introduce a novel generalization of graphs i.e., K-Nearest Hyperplanes graph (KNH) where the nodes are defined by higher order Euclidean subspaces for multi-view modeling of the nodes. In fact, in KNH, nodes are hyperplanes or more precisely m-flats instead of datapoints. We experimentally evaluate the KNH graph on two multi-aspect datasets for misinformation detection. The experimental results suggest that multi-view modeling of articles using KNH graph outperforms the classic KNN graph in terms of classification performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。