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

Yunzhong Liu

dblp:78/8355 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2019
—ORCID · none

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

Computer networks · 4 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

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.

Network and information security
2 papers
Privacy and data protection · 50% Authentication and access control · 25% Cryptographic primitives and cryptanalysis · 25%
Computer networks
2 papers
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › wireless sensor network › sensor network architecture
tiered sensor networks
0.112010
Verifiable Fine-Grained Top-k Queries in Tiered Sensor Networks · INFOCOM 2010
Internet of things and sensor networks
wireless sensor network
0.112010
Verifiable Fine-Grained Top-k Queries in Tiered Sensor Networks · INFOCOM 2010
Authentication and access control › authentication
message authentication
0.112010
Verifiable Fine-Grained Top-k Queries in Tiered Sensor Networks · INFOCOM 2010
Privacy and data protection › data aggregation
privacy-preserving data aggregation
0.112010
PriSense: Privacy-Preserving Data Aggregation in People-Centric Urban Sensing Systems · INFOCOM 2010
Privacy and data protection
privacy-preserving data analysis
0.112010
PriSense: Privacy-Preserving Data Aggregation in People-Centric Urban Sensing Systems · INFOCOM 2010
Cryptographic primitives and cryptanalysis
symmetric cryptography
0.112010
Verifiable Fine-Grained Top-k Queries in Tiered Sensor Networks · INFOCOM 2010
Internet of things and sensor networks › sensor network security
node compromise resilience
0.012010
Verifiable Fine-Grained Top-k Queries in Tiered Sensor Networks · INFOCOM 2010
Internet of things and sensor networks › mobile sensing
urban sensing
0.012010
PriSense: Privacy-Preserving Data Aggregation in People-Centric Urban Sensing Systems · INFOCOM 2010

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

symmetric cryptographic primitives · 0.2data slicing · 0.2data mixing · 0.2
YearPublicationVenuePosition
2019 Thread Structure Learning on Online Health Forums With Partially Labeled Data
abstract
Thread structures, the reply relationships between posts, in online forums are very important for readers to understand the thread content, as well as for improving the effectiveness of automated forum information retrieval, expert findings, etc. However, most online forums only have partially labeled structures, which means that some reply relationships are known while the others are unknown. To address this problem, studies have been performed to learn and predict thread structures. However, existing work does not leverage the partially available thread structures to learn the complete thread structure. We have also observed that many online health forums are a type of person-centric forums, where persons are mentioned across posts, providing hints about the reply relationships between posts. In this paper, we first proposed to learn the complete thread structures by leveraging the partially known structures based on a statistical machine learning model: thread conditional random fields (threadCRF). Then we proposed to use person resolution, the process of identifying the same person mentioned in different contexts, together with threadCRF for thread structure learning. We have empirically verified the effectiveness of the proposed approaches.
Yunzhong Liu, Jinhe Shi, Yi Chen 0001
IEEE Trans. Comput. Soc. Syst.1
2018 Patient-centered and experience-aware mining for effective adverse drug reaction discovery in online health forums
abstract
Adverse Drug Reactions (ADRs) have become a serious health problem and even a leading cause of death in the United States. Pre‐marketing clinical trials and traditional post‐marketing surveillance using voluntary and spontaneous report systems are insufficient for ADR detection. On the other hand, online health forums provide valuable evidences in a large scale and in a timely fashion through the active participation of patients, caregivers, and doctors. In this article, we present patient‐centered and experience‐aware mining framework for effective ADR discovery using online health forum data. Our experimental evaluation with both an official ADR knowledge base and human‐annotated ground truth verifies the effectiveness of the proposed method for ADR discovery.
Yunzhong Liu, Jinhe Shi, Yi Chen 0001
J. Assoc. Inf. Sci. Technol.1
2014 Connecting the Dots: Knowledge Discovery in Online Healthcare Forums
abstract
Online healthcare forums provide a valuable platform for people to discover knowledge. However, existing approaches rely on the syntactic information units, such as a sentence, a post, or a thread, to bind different pieces of information in a forum. In this work, we propose to connect the pieces of information by a semantic information unit, patients. Specifically, we connect the information of diseases, symptoms, treatments, and effects to the patient who experiences them, and thus enable effective knowledge discovery.
Yi Chen 0001, Yunzhong Liu
ICEC2
2011 Fast identification of the missing tags in a large RFID system
abstract
RFID (radio-frequency identification) is an emerging technology with extensive applications such as transportation and logistics, object tracking, and inventory management. How to quickly identify the missing RFID tags and thus their associated objects is a practically important problem in many large-scale RFID systems. This paper presents three novel methods to quickly identify the missing tags in a large-scale RFID system of thousands of tags. Our protocols can reduce the time for identifying all the missing tags by up to 75% in comparison to the state of art.
Rui Zhang 0007, Yunzhong Liu, Jinyuan Sun
SECON2
2010 PriSense: Privacy-Preserving Data Aggregation in People-Centric Urban Sensing Systems
abstract
People-centric urban sensing is a new paradigm gaining popularity. A main obstacle to its widespread deployment and adoption are the privacy concerns of participating individuals. To tackle this open challenge, this paper presents the design and evaluation of PriSense, a novel solution to privacy-preserving data aggregation in people-centric urban sensing systems. PriSense is based on the concept of data slicing and mixing and can support a wide range of statistical additive and non-additive aggregation functions such as Sum, Average, Variance, Count, Max/Min, Median, Histogram, and Percentile with accurate aggregation results. PriSense can support strong user privacy against a tunable threshold number of colluding users and aggregation servers. The efficacy and efficiency of PriSense are confirmed by thorough analytical and simulation results.
Jing Shi 0002, Rui Zhang 0007, Yunzhong Liu
INFOCOM3
2010 Verifiable Fine-Grained Top-k Queries in Tiered Sensor Networks
abstract
Most large-scale sensor networks are expected to follow a two-tier architecture with resource-poor sensor nodes at the lower tier and resource-rich master nodes at the upper tier. Master nodes collect data from sensor nodes and then answer the queries from the network owner on their behalf. In hostile environments, master nodes may be compromised by the adversary and then instructed to return fake and/or incomplete data in response to data queries. Such application-level attacks are more harmful and difficult to detect than blind DoS attacks on network communications, especially when the query results are the basis for making critical decisions such as military actions. This paper presents three schemes whereby the network owner can verify the authenticity and completeness of fine-grained top-k query results in tired sensor networks, which is the first work of its kind. The proposed schemes are built upon symmetric cryptographic primitives and force compromised master nodes to return both authentic and complete top-k query results to avoid being caught. Detailed theoretical and quantitative results confirm the high efficacy and efficiency of the proposed schemes.
Rui Zhang 0007, Jing Shi 0002, Yunzhong Liu
INFOCOM3
2010 Traffic Inference in Anonymous MANETs
abstract
The open wireless medium in a mobile ad-hoc network (MANET) enables malicious traffic analysis to dynamically infer the network traffic pattern in hostile environments. The disclosure of the traffic pattern and its changes is often devastating in a mission-critical MANET. A number of anonymous routing protocols have been recently proposed as an effective countermeasure against traffic analysis in MANETs. In this paper, we propose a novel traffic inference algorithm, called TIA, which enables a passive global adversary to accurately infer the traffic pattern in an anonymous MANET without compromising any node. As the first work of its kind, TIA works on existing on-demand anonymous MANET routing protocols. Detailed simulations show that TIA can infer the traffic pattern with an accuracy as high as 95%. Our results in this paper highlight the necessity for cross-layer designs to defend a MANET against traffic analysis.
Yunzhong Liu, Rui Zhang 0007, Jing Shi 0002
SECON1