Demo Data from VLDB 2026 / reviewers in the wild / expert
Luying Chen
dblp:90/7622
· DBLP profile ↗
4ranked-venue papers
3as first author
1since 2021 · last 2023
0009-0008-3845-8128ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 3 first-authorSecurity and privacy · 1 · 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
2 papers |
Data integration and cleaning · 71% Information retrieval · 18% Knowledge graphs · 11% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data integration and cleaning
data fusion |
0.2 | 1 | 2013 | Aggregating Semantic Annotators · Proc. VLDB Endow. 2013 |
Data integration and cleaning
entity resolution |
0.2 | 1 | 2013 | ROSeAnn: Reconciling Opinions of Semantic Annotators · Proc. VLDB Endow. 2013 |
Information retrieval › evaluation
inter-annotator agreement |
0.2 | 1 | 2013 | Aggregating Semantic Annotators · Proc. VLDB Endow. 2013 |
Knowledge graphs › semantic web
semantic annotation |
0.1 | 2 | 2013 | Aggregating Semantic Annotators · Proc. VLDB Endow. 2013 ROSeAnn: Reconciling Opinions of Semantic Annotators · Proc. VLDB Endow. 2013 |
Methods — techniques the papers use, named apart from their topics
weighted-repair · 0.2supervised aggregation · 0.2ontology-aware aggregation · 0.2maximum entropy markov model · 0.2database repair · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Efficient Membership Inference Attacks against Federated Learning via Bias DifferencesabstractFederated learning aims to complete model training without private data sharing, but many privacy risks remain. Recent studies have shown that federated learning is vulnerable to membership inference attacks. The weight as an important parameter in neural networks has been proven effective for membership inference attacks, but it leads to significant overhead. Facing this issue, in this paper, we propose a bias-based method for efficient membership inference attacks against federated learning. Different from the weight that determines the direction of the decision surface, the bias also plays an important role in determining the distance to move along the direction. Moreover, the number of bias is way less than the weight. We consider two types of attacks: local attack and global attack, corresponding to two possible types of insiders: participant and central aggregator. For the local attack, we design a neural network-based inference, which fully learns the vertical bias changes of the member data and non-member data. For the global attack, we design a difference comparison-based inference to determine the data source. Extensive experimental results on four public datasets show that the proposed method achieves state-of-the-art inference accuracy. Moreover, experiments prove the effectiveness of the proposed method to resist some commonly used defenses. Linghui Li 0001, Xiaoyong Li 0003, Binsi Cai, Yali Gao 0004, Ruobin Dou, Luying Chen |
RAID | 7 |
| 2013 | ROSeAnn: Reconciling Opinions of Semantic AnnotatorsabstractNamed entity extractors can be used to enrich both text and Web documents with semantic annotations. While originally focused on a few standard entity types, the ecosystem of annotators is becoming increasingly diverse, with recognition capabilities ranging from generic to specialised entity types. Both the overlap and the diversity in annotator vocabularies motivate the need for managing and integrating semantic annotations: allowing users to see the results of multiple annotations and to merge them into a unified solution. We demonstrate ROSEANN, a system for the management of semantic annotations. ROSEANN provides users with a unified view over the opinion of multiple independent annotators both on text and Web documents. It allows users to understand and reconcile conflicts between annotations via ontology-aware aggregation. ROSEANN incorporates both supervised aggregation, appropriate when representative training data is available, and an unsupervised method based on the notion of weighted-repair. Luying Chen, Stefano Ortona, Giorgio Orsi 0001, Michael Benedikt |
Proc. VLDB Endow. | 1 |
| 2013 | Aggregating Semantic AnnotatorsabstractA growing number of resources are available for enriching documents with semantic annotations. While originally focused on a few standard classes of annotations, the ecosystem of annotators is now becoming increasingly diverse. Although annotators often have very different vocabularies, with both high-level and specialist concepts, they also have many semantic interconnections. We will show that both the overlap and the diversity in annotator vocabularies motivate the need for semantic annotation integration: middleware that produces a unified annotation on top of diverse semantic annotators. On the one hand, the diversity of vocabulary allows applications to benefit from the much richer vocabulary available in an integrated vocabulary. On the other hand, we present evidence that the most widely-used annotators on the web suffer from serious accuracy deficiencies: the overlap in vocabularies from individual annotators allows an integrated annotator to boost accuracy by exploiting inter-annotator agreement and disagreement. The integration of semantic annotations leads to new challenges, both compared to usual data integration scenarios and to standard aggregation of machine learning tools. We overview an approach to these challenges that performs ontology-aware aggregation. We introduce an approach that requires no training data, making use of ideas from database repair. We experimentally compare this with a supervised approach, which adapts maximal entropy Markov models to the setting of ontology-based annotations. We further experimentally compare both these approaches with respect to ontology-unaware supervised approaches, and to individual annotators. Luying Chen, Stefano Ortona, Giorgio Orsi 0001, Michael Benedikt |
Proc. VLDB Endow. | 1 |
| 2012 | QUASAR: querying annotation, structure, and reasoningabstractAn increasing number of systems provide the ability to semantically annotate documents. OpenCalais [4], Evri API [2], Zemanta [6], and Alchemy API [1] are web-hosted systems that return annotated documents, i. e. documents with annotations that are overlayed on the document structure. Many of the annotations can be linked to standard ontologies, such as DBpedia and YAGO. These annotations give insight as to the meaning of documents in a variety of ways, identifying entities and relationships inside them, classifying them according to topic or theme, and giving the attitude or sentiment of a document or document fragment. In order for users (or applications) to make use of these annotations with a means to access and manipulate documents that contain them, we provide a query language for doing this and demonstrate its utility on a demo system built on top of diverse semantic annotators and external ontologies. We explain how integrating semantic annotations and utilizing external knowledge helps in increasing the quality of query answers over annotated documents by both filtering out irrelevant answers and obtaining extra answers that are not explicitly available in the annotated documents. Luying Chen, Michael Benedikt, Evgeny Kharlamov |
EDBT | 1 |