Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMingyang Zhou 0001
Person information
- affiliation: Shenzhen University, College of Computer Science and Software Engineering, China
Other persons with the same name
- Mingyang Zhou (aka: Ming-Yang Zhou) — disambiguation page
- Mingyang Zhou 0002
![[0000-0002-5522-3899]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-5522-3899")
— Southeast University, National ASIC System Engineering Center, School of Electronic Science and Engineering, Nanjing, China - Mingyang Zhou 0003 — University of Chicago, Department of Computer Science, IL, USA
- Mingyang Zhou 0004 — University of California, Davis, Department of Computer Science, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j15]Mingyang Zhou, Fei Wang, Ze Chen, Ji Wu, Gang Liu, Hao Liao:
Weak link prediction based on hyper latent distance in complex network. Expert Syst. Appl. 238(Part C): 121843 (2024)- 2023
- [j14]Zheng Zhang, Ming-Yang Zhou, Jun Wan, Kezhong Lu, Guoliang Chen, Hao Liao:
Spammer detection via ranking aggregation of group behavior. Expert Syst. Appl. 216: 119454 (2023) - [j13]Zheng Zhang, Jun Wan, Mingyang Zhou, Zhihui Lai, Claudio J. Tessone, Guoliang Chen, Hao Liao:
Temporal burstiness and collaborative camouflage aware fraud detection. Inf. Process. Manag. 60(2): 103170 (2023) - [j12]Hao Liao, Sheng Bi, Jiao Wu, Wei Zhang, Mingyang Zhou, Rui Mao, Wei Chen:
Popularity Ratio Maximization: Surpassing Competitors through Influence Propagation. Proc. ACM Manag. Data 1(2): 164:1-164:26 (2023) - 2022
- [j11]Rong-Qin Xu, Ming-Yang Zhou, Hao Liao:
PNR: How to optimally combine different link prediction approaches? Inf. Sci. 584: 342-359 (2022) - [j10]Zheng Zhang, Jun Wan, Ming-Yang Zhou, Kezhong Lu, Guoliang Chen, Hao Liao:
Information diffusion-aware likelihood maximization optimization for community detection. Inf. Sci. 602: 86-105 (2022) - 2021
- [j9]Ming-Yang Zhou, Rong-Qin Xu, Zi-Ming Wang, Hao Liao:
A generic Bayesian-based framework for enhancing top-N recommender algorithms. Inf. Sci. 580: 460-477 (2021) - 2020
- [j8]Hao Liao, Jiao Wu, Yifan Mao, Ming-Yang Zhou, Alexandre Vidmer, Kezhong Lu:
Addressing time bias in bipartite graph ranking for important node identification. Inf. Sci. 540: 38-50 (2020) - 2019
- [j7]Hao Liao, Ming-Kai Liu, Manuel Sebastian Mariani, Ming-Yang Zhou, Xing-Tong Wu:
Temporal similarity metrics for latent network reconstruction: The role of time-lag decay. Inf. Sci. 489: 182-192 (2019) - 2018
- [j6]Ming-Yang Zhou, Xiao-Yu Li, Wen-Man Xiong, Hao Liao:
Quantifying the Robustness of Countries' Competitiveness by Network-Based Methods. Complex. 2018: 5738135:1-5738135:10 (2018) - [j5]Hao Liao, Xiao-Min Huang, Xing-Tong Wu, Ming-Kai Liu, Alexandre Vidmer, Ming-Yang Zhou, Yi-Cheng Zhang:
Enhancing Countries' Fitness with Recommender Systems on the International Trade Network. Complex. 2018: 5806827:1-5806827:12 (2018) - [j4]Hao Liao, Xiao-Min Huang, Alexandre Vidmer, Yi-Cheng Zhang, Ming-Yang Zhou:
Economic Complexity Based Recommendation Enhance the Efficiency of the Belt and Road Initiative. Entropy 20(9): 718 (2018) - [j3]Ming-Yang Zhou, Wen-Man Xiong, Xiao-Yu Li, Hao Liao:
The Middle-Income Trap and the Coping Strategies From Network-Based Perspectives. Entropy 20(10): 803 (2018) - 2017
- [j2]Hao Liao, An Zeng, Ming-Yang Zhou, Rui Mao, Bing-Hong Wang:
Information mining in weighted complex networks with nonlinear rating projection. Commun. Nonlinear Sci. Numer. Simul. 51: 115-123 (2017) - [j1]Ming-Yang Zhou, Hao Liao, Wen-Man Xiong, Xiang-yang Wu, Zong-Wen Wei:
Connecting Patterns Inspire Link Prediction in Complex Networks. Complex. 2017: 8581365:1-8581365:12 (2017)
Conference and Workshop Papers
- 2023
- [c6]Hao Cheng, Shuo Wang, Wensheng Lu, Wei Zhang, Mingyang Zhou, Kezhong Lu, Hao Liao:
Explainable Recommendation with Personalized Review Retrieval and Aspect Learning. ACL (1) 2023: 51-64 - 2022
- [c5]Shuo Wang, Ziqiang Wu, Sheng Bi, Zheng Zhang, Xiaomin Huang, Ming-Yang Zhou, Hao Liao:
Community Splitter: A Network Embedding Method for Predicting Missing Links. DSAA 2022: 1-10 - [c4]Xin Li, Xiaojie Zhang, Peng Jia, Rui Mao, Ming-Yang Zhou, Xing Xie, Hao Liao:
A Joint Learning Framework for Restaurant Survival Prediction and Explanation. EMNLP 2022: 3285-3297 - 2020
- [c3]Hao Liao, Xiaojie Zhang, Xin Li, Ming-Yang Zhou, Alexandre Vidmer, Rui Mao:
A Deep Concept-aware Model for predicting and explaining restaurant future status. ICWS 2020: 559-567 - [c2]Rong-Qin Xu, Ming-Yang Zhou, Hao Liao:
RNR: A Generic Bayesian-based Framework for Enhancing Top-N Recommender Systems. WWW (Companion Volume) 2020: 103-104 - 2019
- [c1]Hao Liao, Qi-Xin Liu, Alexandre Vidmer, Ming-Yang Zhou, Rui Mao:
RNC: Reliable Network Property Classifier Based on Graph Embedding. PDCAT 2019: 340-345
Informal and Other Publications
- 2024
- [i11]Wensheng Lu, Jianxun Lian, Wei Zhang, Guanghua Li, Mingyang Zhou, Hao Liao, Xing Xie:
Aligning Large Language Models for Controllable Recommendations. CoRR abs/2403.05063 (2024) - 2023
- [i10]Hao Liao, Sheng Bi, Jiao Wu, Wei Zhang, Mingyang Zhou, Rui Mao, Wei Chen:
Popularity Ratio Maximization: Surpassing Competitors through Influence Propagation. CoRR abs/2304.14971 (2023) - [i9]Hao Cheng, Shuo Wang, Wensheng Lu, Wei Zhang, Mingyang Zhou, Kezhong Lu, Hao Liao:
Explainable Recommendation with Personalized Review Retrieval and Aspect Learning. CoRR abs/2306.12657 (2023) - 2020
- [i8]Ziqiang Wu, Hao Liao, Alexandre Vidmer, Ming-Yang Zhou, Wei Chen:
COVID-19 Plateau: A Phenomenon of Epidemic Development under Adaptive Prevention Strategies. CoRR abs/2011.03376 (2020) - 2019
- [i7]Hao Liao, Xiao-Min Huang, Xing-Tong Wu, Ming-Kai Liu, Alexandre Vidmer, Ming-Yang Zhou, Yi-Cheng Zhang:
Enhancing countries' fitness with recommender systems on the international trade network. CoRR abs/1904.02412 (2019) - [i6]Hao Liao, Ming-Kai Liu, Manuel Sebastian Mariani, Ming-Yang Zhou, Xing-Tong Wu:
Temporal similarity metrics for latent network reconstruction: The role of time-lag decay. CoRR abs/1904.02413 (2019) - [i5]Hao Liao, Xing-Tong Wu, Ming-Yang Zhou, Chi Ho Yeung:
Learning the optimally coordinated routes from the statistical mechanics of polymers. CoRR abs/1906.00130 (2019) - [i4]Hao Liao, Jiao Wu, Ming-Yang Zhou, Alexandre Vidmer:
Addressing Time Bias in Bipartite Graph Ranking for Important Node Identification. CoRR abs/1911.12558 (2019) - 2017
- [i3]Hao Liao, Manuel Sebastian Mariani, Matús Medo, Yi-Cheng Zhang, Ming-Yang Zhou:
Ranking in evolving complex networks. CoRR abs/1704.08027 (2017) - [i2]Hao Liao, Ming-Yang Zhou, Zong-Wen Wei, Rui Mao, Alexandre Vidmer, Yi-Cheng Zhang:
Hidden space reconstruction inspires link prediction in complex networks. CoRR abs/1705.02199 (2017) - 2015
- [i1]Ming-Yang Zhou, Zhao Zhuo, Hao Liao, Zhong-Qian Fu, Shi-Min Cai:
Enhancing speed of pinning synchronizability: low-degree nodes with high feedback gains. CoRR abs/1511.02012 (2015)
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-05-09 00:01 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:
