default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMingwei Leng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j5]Longjie Li
, Shijin Xu, Mingwei Leng, Shiyu Fang, Xiaoyun Chen:
Predicting Top- ${L}$ Missing Links: An Improved Local Naïve Bayes Model. IEEE Access 7: 57868-57880 (2019)- [j4]Mei Chen, Zhichong Yang, Xiaofang Wen, Mingwei Leng, Mei Zhang, Ming Li:
Effectively Detecting Communities by Adjusting Initial Structure via Cores. Complex. 2019: 9764341:1-9764341:20 (2019) - [j3]Lina Pan, Xiaosu Feng, Fawen Sang, Longjie Li, Mingwei Leng, Xiaoyun Chen:
An improved back propagation neural network based on complexity decomposition technology and modified flower pollination optimization for short-term load forecasting. Neural Comput. Appl. 31(7): 2679-2697 (2019) - [c6]Mingwei Leng, Tao Ma:
Semi-supervised Community Detection: A Survey. ICIT 2019: 137-140 - 2018
- [j2]Longjie Li, Shenshen Bai, Mingwei Leng, Lu Wang, Xiaoyun Chen:
Finding Missing Links in Complex Networks: A Multiple-Attribute Decision-Making Method. Complex. 2018: 3579758:1-3579758:16 (2018) - 2015
- [c5]Longjie Li, Lvjian Qian, Victor E. Lee, Mingwei Leng, Mei Chen, Xiaoyun Chen:
Fast and Accurate Computation of Role Similarity via Vertex Centrality. WAIM 2015: 123-134 - [i1]Jianjun Cheng, Longjie Li, Mingwei Leng, Weiguo Lu, Yukai Yao, Xiaoyun Chen:
A divisive spectral method for network community detection. CoRR abs/1506.08354 (2015) - 2014
- [j1]Longjie Li, Min Ma, Peng Lei, Mingwei Leng, Xiaoyun Chen:
S2R&R2S: A framework for ranking vertex and computing vertex-pair similarity simultaneously. J. Inf. Sci. 40(6): 723-735 (2014) - 2013
- [c4]Mingwei Leng, Yukai Yao, Jianjun Cheng, Weiming Lv, Xiaoyun Chen:
Active Semi-supervised Community Detection Algorithm with Label Propagation. DASFAA (2) 2013: 324-338 - [c3]Mingwei Leng, Weiming Lv, Jianjun Cheng, Zhao Li, Xiaoyun Chen:
Cooperative Community Detection Algorithm Based on Random Walks. BSI@PAKDD/BSIC@IJCAI 2013: 191-203
2000 – 2009
- 2009
- [c2]Xinsheng Lai, Mingwei Leng, Guolu Tan, Yulin Zhou:
Dual Attractive Centers Optimization: A Simple and Efficient Approach for Real Function. ICNC (4) 2009: 200-204 - 2007
- [c1]Mingwei Leng, Haitao Tang, Xiaoyun Chen:
An Efficient K-means Clustering Algorithm Based on Influence Factors. SNPD (2) 2007: 815-820
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-04-24 23: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:
