Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sy-Miin Chow

dblp:155/9286 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0003-1938-027XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 50% Mathematical optimization · 25% Computational complexity · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
combinatorial optimization
0.412020
Efficient Algorithms towards Network Intervention · WWW 2020
Computational complexity
hardness of approximation
0.412020
Efficient Algorithms towards Network Intervention · WWW 2020
Graph algorithms and graph theory
network intervention
0.412020
Efficient Algorithms towards Network Intervention · WWW 2020
Graph algorithms and graph theory › network analysis
social network analysis
0.412020
Efficient Algorithms towards Network Intervention · WWW 2020

Methods — techniques the papers use, named apart from their topics

pruning · 0.4heuristic algorithm · 0.4
YearPublicationVenuePosition
2020 Efficient Algorithms towards Network Intervention
abstract
Research suggests that social relationships have substantial impacts on individuals’ health outcomes. Network intervention, through careful planning, can assist a network of users to build healthy relationships. However, most previous work is not designed to assist such planning by carefully examining and improving multiple network characteristics. In this paper, we propose and evaluate algorithms that facilitate network intervention planning through simultaneous optimization of network degree, closeness, betweenness, and local clustering coefficient, under scenarios involving Network Intervention with Limited Degradation - for Single target (NILD-S) and Network Intervention with Limited Degradation - for Multiple targets (NILD-M). We prove that NILD-S and NILD-M are NP-hard and cannot be approximated within any ratio in polynomial time unless P=NP. We propose the Candidate Re-selection with Preserved Dependency (CRPD) algorithm for NILD-S, and the Objective-aware Intervention edge Selection and Adjustment (OISA) algorithm for NILD-M. Various pruning strategies are designed to boost the efficiency of the proposed algorithms. Extensive experiments on various real social networks collected from public schools and Web and an empirical study are conducted to show that CRPD and OISA outperform the baselines in both efficiency and effectiveness.
Hui-Ju Hung, Wang-Chien Lee, De-Nian Yang, Zhen Lei 0005, Sy-Miin Chow
WWW6