default search action
Haichuan Shang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c12]Ryotaro Tsukada, Haosen Zhan, Shonosuke Ishiwatari, Masashi Toyoda, Kazutoshi Umemoto, Haichuan Shang, Koji Zettsu:
Crowd Forecasting at Venues with Microblog Posts Referring to Future Events. IEEE BigData 2020: 3147-3155
2010 – 2019
- 2018
- [j7]Weixin Zeng
, Xiang Zhao
Collective List-Only Entity Linking: A Graph-Based Approach. IEEE Access 6: 16035-16045 (2018) - [j6]Jinzhi Liao, Jiuyang Tang, Xiang Zhao
Improving POI Recommendation via Dynamic Tensor Completion. Sci. Program. 2018: 3907804:1-3907804:11 (2018) - 2017
- [j5]Ruiqi Li, Xiang Zhao
Fast top-k similarity join for SimRank. Inf. Sci. 381: 1-19 (2017) - [c11]R. Uday Kiran
Discovering Partial Periodic Itemsets in Temporal Databases. SSDBM 2017: 30:1-30:6 - 2016
- [j4]Yifan Chen, Xiang Zhao, Jiuyang Tang, Weiming Zhang, Haichuan Shang:
Taxi-taking recommendation using real-time trajectories: an online query based approach. Comput. Syst. Sci. Eng. 31(2) (2016) - 2015
- [c10]Haichuan Shang, Xiang Zhao, R. Uday Kiran
Towards Scale-out Capability on Social Graphs. CIKM 2015: 253-262 - [c9]R. Uday Kiran
Discovering Recurring Patterns in Time Series. EDBT 2015: 97-108 - 2013
- [j3]Haichuan Shang, Masaru Kitsuregawa:
Skyline Operator on Anti-correlated Distributions. Proc. VLDB Endow. 6(9): 649-660 (2013) - [c8]Xiang Zhao, Bin Ge, Jiuyang Tang, Weidong Xiao, Haichuan Shang:
Provenance comparison for large-scale knowledge discovery. IEEE BigData 2013: 68-75 - [c7]Xiang Zhao, Haichuan Shang, Wenjie Zhang
On Efficient Graph Substructure Selection. DASFAA (2) 2013: 284-300 - [c6]Haichuan Shang, Masaru Kitsuregawa:
Efficient breadth-first search on large graphs with skewed degree distributions. EDBT 2013: 311-322 - 2012
- [j2]Haichuan Shang, Masaru Kitsuregawa:
A Study on Graph Similarity Search. Inf. Media Technol. 7(4): 1565-1570 (2012) - 2010
- [c5]Haichuan Shang, Ke Zhu, Xuemin Lin
Similarity search on supergraph containment. ICDE 2010: 637-648 - [c4]Haichuan Shang, Xuemin Lin
Connected substructure similarity search. SIGMOD Conference 2010: 903-914 - [c3]Gaoping Zhu, Xuemin Lin
PrefIndex: An Efficient Supergraph Containment Search Technique. SSDBM 2010: 360-378
2000 – 2009
- 2009
- [c2]Chuan Xiao
Top-k Set Similarity Joins. ICDE 2009: 916-927 - 2008
- [j1]Haichuan Shang, Ying Zhang
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proc. VLDB Endow. 1(1): 364-375 (2008) - 2006
- [c1]Haichuan Shang, Xiaoming Jin:
Indexing and Mining of Graph Database Based on Interconnected Subgraph. IDEAL 2006: 986-994
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 00:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: