default search action
Ying Zhao 0008
Person information
- affiliation: Tsinghua University, Beijing, China
- affiliation (former): University of Minnesota, Minneapolis, NM, USA
Other persons with the same name
- Ying Zhao — disambiguation page
- Ying Zhao 0001 — Central South University, School of Information Science and Engineering, Changsha, China
- Ying Zhao 0002 — Hong Kong University of Science and Technology, Department of Marketing, Clearwater Bay, Kowloon, Hong Kong
- Ying Zhao 0003 — The University of Manchester, UK (and 1 more)
- Ying Zhao 0004 — Technische Universität Darmstadt, Germany
- Ying Zhao 0005 — University of Wollongong, School of Software Engineering and Computer Science, NSW, Australia
- Ying Zhao 0006 — Naval Postgraduate School, Monterey, CA, USA (and 3 more)
- Ying Zhao 0007 — Jilin University, College of Automotive Engineering, State Key Laboratory of Automotive Simulation and Control, Changchun, China
- Ying Zhao 0009 — Ricoh Software Research Center (Beijing) Co., Ltd. (and 2 more)
- Ying Zhao 0010 — Dalian Maritime University, College of Marine Electrical Engineering, China
- Ying Zhao 0011 — Beijing University of Chemical Technology, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [r3]Ying Zhao, George Karypis:
Document Clustering. Encyclopedia of Database Systems (2nd ed.) 2018 - 2010
- [r2]Ying Zhao, George Karypis:
Document Clustering. Encyclopedia of Machine Learning 2010: 293-298
2000 – 2009
- 2009
- [r1]Ying Zhao, George Karypis:
Document Clustering. Encyclopedia of Database Systems 2009: 933-937 - 2006
- [p1]Ying Zhao, George Karypis:
Criterion Functions for Clustering on High-Dimensional Data. Grouping Multidimensional Data 2006: 211-237 - 2005
- [j3]Ying Zhao, George Karypis, Usama M. Fayyad:
Hierarchical Clustering Algorithms for Document Datasets. Data Min. Knowl. Discov. 10(2): 141-168 (2005) - [j2]Ying Zhao, George Karypis:
Prediction of Contact Maps Using Support Vector Machines. Int. J. Artif. Intell. Tools 14(5): 849-866 (2005) - [c7]Jack G. Conrad, Khalid Al-Kofahi, Ying Zhao, George Karypis:
Effective Document Clustering for Large Heterogeneous Law Firm Collections. ICAIL 2005: 177-187 - [c6]Ying Zhao, George Karypis:
Topic-driven Clustering for Document Datasets. SDM 2005: 358-369 - 2004
- [j1]Ying Zhao, George Karypis:
Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering. Mach. Learn. 55(3): 311-331 (2004) - [c5]Ying Zhao, George Karypis:
Soft clustering criterion functions for partitional document clustering: a summary of results. CIKM 2004: 246-247 - 2003
- [c4]Ying Zhao, George Karypis:
Prediction of Contact Maps Using Support Vector Machines. BIBE 2003: 26- - 2002
- [c3]Ying Zhao, George Karypis:
Evaluation of hierarchical clustering algorithms for document datasets. CIKM 2002: 515-524 - [c2]Jian Liu, Ying Zhao, Eugene Shragowitz, George Karypis:
A polynomial time approximation scheme for rectilinear Steiner minimum tree construction in the presence of obstacles. ICECS 2002: 781-784 - [c1]Ying Zhao, George Karypis:
Improve Precategorized Collection Retrieval by Using Supervised Term Weighting Schemes. ITCC 2002: 16-21
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-12-27 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint