default search action
Yuanzhe Cai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c13]Zhaochong Yu, Zihang Yang
, Qingyang Lan, Yuchuan Wang, Feijuan Huang, Yuanzhe Cai:
Kmer-Node2Vec: a Fast and Efficient Method for Kmer Embedding from the Kmer Co-occurrence Graph, with Applications to DNA Sequences. EMBC 2023: 1-4 - [c12]Taiwei Wu
Music-Graph2Vec: An Efficient Method for Embedding Pitch Segment. MMAsia 2023: 97:1-97:5 - [c11]Wenting Li, Jiahong Xue, Xi Zhang, Huacan Chen, Zeyu Chen, Feijuan Huang, Yuanzhe Cai:
Word-Graph2vec: An Efficient Word Embedding Approach on Word Co-occurrence Graph Using Random Walk Technique. WISE 2023: 875-885 - [i2]Wenting Li, Yuanzhe Cai, Jiahong Xue, Zeyu Chen:
Word-Graph2vec: An efficient word embedding approach on word co-occurrence graph using random walk sampling. CoRR abs/2301.04312 (2023) - [i1]Ruilin Yuan, Leya Li, Yuanzhe Cai:
Item-Graph2vec: a Efficient and Effective Approach using Item Co-occurrence Graph Embedding for Collaborative Filtering. CoRR abs/2310.14215 (2023) - 2020
- [j2]Chuangxian Wei, Bin Wu
AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data. Proc. VLDB Endow. 13(12): 3152-3165 (2020)
2010 – 2019
- 2013
- [j1]Yuanzhe Cai, Sharma Chakravarthy:
Answer Quality Prediction in Q/A Social Networks by Leveraging Temporal Features. Int. J. Next Gener. Comput. 4(1) (2013) - [c10]Yuanzhe Cai, Sharma Chakravarthy
Expertise Ranking of Users in QA Community. DASFAA (1) 2013: 25-40 - 2011
- [c9]Yuanzhe Cai, Sharma Chakravarthy
Pairwise Similarity Calculation of Information Networks. DaWaK 2011: 316-329 - [c8]Yuanzhe Cai, Miao Zhang, Dijun Luo, Chris H. Q. Ding, Sharma Chakravarthy
Low-order tensor decompositions for social tagging recommendation. WSDM 2011: 695-704 - 2010
- [c7]Xu Jia, Hongyan Liu, Li Zou, Jun He, Xiaoyong Du, Yuanzhe Cai:
Local Methods for Estimating SimRank Score. APWeb 2010: 157-163 - [c6]Yuanzhe Cai, Miao Zhang, Chris H. Q. Ding, Sharma Chakravarthy
Closed form solution of similarity algorithms. SIGIR 2010: 709-710
2000 – 2009
- 2009
- [c5]Xu Jia, Yuanzhe Cai, Hongyan Liu, Jun He, Xiaoyong Du:
Calculating Similarity Efficiently in a Small World. ADMA 2009: 175-187 - [c4]Yuanzhe Cai, Hongyan Liu, Jun He, Xiaoyong Du, Xu Jia:
An Adaptive Method for the Efficient Similarity Calculation. DASFAA 2009: 339-353 - [c3]Yuanzhe Cai, Gao Cong
Efficient Algorithm for Computing Link-Based Similarity in Real World Networks. ICDM 2009: 734-739 - [c2]Pei Li, Yuanzhe Cai, Hongyan Liu, Jun He, Xiaoyong Du:
Exploiting the Block Structure of Link Graph for Efficient Similarity Computation. PAKDD 2009: 389-400 - 2008
- [c1]Yuanzhe Cai, Pei Li, Hongyan Liu, Jun He, Xiaoyong Du:
S-SimRank: Combining Content and Link Information to Cluster Papers Effectively and Efficiently. ADMA 2008: 317-329
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-10-07 21:15 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: