NDLI: Faster computation of the direct product kernel for graph classification

Content Provider	IEEE Xplore Digital Library
Author	Ketkar, N.S. Holder, L.B. Cook, D.J.
Copyright Year	2009
Abstract	The direct product kernel, introduced by Gärtner et al. for graph classification, is based on defining a feature for every possible label sequence in a labelled graph and counting how many label sequences in two given graphs are identical. Although the direct product kernel has achieved promising results in terms of accuracy, the kernel computation is not feasible for large graphs. This is because computing the direct product kernel for two graphs is essentially computing either the inverse of or by diagonalizing the adjacency matrix of the direct product of these two graphs. For two graphs with adjacency matrices of sizes m and n, the adjacency matrix of their direct product graph can be of size mn in the worst case. As both matrix inversion or matrix diagonalizing in the general case is $O(n^{3}),$ computing the direct product kernel is $O((mn)^{3}).$ Our survey of data sets in graph classification indicates that most graphs have adjacency matrices of sizes in the order of hundreds which often leads to adjacency matrices of direct product graphs (of two graphs) having sizes in the order of thousands. In this work we show how the direct product kernel can be computed in O((m + $n)^{3}).$ The key insight behind our result is that the language of label sequences in a labeled graph is a regular language and that regular languages are closed under union and intersection.
Starting Page	267
Ending Page	274
File Size	971070
Page Count	8
File Format	PDF
ISBN	9781424427659
DOI	10.1109/CIDM.2009.4938659
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-03-30
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Support vector machines Support vector machine classification Boosting Kernel Testing
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Faster computation of the direct product kernel for graph classification.

Combining multiple kernels for efficient image classification

Concerning the potential of evolutionary support vector machines

Boosting of support vector machines with application to editing

Using Support Vector Machines for Numerical Prediction

Empirical comparison of graph classification algorithms

Face classification with support vector machine

Creating an ensemble of diverse support vector machines using Adaboost

A Hybrid Genetic Programming and Boosting Technique for Learning Kernel Functions from Training Data

Faster computation of the direct product kernel for graph classification

Similar Documents

Faster computation of the direct product kernel for graph classification.

Combining multiple kernels for efficient image classification

Concerning the potential of evolutionary support vector machines

Boosting of support vector machines with application to editing

Using Support Vector Machines for Numerical Prediction

Empirical comparison of graph classification algorithms

Face classification with support vector machine

Creating an ensemble of diverse support vector machines using Adaboost

A Hybrid Genetic Programming and Boosting Technique for Learning Kernel Functions from Training Data

Faster computation of the direct product kernel for graph classification