default search action
Mo Li 0004
Person information
- affiliation: Northeastern University, School of Computer Science and Engineering, Key Laboratory of Big Data Management and Analytics (Liaoning), Shenyang, China
Other persons with the same name
- Mo Li — disambiguation page
- Mo Li 0001
— Nanyang Technological University, School of Computer Science and Engineering, Singapore (and 1 more)
- Mo Li 0002 — University of Technology Sydney, Faculty of Engineering, Australia
- Mo Li 0003 — Hosei University, School of Information Sciences, Koganei, Japan
- Mo Li 0005
- Mo Li 0006
- Mo Li 0007 — Chinese Academy of Sciences, Key Laboratory of Quantum Information, Hefei, China
- Mo Li 0008 — Harbin Institute of Technology, Harbin, China
- Mo Li 0009 — Liaoning Cancer Hospital & Institute, Shenyang, China
- Mo Li 0010 — PLA University of Science and Technology, Nanjing, China
- Mo Li 0011 — University of California, Irvine, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Linlin Ding, Sisi Li, Ji Ma, Mo Li
Multi-example query over ontology-label knowledge graphs. Computing 106(7): 2081-2106 (2024) - [j3]Mo Li
Maximal size constraint community search over bipartite graphs. Knowl. Based Syst. 297: 111961 (2024) - [c9]Linlin Ding, Yiming Han, Mo Li, Dong Li:
Enhancing Sentiment Analysis for Chinese Texts Using a BERT-Based Model with a Custom Attention Mechanism. WISA 2024: 172-179 - [c8]Mo Li, Zhiran Xie, Linlin Ding:
Reliable Community Search over Dynamic Bipartite Graphs. WISA 2024: 298-307 - [c7]Linlin Ding, Di Yuan Chzhen, Yuda Li, Zhiyong Zhang, Zhiran Xie, Mo Li:
NexusDB: A Large-Scale Distributed Time-Series Database for Industrial Scenarios. APWeb/WAIM (5) 2024: 408-412 - 2023
- [j2]Linlin Ding
Example query on ontology-labels knowledge graph based on filter-refine strategy. World Wide Web (WWW) 26(1): 343-373 (2023) - [c6]Mo Li, Zhiran Xie, Linlin Ding:
Persistent Community Search Over Temporal Bipartite Graphs. ADMA (5) 2023: 324-339 - [c5]Linlin Ding, Gang Zhang, Ji Ma, Mo Li:
An Efficient Index-Based Method for Skyline Path Query over Temporal Graphs with Labels. DASFAA (3) 2023: 217-233 - 2020
- [c4]Mo Li
CrashSim: An Efficient Algorithm for Computing SimRank over Static and Temporal Graphs. ICDE 2020: 1141-1152
2010 – 2019
- 2019
- [j1]Zhiqiong Wang, Mo Li
Breast Cancer Detection Using Extreme Learning Machine Based on Feature Fusion With CNN Deep Features. IEEE Access 7: 105146-105158 (2019) - [c3]Mo Li, Junchang Xin, Zhiqiong Wang, Huilin Liu:
Accelerating Minimum Temporal Paths Query Based on Dynamic Programming. ADMA 2019: 48-62 - [c2]Yizhu Cai, Mo Li, Junchang Xin:
Similar Group Finding Algorithm Based on Temporal Subgraph Matching. ADMA 2019: 221-235 - 2018
- [c1]Junchang Xin, Mo Li, Wangzihao Xu, Yizhu Cai, Minhua Lu, Zhiqiong Wang:
Efficient Complex Social Event-Participant Planning Based on Heuristic Dynamic Programming. DASFAA (2) 2018: 264-279
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-11-15 19:33 CET 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: