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.

Enhui Huang

dblp:227/9535 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2024
0000-0002-6901-0587ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2 · 2 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
2 papers
Query processing and optimization · 59% Machine learning and data management · 32% Data mining · 10%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
interactive data exploration
1.122024
Efficient and robust active learning methods for interactive database exploration · VLDB J. 2024
Optimization for Active Learning-based Interactive Database Exploration · Proc. VLDB Endow. 2018
Machine learning and data management
active learning
0.812024
Efficient and robust active learning methods for interactive database exploration · VLDB J. 2024
Query processing and optimization
query optimization
0.312018
Optimization for Active Learning-based Interactive Database Exploration · Proc. VLDB Endow. 2018
Data mining
exploratory data analysis
0.212024
Efficient and robust active learning methods for interactive database exploration · VLDB J. 2024

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

active learning · 1.1
YearPublicationVenuePosition
2024 Efficient and robust active learning methods for interactive database exploration
Enhui Huang, Yanlei Diao, Anna Liu, Liping Peng, Luciano Di Palma
VLDB J.1
2018 Optimization for Active Learning-based Interactive Database Exploration
abstract
There is an increasing gap between fast growth of data and limited human ability to comprehend data. Consequently, there has been a growing demand of data management tools that can bridge this gap and help the user retrieve high-value content from data more effectively. In this work, we aim to build interactive data exploration as a new database service, using an approach called "explore-by-example". In particular, we cast the explore-by-example problem in a principled "active learning" framework, and bring the properties of important classes of database queries to bear on the design of new algorithms and optimizations for active learning-based database exploration. These new techniques allow the database system to overcome a fundamental limitation of traditional active learning, i.e., the slow convergence problem. Evaluation results using real-world datasets and user interest patterns show that our new system significantly outperforms state-of-the-art active learning techniques and data exploration systems in accuracy while achieving desired efficiency for interactive performance.
Enhui Huang, Liping Peng, Luciano Di Palma, Ahmed Abdelkafi, Anna Liu, Yanlei Diao
Proc. VLDB Endow.1