High Order Stochastic Graphlet Embedding for Graph-Based Pattern Recognition

02/01/2017
by   Anjan Dutta, et al.
0

Graph-based methods are known to be successful for pattern description and comparison purpose. However, a lot of mathematical tools are unavailable in graph domain, thus restricting the generic graph-based techniques to be applicable within the machine learning framework. A way to tackle this problem is graph embedding into high dimensional space in either an explicit or implicit manner. In this paper, we propose high order stochastic graphlet embedding (SGE) that explicitly embed a graph into a real vector space. Our main contribution includes a new stochastic search procedure that allows one to efficiently parse a given graph and extract or sample unlimitedly high order graphlets. We consider these graphlets with increasing size in order to model local features, as well as, their complex interactions. We also introduce or design graph hash functions with very low probability of collision to hash those sampled graphlets for partitioning them into sets of isomorphic ones and measure their distribution in large graph collections, which results in accurate graph descriptions. When combined with support vector machines, these high order graphlet-based descriptions have positive impact on the performance of graph-based pattern comparison and classification as corroborated through experiments on different standard benchmark databases.

READ FULL TEXT
research
02/28/2018

Graph Kernels based on High Order Graphlet Parsing and Hashing

Graph-based methods are known to be successful in many machine learning ...
research
07/08/2018

Hierarchical Stochastic Graphlet Embedding for Graph-based Pattern Recognition

Despite being very successful within the pattern recognition and machine...
research
09/22/2022

High-order Multi-view Clustering for Generic Data

Graph-based multi-view clustering has achieved better performance than m...
research
02/28/2023

On the tightness of graph-based statistics

We establish tightness of graph-based stochastic processes in the space ...
research
07/24/2019

High-Dimensional Expanders from Expanders

We present an elementary way to transform an expander graph into a simpl...
research
06/03/2021

Statistical embedding: Beyond principal components

There has been an intense recent activity in embedding of very high dime...
research
12/15/2017

On the reducibility of geometric constraint graphs

Geometric modeling by constraints, whose applications are of interest to...

Please sign up or login with your details

Forgot password? Click here to reset