Yunfan Kang

Dr. Yunfan Kang

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 October 2018
Verified
Conference Paper
Open access
PDF file
QKQinma Kang
Qinma Kang
HZHuizhuo Zhou
Huizhuo Zhou
YKYunfan Kang
Yunfan Kang

18 September 2019 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
AMAmr Magdy
Amr Magdy
LALaila Abdelhafeez
Laila Abdelhafeez
YKYunfan Kang
Yunfan Kang
EOEric Ong
Eric Ong
MMMohamed F. Mokbel
Mohamed F. Mokbel

6 June 2022 in Microplastics and Nanoplastics
Verified
Journal Article
Open access
PDF file
HHHannah Hapich
Hannah Hapich
WCWin Cowger
Win Cowger
AGAndrew Gray
Andrew Gray
NTNeil Tangri
Neil Tangri
THTony Hale
Tony Hale
JMJeremiah Mock
Jeremiah Mock
Despite global efforts to monitor, mitigate against, and prevent trash (mismanaged solid waste) pollution, no harmonized trash typology system has been widely adopted worldwide. This impedes the merging of datasets and comparative analyses. We addressed this problem by 1) assessing the state of trash typology and comparability, 2) developing a standardized and harmonized framework of relational tables and tools, and 3) informing practitioners about challenges and potential solutions. We analyzed 68 trash survey lists to assess similarities and differences in classification. We created comprehensive harmonized hierarchical tables and alias tables for item and material classes. On average, the 68 survey lists had 20.8% of item classes in common and 29.9% of material classes in common. Multiple correspondence analysis showed that the 68 surveys were not significantly different regarding organization type, ecosystem focus, or substrate focus. We built the Trash Taxonomy Tool (TTT) web-based application with query features and open access at openanalysis.org/trashtaxonomy. The TTT can be applied to improve, create, and compare trash surveys, and provides practitioners with tools to integrate datasets and maximize comparability. The use of TTT will ultimately facilitate improvements in assessing trends across space and time, identifying targets for mitigation, evaluating the effectiveness of prevention measures, informing policymaking, and holding producers responsible.

8 October 2018 in International Journal of Modern Physics B
Verified
Journal Article
Closed access
PDF file
HKHanzhang Kong
Hanzhang Kong
QKQinma Kang
Qinma Kang
CLChao Liu
Chao Liu
WLWenquan Li
Wenquan Li
HHHong He
Hong He
YKYunfan Kang
Yunfan Kang

1 December 2019 in Physica A: Statistical Mechanics and its Applications
Verified
Journal Article
Closed access
HKHanzhang Kong
Hanzhang Kong
QKQinma Kang
Qinma Kang
WLWenquan Li
Wenquan Li
CLChao Liu
Chao Liu
YKYunfan Kang
Yunfan Kang
HHHong He
Hong He

26 July 2021 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
YSYunfan Shan
Yunfan Shan
QKQinma Kang
Qinma Kang
RXRan Xiao
Ran Xiao
YCYiran Chen
Yiran Chen
YKYunfan Kang
Yunfan Kang
The online social network has become an integral part of modern society and serves as an excellent platform for information diffusion, marketing, and so on. The minimum positive influence dominating set (MPIDS) problem aims to find a set of at least half neighbors of every individual with minimum cardinality and has lots of applications in the social network. Even though numerous algorithms have been proposed for this hard combinatorial problem, challenges such as poor quality and scalability have motivated the researchers for better solutions. In this article, we focus on designing a simple and effective method and propose an iterated carousel greedy (ICG) algorithm for the MPIDS problem. The destruction, carousel, and reconstruction (DCR) procedures are well-designed based on the problem-specific knowledge to improve the algorithm performance, while maintaining the simplicity of the ICG algorithm. The ICG algorithm uses a fast greedy algorithm to generate an initial solution with a certain quality. It then obtains a sequence of better solutions by iterating over DCR phases. A carefully designed experiment is carried out to determine the best parameter configuration. The experimental results on real-world networks indicate that the proposed ICG algorithm significantly outperforms the current state-of-the-art algorithms.