default search action
Yuan Liang 0003
Person information
- affiliation: Suqian University, China
- affiliation: Guilin University of Electronic Technology, Guangxi Key Laboratory of Trusted Software, Guilin, China
- affiliation (PhD): Beihang University, School of Computer Science and Engineering, Beijing, China
Other persons with the same name
- Yuan Liang — disambiguation page
- Yuan Liang 0001 — University of California, Department of Electrical Engineering, Los Angeles, CA, USA
- Yuan Liang 0002 — Michigan State University, East Lansing, MI, USA (and 1 more)
- Yuan Liang 0004 — Nanyang Technological University, School of Electrical and Electronic Engineering, Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Yuan Liang:
Attentive Implicit Relation Embedding for Event Recommendation in Event-Based Social Network. Big Data Res. 36: 100426 (2024) - [j7]Yuan Liang:
Crowdsourcing incentive mechanisms for cross-platform tasks: A weighted average maximization approach. Eng. Appl. Artif. Intell. 133: 108008 (2024) - [j6]Yuan Liang:
FAER: Fairness-Aware Event-Participant Recommendation in Event-Based Social Networks. IEEE Trans. Big Data 10(5): 655-668 (2024) - 2023
- [j5]Zhe Chen, Yuan Liang, Zhengbo Yu, Ke Xu, Qingyun Ji, Xueqi Zhang, Quanping Zhang, Zijia Cui, Ziqiong He, Ruichun Chang, Zhongchang Sun, Keyan Xiao, Huadong Guo:
TO-YOLOX: a pure CNN tiny object detection model for remote sensing images. Int. J. Digit. Earth 16(1): 3882-3904 (2023) - [j4]Yuan Liang:
DFGR: Diversity and Fairness Awareness of Group Recommendation in an Event-based Social Network. Neural Process. Lett. 55(8): 11293-11312 (2023) - [c6]Yuan Liang:
Attentive Implicit Relation Embedding for Event Recommendation in Event-based Social Network. CNIOT 2023: 273-277 - 2022
- [c5]Yuan Liang:
FAGR: Fairness-aware Group Recommendation in Event-based Social Networks. IEEE Big Data 2022: 4926-4935 - [c4]Yuan Liang:
FAER: Fairness-aware Event-participant Recommendation in Event-based Social Networks. CSAI 2022: 154-159 - [c3]Yuan Liang:
Fatigue-Aware Event-Participant Arrangement in Event-Based Social Networks: An Upper Confidence Bound Method. IntelliSys (2) 2022: 780-796 - 2021
- [j3]Yuan Liang, Chunlin Huang, Xiuguo Bao, Ke Xu:
Sequential dynamic event recommendation in event-based social networks: An upper confidence bound approach. Inf. Sci. 542: 1-23 (2021)
2010 – 2019
- 2019
- [j2]Yuan Liang:
Complex Dynamic Event Participant in an Event-Based Social Network: A Three-Dimensional Matching. IEEE Access 7: 144188-144201 (2019) - 2017
- [j1]Yuan Liang, Weifeng Lv, Wenjun Wu, Ke Xu:
Friendship-aware task planning in mobile crowdsourcing. Frontiers Inf. Technol. Electron. Eng. 18(1): 107-121 (2017) - [c2]Yuan Liang:
Social Friendship-Aware Courses Arrangement on MOOCs. DASFAA Workshops 2017: 417-422 - 2016
- [c1]Yuan Liang, Haogang Zhu, Xiao Chen:
Result Diversification in Event-Based Social Networks. WAIM Workshops 2016: 198-210
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-15 20:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint