Efficient probabilistic supergraph search

Zhang, W; Lin, X; Zhang, Y; Zhu, K; Zhu, G

Efficient probabilistic supergraph search

Zhang, W Lin, X Zhang, Y

Zhu, K Zhu, G

Permalink

Publication Type:: Conference Proceeding
Citation:: 2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016, 2016, pp. 1542 - 1543
Issue Date:: 2016-06-22

Closed Access

	Filename	Description	Size
	TKDE_2016.pdf	Accepted Manuscript version	960.47 kB		View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhang, W	en_US
dc.contributor.author	Lin, X	en_US
dc.contributor.author	Zhang, Y https://orcid.org/0000-0002-2674-1638	en_US
dc.contributor.author	Zhu, K	en_US
dc.contributor.author	Zhu, G	en_US
dc.date.issued	2016-06-22	en_US
dc.identifier.citation	2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016, 2016, pp. 1542 - 1543	en_US
dc.identifier.isbn	9781509020195	en_US
dc.identifier.uri	http://hdl.handle.net/10453/133705
dc.description.abstract	© 2016 IEEE. In this paper, we investigate the problem of supergraph containment search over uncertain data graphs gu where each edge in a gu has an occurrence probability, namely probabilistic supergraph search, which has a wide spectrum of applications.	en_US
dc.relation.ispartof	2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016	en_US
dc.relation.isbasedon	10.1109/ICDE.2016.7498415	en_US
dc.title	Efficient probabilistic supergraph search	en_US
dc.type	Conference Proceeding
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

© 2016 IEEE. In this paper, we investigate the problem of supergraph containment search over uncertain data graphs gu where each edge in a gu has an occurrence probability, namely probabilistic supergraph search, which has a wide spectrum of applications.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/133705