KNH: Multi-View Modeling with K-Nearest Hyperplanes Graph for Misinformation Detection

by   Sara Abdali, et al.

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.



page 1

page 2

page 3

page 4


Higher Order Correlation Analysis for Multi-View Learning

Multi-view learning is frequently used in data science. The pairwise cor...

What are higher-order networks?

Modeling complex systems and data using the language of graphs and netwo...

Multi-View Graph Embedding Using Randomized Shortest Paths

Real-world data sets often provide multiple types of information about t...

A generalized kernel machine approach to identify higher-order composite effects in multi-view datasets

In recent years, a comprehensive study of multi-view datasets (e.g., mul...

Deep Embedded Multi-View Clustering via Jointly Learning Latent Representations and Graphs

With the representation learning capability of the deep learning models,...

OFFER: A Motif Dimensional Framework for Network Representation Learning

Aiming at better representing multivariate relationships, this paper inv...

Product Graph-based Higher Order Contextual Similarities for Inexact Subgraph Matching

Many algorithms formulate graph matching as an optimization of an object...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.