SIGN IN
SIGN UP
G-hash: towards fast kernel-based similarity search in large graph databases
Full Text:
PDF
SIGN IN to get this Article
Authors:
Xiaohong Wang
University of Kansas, Lawrence, KS
Aaron Smalter
University of Kansas, Lawrence, KS
Jun Huan
University of Kansas, Lawrence, KS
Gerald H. Lushington
University of Kansas, Lawrence, KS
2009 Article
Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 78
· Citation Count: 2
Published in:
· Proceeding
EDBT '09
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-422-5
doi>
10.1145/1516360.1516416
Tools and Resources
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
k
-nns search
graph classification
graph kernels
graph similarity query
hashing
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder