Demo Data from EDBT 2026 / reviewers in the wild / expert
Ivan Mihov
dblp:260/5398
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Security and privacy · 1Databases, data management, data science and information retrieval · 1 · 1 first-author · 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.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 87% Web and social media mining · 13% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Medical and health informatics · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Medical and health informatics › mental health informatics
depression detection |
0.6 | 1 | 2022 | MentalNet: Heterogeneous Graph Representation for Early Depression Detection · ICDM 2022 |
Medical and health informatics
mental health |
0.6 | 1 | 2022 | MentalNet: Heterogeneous Graph Representation for Early Depression Detection · ICDM 2022 |
Data mining › structured data mining › graph mining › graph learning
graph classification |
0.6 | 1 | 2022 | MentalNet: Heterogeneous Graph Representation for Early Depression Detection · ICDM 2022 |
Data mining › structured data mining
graph mining |
0.6 | 1 | 2022 | MentalNet: Heterogeneous Graph Representation for Early Depression Detection · ICDM 2022 |
Web and social media mining
social media analysis |
0.2 | 1 | 2022 | MentalNet: Heterogeneous Graph Representation for Early Depression Detection · ICDM 2022 |
Methods — techniques the papers use, named apart from their topics
heterogeneous graph convolution · 1.1graph neural network · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | MentalNet: Heterogeneous Graph Representation for Early Depression DetectionabstractDepression is one of the leading factors in global disability and a top driver for suicides. Studies have shown that depression has an effect on language usage. In recent years, especially during the COVID pandemic, social media platforms have become the de facto platform for many individuals to self-disclose or discuss mental health issues like depression. This trend presents a unique opportunity for researchers and healthcare professionals to detect potential mental illnesses for early intervention or treatment by taking advantage of the recent advances in machine learning approaches. Existing depression detection methods on social media, however, suffer from two major limitations. First, these solutions heavily rely on the amount, quality, and type of user-posted content. Second, the overlooked social circle impact should be leveraged to enhance the prediction capabilities. In this paper, we propose a depression detection framework, MentalNet, based on heterogeneous graph convolution by capturing users’ interactions (replies, mentions, and quotetiveets) with their friends on social media and differentiating the intimacy of users’ social circles (e.g., family, friends, or acquaintances). Specifically, we formulate the problem of depression detection on social media as a graph classification problem by representing users’ social circles in the format of heterogeneous graphs. MentalNet embraces three modules, (1) extraction of ego-network node features, (2) construction of user interaction graphs, and (3) depression detection based on heterogeneous graph classification. The extensive experiments on Twitter data demonstrate that MentalNet consistently and significantly outperforms the state-of-the-art methods in terms of all the effectiveness metrics. Compared to the baseline methods, MentalNet is able to effectively predict early depression in Twitter users with up to 24% improvement on F1 score. Ivan Mihov, Haiquan Chen 0001, Xiao Qin 0001, Wei-Shinn Ku, Da Yan 0001, Yuhong Liu 0003 |
ICDM | 1 |
| 2020 | A Performance Comparison of WireGuard and OpenVPNabstractA fundamental problem that confronts virtual private network (VPN) applications is the overhead on throughput, ease of deployment and use, and overall utilization. WireGuard is a recently introduced light and secure cross-platform VPN application. It aims to simplify the process of setting up a secure connection while utilizing the multi-threading capability and minimizing the use of bandwidth. There have been several follow-up studies on WireGuard since its birth, most of which focus on the security analysis of the protocol. Despite the author's claim that WireGuard has impressive wins over OpenVPN and IPsec, there is no rigorous analysis of its performance to date. This paper presents a performance comparison of WireGuard and its main rival OpenVPN on various metrics. We construct an automated test framework and deploy it on a total of eight nodes, including remote AWS instances and local virtual machines. Our test results clearly show two main edges that WireGuard has over OpenVPN, its performance on multi-core machines and its light codebase. Steven Mackey, Ivan Mihov, Alex Nosenko, Francisco Vega, Yuan Cheng 0002 |
CODASPY | 2 |