| Learning to rank graphs for online similar graph search |
| Full text |
Pdf
(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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 12, Downloads (12 Months): 39, Citation Count: 0
|
|
|
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
|
Bingjun Sun , Prasenjit Mitra , C. Lee Giles, Mining, indexing, and searching for textual chemical molecule information on the web, Proceeding of the 17th international conference on World Wide Web, April 21-25, 2008, Beijing, China
[doi> 10.1145/1367497.1367597]
|
 |
7
|
Bingjun Sun , Prasenjit Mitra , C. Lee Giles , John Yen , Hongyuan Zha, Topic segmentation with shared topic detection and alignment of multiple documents, Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, July 23-27, 2007, Amsterdam, The Netherlands
[doi> 10.1145/1277741.1277778]
|
 |
8
|
Bingjun Sun , Qingzhao Tan , Prasenjit Mitra , C. Lee Giles, Extraction and search of chemical formulae in text documents on the web, Proceedings of the 16th international conference on World Wide Web, May 08-12, 2007, Banff, Alberta, Canada
[doi> 10.1145/1242572.1242607]
|
 |
9
|
Bingjun Sun , Ding Zhou , Hongyuan Zha , John Yen, Multi-task text segmentation and alignment based on weighted mutual information, Proceedings of the 15th ACM international conference on Information and knowledge management, November 06-11, 2006, Arlington, Virginia, USA
[doi> 10.1145/1183614.1183760]
|
 |
10
|
|
 |
11
|
|
| |
12
|
|
 |
13
|
|
|