HIRE WRITER

Graph Classification using Machine Learning

Updated August 12, 2022
dovnload

Download Paper

File format: .pdf, .doc, available for editing

Graph Classification using Machine Learning essay

Get help to write your own 100% unique essay

Get custom paper

78 writers are online and ready to chat

This essay has been submitted to us by a student. This is not an example of the work written by our writers.

Graphs can accurately represent most real-world data. Graph classification is an important graph mining task. It deals with predicting which label or category the graph belongs to and has many applications such as classifying chemical compounds, function prediction of protein structures, social network analysis. Traditional approaches focus on extracting graph statistics or features and comparing them for similarity. Graph kernel is one such popular method. The similarities are computed using different measures like performing random walks on both graphs or computing all pair shortest path. The similarity matrix can be provided as input to any kernelized algorithms such as Support Vector Machines (SVM) for classification. Though graph similarity can be computed in polynomial time using graph kernels, the time complexity is still very high and performance for large graphs is very low.

With the introduction of deep learning framework, many methods have been proposed to derive graphlet features and use them for classification. Convolutional neural networks (CNN) are widely used for image recognition and classification. A graph can be represented as an image-like structure to be processed by CNN using graph node embedding techniques and computing 2D histograms. Attention-based classification involves processing only informative nodes in the graph without knowing the global structure of the graph.

We plan on performing an attention-guided walk on the graph using a Recurrent Neural Network (RNN) model. The model is trained using reinforcement learning to select the next nodes to process. In this research, we compare the CNN model and deep reinforcement learning model with the popular graph kernel approach. Also, we conduct experiments using attention-based classification to analyse how performance increases. For large graphs, we plan on deploying multiple agents in parallel to determine the graph label. We will be performing our experiments on the National Cancer Institute (NCI) datasets to classify if the cell is cancerous or not and compare machine learning and deep learning methods.

PROJECT DELIVERABLES

  1. Train NCI datasets on three graph kernels: Random walk, Shortest path and Weisfeiler-Lehman kernel. This would be used as a baseline for evaluating other models.
  2. Represent the graph as a histogram and train a CNN for classification.
  3. Train a model with a combination of deep learning (Long short-term memory network) and reinforcement learning to classify graph using attention model [1].
  4. Compare the resulting accuracies with baseline and analyse the results.
  5. Documentation of the CS 298 report.

CHALLENGE AND INNOVATION

  1. CNN works well for images. Representing graphs in a form CNN can work with, is a challenge [2].
  2. Performing attention-based classification on graph without exploring the entire graph using deep reinforcement learning techniques [1].
  3. If the graph is large, it might be impossible to load it into memory. Performance should be improved as well by deploying multiple agents and running them in parallel.

REFERENCES

  1.  J. B. Lee, R. Rossi, X. Kong, “Graph classification using structural attention,” presented filleat the KDD 2018 Proceedings of the 24th ACM SIGKDD International Conference on filleKnowledge Discovery & Data Mining, London, United Kingdom, pp 1666-1674.
  2.  G. Nikolentzos, P. Meladianos, M. Vazirgiannis, “Matching node embeddings for graph fillesimilairty,” in Proceedings of the 31st AAAI-17 conference on Artificial Intelligence, San filleFrancisco, California.
  3.  H. Wang, N. Wang, D. Yeung, “Convolutional networks on graphs for learning molecular fillefingerprints,” in KDD ’15 Proceedings of the 21st ACM SIGKDD, Sydney, NSW, filleAustralia, pp 1235-1244.
  4.  G. Nikolentzos, P. Meladianos, A. J. Tixier, K. Skianis, M. Vazirgiannis, “Kernel graph filleconvolutional networks,” in NIPS’15 Proceedings of the 28th International Conference on filleNeural Information Processing Systems, vol. 2, Dec. 2015, Montreal, Canada.
  5.  M. Zhang, Z. Cui, Y. Chen, “An end-to-end deep learning architecture for graph filleclassification,” in Proceedings of the 32nd AAAI-18 conference on Artificial Intelligence, filleNew Orleans, Louisiana.
Graph Classification using Machine Learning essay

Remember. This is just a sample

You can get your custom paper from our expert writers

Get custom paper

Graph Classification using Machine Learning. (2022, Jul 10). Retrieved from https://samploon.com/graph-classification-using-machine-learning/

FAQ

How are graphs used in machine learning?
Representing data structures as graphs allow us to discover relationships and patterns which could have been ignored if we model our data around isolated data points . Machine learning on graphs helps us to encode such graph structures that can be exploited further by machine learning models (Hamilton).
What is a classification chart in machine learning?
In machine learning, classification refers to a predictive modeling problem where a class label is predicted for a given example of input data . Examples of classification problems include: Given an example, classify if it is spam or not. Given a handwritten character, classify it as one of the known characters.
What is graph classification?
Graph classification is a problem with practical applications in many different domains . To solve this problem, one usually calculates certain graph statistics (i.e., graph features) that help discriminate between graphs of different classes.
Which algorithm is used for classification in machine learning?
Naïve Bayes Algorithm Naive Bayes is one of the powerful machine learning algorithms that is used for classification. It is an extension of the Bayes theorem wherein each feature assumes independence. It is used for a variety of tasks such as spam filtering and other areas of text classification.
We use cookies to give you the best experience possible. By continuing we’ll assume you’re on board with our cookie policy
x

Hi!
I'm Peter!

Would you like to get a custom essay? How about receiving a customized one?

Check it out