English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Efficient Graphlet Kernels for Large Graph Comparison

Shervashidze, N., Vishwanathan SVN, Petri TH, Mehlhorn, K., & Borgwardt, K. (2009). Efficient Graphlet Kernels for Large Graph Comparison. Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AIStats 2009), 488-495.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Shervashidze, N1, Author           
Vishwanathan SVN, Petri TH, Mehlhorn, K, Author
Borgwardt, KM1, Author           
Van Dyk M. Welling, D., Editor
Affiliations:
1Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497794              

Content

show
hide
Free keywords: -
 Abstract: State-of-the-art graph kernels do not scale to large graphs with hundreds of nodes and thousands of edges. In this article we propose to compare graphs by counting it graphlets}, ie subgraphs with k nodes where k in { 3, 4, 5 . Exhaustive enumeration of all graphlets being prohibitively expensive, we introduce two theoretically grounded speedup schemes, one based on sampling and the second one specifically designed for bounded degree graphs. In our experimental evaluation, our novel kernels allow us to efficiently compare large graphs that cannot be tackled by existing graph kernels.

Details

show
hide
Language(s):
 Dates: 2009-04
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Degree: -

Event

show
hide
Title: Twelfth International Conference on Artificial Intelligence and Statistics
Place of Event: Clearwater Beach, FL, USA
Start-/End Date: -

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AIStats 2009)
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Cambridge, MA, USA : MIT Press
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 488 - 495 Identifier: -