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

Guang-Da Hu

dblp:10/8679 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2Computer networks · 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
1 paper
Data stream processing · 50% Query processing and optimization · 50%
Network and information security
1 paper
Privacy and data protection · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Data stream processing
evolving data
0.912025
Private and Effective Range Counting Query Over Evolving Data in Internet of Things · IEEE Trans. Mob. Comput. 2025
Query processing and optimization › secure query processing
privacy-preserving query processing
0.912025
Private and Effective Range Counting Query Over Evolving Data in Internet of Things · IEEE Trans. Mob. Comput. 2025
Privacy and data protection › differential privacy
local differential privacy
0.912025
Private and Effective Range Counting Query Over Evolving Data in Internet of Things · IEEE Trans. Mob. Comput. 2025
Privacy and data protection › statistical database privacy
range-count query answering
0.912025
Private and Effective Range Counting Query Over Evolving Data in Internet of Things · IEEE Trans. Mob. Comput. 2025
Internet of things and sensor networks
iot data analytics
0.312025
Private and Effective Range Counting Query Over Evolving Data in Internet of Things · IEEE Trans. Mob. Comput. 2025

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

local differential privacy · 2.6frequency oracle · 2.6adaptive interval merging · 2.6
YearPublicationVenuePosition
2025 Private and Effective Range Counting Query Over Evolving Data in Internet of Things
abstract
Range counting query is the fundamental task for data analysis and data mining in Internet of Things (IoT). However, it poses a threat to the data privacy of data contributors, which is exacerbated by evolving data in particular. Several studies focus on range counting query on a timestamp over the finite evolving data, and thus are not applicable to the longitudinal range counting query on the infinite evolving data. To this end, we propose thePrivate andEffectiveRange counting query overEvolving data (PERE) that supports both the finite evolving data and the infinite evolving data, and is applicable for both the range counting query on a specific timestamp and the longitudinal range counting query. Specifically, we first design a Private Infinite Update Framework for IoT evolving data while providing meaningful privacy protection. The framework is coupled with a general and practical data evolution paradigm. Then, we propose a Optimized Frequency Perturbation consisting of an enhanced frequency oracle protocol and random sampling attribute. On this basis, we further propose a novel Adaptive Interval Merging mechanism that dynamically considers all potential interval consolidation possibilities and the reasonable selection of intervals for merging, to balance non-uniform error and noise error. Thereafter, we further reduce the estimated error in query results by Frequency Adjustment that consists of Norm-Sub and weighted average process. Last, we theoretically prove that the proposed PERE satisfies Local Differential Privacy (LDP), that the query results of PERE are unbiased, and that the variance of the query results is desirable. Furthermore, the extensive experiments on multiple real-world and synthetic datasets validate the effectiveness of PERE, as well as its advantages over the state-of-the-art works in answering range counting queries of evolving data.
Ping Zhao 0001, Guang-Da Hu
IEEE Trans. Mob. Comput.2
2006 A New Sufficient Condition on the Complete Stability of a Class Cellular Neural Networks
Li-qun Zhou, Guang-Da Hu
ISNN (1)2
2004 A Novel Immune Feedback Control Algorithm and Its Applications
Zhen-qiang Qi, Shenmin Song, Zhao-hua Yang, Guang-Da Hu, Fu-en Zhang
GECCO (1)4