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

Nada Lahjouji

dblp:380/6015 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0006-8261-1949ORCID · corroborated

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

Security and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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.

Network and information security
1 paper
Privacy and data protection · 100%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
differential privacy
0.812024
ProBE: Proportioning Privacy Budget for Complex Exploratory Decision Support · CCS 2024
Privacy and data protection › differential privacy › privacy accounting
privacy budget allocation
0.812024
ProBE: Proportioning Privacy Budget for Complex Exploratory Decision Support · CCS 2024
Query processing and optimization
aggregate query processing
0.212024
ProBE: Proportioning Privacy Budget for Complex Exploratory Decision Support · CCS 2024
Query processing and optimization › analytical query processing
decision support queries
0.212024
ProBE: Proportioning Privacy Budget for Complex Exploratory Decision Support · CCS 2024

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

differential privacy · 1.5
YearPublicationVenuePosition
2025 Modeling Inhabited Smart Spaces to Support Interoperable IoT-Based Applications
abstract
IoT deployments in smart spaces can enable the development of useful services for their inhabitants. However, the diversity of smart spaces and their sensor infrastructures makes it challenging to develop space-agnostic applications. Moreover, existing schemas addressing interoperability challenges often lack the vocabulary needed to represent the integration of smart space systems and their inhabitants. We present a schema to annotate inhabited smart spaces in support of inhabitant-oriented applications. Our schema integrates well-known ontologies to represent inhabitants, events/activities, and the space itself, along with their interconnections. It also supports the representation of uncertain information from IoT and mobile sensors (e.g., a person's location or occupancy/attendance at an event). Additionally, we introduce an annotation tool that uses an easy-to-use GUI to describe a smart space based on our schema. We demonstrate the potential of our approach through a series of SPARQL queries and a system deployed at the UCI campus that annotates sensor data to support a space-agnostic occupancy monitoring application.
Roberto Yus, Nada Lahjouji, Georgios Bouloukakis, Sharad Mehrotra, Nalini Venkatasubramanian
MDM2
2024 ProBE: Proportioning Privacy Budget for Complex Exploratory Decision Support
abstract
This paper studies privacy in the context of complex decision support queries composed of multiple conditions on different aggregate statistics combined using disjunction and conjunction operators. Utility requirements for such queries necessitate the need for private mechanisms that guarantee a bound on the false negative and false positive errors. This paper formally defines complex decision support queries and their accuracy requirements, and provides algorithms that proportion the existing budget to optimally minimize privacy loss while supporting a bounded guarantee on the accuracy. Our experimental results on multiple real-life datasets show that our algorithms successfully maintain such utility guarantees, while also minimizing privacy loss.
Nada Lahjouji, Sameera Ghayyur, Xi He 0001, Sharad Mehrotra
CCS1