ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Learning to rank graphs for online similar graph search
Full text PdfPdf (371 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 18th ACM conference on Information and knowledge management table of contents
Hong Kong, China
POSTER SESSION: Poster session 6: IR track table of contents
Pages: 1871-1874  
Year of Publication: 2009
ISBN:978-1-60558-512-3
Authors
Bingjun Sun  Pennsylvania State University, University Park, PA, USA
Prasenjit Mitra  Pennsylvania State University, University Park, PA, USA
C. Lee Giles  Pennsylvania State University, University Park, PA, USA
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 39,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1645953.1646252
What is a DOI?

ABSTRACT

Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chemoinformatics, have used the maximum common edge subgraph (MCEG) to compute the graph similarity. This approach is prohibitively slow for real-time queries. In this work, we propose an algorithm that extracts and indexes subgraph features from a graph dataset. It computes the similarity of graphs using a linear graph kernel based on feature weights learned offline from a training set generated using MCEG. We show empirically that our proposed algorithm of learning to rank graphs can achieve higher normalized discounted cumulative gain compared with existing optimal methods based on MCEG. The running time of our algorithm is orders of magnitude faster than these existing methods.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
B. Chen, Q. Zhao, B. Sun, and P. Mitra. Temporal and social network based blogging behavior prediction in blogspace. In Proc. ICDM, 2007.
 
2
D. Haussler. Convolution kernels on discrete structures. Technical Report UCS-CRL-99-10, 1999.
 
3
P. Li, C. J. Burges, and Q. Wu. Learning to rank using classification and gradient boosting. In Proc. NIPS, 2007.
4
 
5
J. W. Raymond, E. J. Gardiner, and P. Willet. Rascal: Calculation of graph similarity using maximum common edge subgraphs. The Computer Journal, 45(6):631--644, 2002.
6
7
8
9
10
11
 
12
13

Collaborative Colleagues:
Bingjun Sun: colleagues
Prasenjit Mitra: colleagues
C. Lee Giles: colleagues