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

Chih-Ying Tseng

dblp:272/6300 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 1 since 2021

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
Approximation and online algorithms · 50% Mathematical optimization · 50%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%
Artificial intelligence
1 paper
Reinforcement learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
reinforcement learning for combinatorial optimization
0.812024
Budget-Constrained Ego Network Extraction With Maximized Willingness · IEEE Trans. Knowl. Data Eng. 2024
Web and social media mining
social network analysis
0.812024
Budget-Constrained Ego Network Extraction With Maximized Willingness · IEEE Trans. Knowl. Data Eng. 2024
Approximation and online algorithms
approximation algorithms
0.812024
Budget-Constrained Ego Network Extraction With Maximized Willingness · IEEE Trans. Knowl. Data Eng. 2024
Mathematical optimization › submodular optimization
submodular maximization
0.812024
Budget-Constrained Ego Network Extraction With Maximized Willingness · IEEE Trans. Knowl. Data Eng. 2024

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

reinforcement learning · 2.3graph augmentation · 2.3contrastive learning · 2.3approximation algorithm · 2.3
YearPublicationVenuePosition
2024 Budget-Constrained Ego Network Extraction With Maximized Willingness
abstract
Many large-scale machine learning approaches and graph algorithms are proposed recently to address a variety of problems in online social networks (OSNs). To evaluate and validate these algorithms and models, the data of ego-centric networks (ego networks) are widely adopted. Therefore, effectively extracting large-scale ego networks from OSNs becomes an important issue, particularly when privacy policies become increasingly strict nowadays. In this paper, we study the problem of extracting ego network data by considering jointly the user willingness, crawling cost, and structure of the network. We formulate a new research problem, namedStructure and Willingness Aware Ego Network Extraction (SWAN)and analyze its NP-hardness. We first propose a$(1-\frac{1}{e})$-approximation algorithm, namedTristar-Optimized Ego Network Identification with Maximum Willingness (TOMW). In addition to the deterministic approximation algorithm, we also propose to automaticallylearnan effective heuristic approach with machine learning, to avoid the huge efforts for human to devise a good algorithm. The learning approach is namedWillingness-maximized and Structure-aware Ego Network Extraction with Reinforcement Learning (WSRL), in which we propose a novel constrastive learning strategy, namedContrastive Learning with Performance-boosting Graph Augmentation. We recruited 1,810 real-world participants and conducted an evaluation study to validate our problem formulation and proposed approaches. Moreover, experimental results on real social network datasets show that the proposed approaches outperform the other baselines significantly.
Bay-Yuan Hsu, Chia-Hsun Lu, Ming-Yi Chang, Chih-Ying Tseng
IEEE Trans. Knowl. Data Eng.4
2020 Detecting Social Anxiety with Online Social Network Data
abstract
Social Anxiety disorder (SAD), one of the most important and common mental disorders, affects a large proportion of individuals around the world. To help identify SAD patients for early intervention, in this study, we bring together computer science and psychology for a new research problem, the automatic identification of SAD patients with online social network data. We extract multiple effective features with the data from 200 online social network users. The effectiveness indicates that our system is promising in identifying SAD patients with online social network data.
Ming-Yi Chang, Chih-Ying Tseng
MDM2