Demo Data from EDBT 2026 / reviewers in the wild / expert
Edward Haslam
dblp:06/6491
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1
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 |
Query processing and optimization · 87% Data integration and cleaning · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization
aggregate query processing |
0.0 | 1 | 1998 | Redbrick Vista: Aggregate Computation and Management · ICDE 1998 |
Query processing and optimization
precomputation |
0.0 | 1 | 1998 | Redbrick Vista: Aggregate Computation and Management · ICDE 1998 |
Data integration and cleaning
data warehouse |
0.0 | 1 | 1998 | Redbrick Vista: Aggregate Computation and Management · ICDE 1998 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Further investigation on genetic programming with transfer learning for symbolic regressionabstractTransfer learning is an important approach in machine learning, which aims to solve a problem by utilising the knowledge learnt from another problem domain. There has been extensive research and great achievement on transfer learning for image analysis and other tasks, but research on transfer learning in genetic programming (GP) for symbolic regression is still in the very early stage. However, GP has a natural way of expressing knowledge by trees or subtrees, which can be automatically discovered during the evolutionary process. An initial work on GP with transfer learning was proposed to transfer knowledge through best trees or subtrees from to source domain to facilitate the learning in the target domain. However, there are still a number of important issues remaining not investigated. This paper further investigates the ability of GP with transfer learning on different types of transfer scenarios, investigates the influence of a key parameter and the effect of transfer learning on the evolutionary training process, and also analyses how the knowledge learnt from the source domain was utilised during the learning process on the target domain. The results show that GP with transfer learning can generally perform well on different types of transfer scenarios. The transferred knowledge can provide a good initial population for the GP learning on the target domain, speed up the convergence, and help obtain better final solutions. However, the benefits of transfer learning varies in different scenarios. Edward Haslam, Bing Xue 0001, Mengjie Zhang 0001 |
CEC | 1 |
| 1998 | Redbrick Vista: Aggregate Computation and ManagementabstractAggregate query processing in large data warehouses is computationally intensive. Precomputation is an approach that can be used to speed up aggregate queries. However, in order to make precomputation a truly viable solution to the aggregate query processing problem, it is important to identify the best set of aggregates to precompute and to use these precomputed aggregates effectively. The Red Brick aggregate computation and management system (Red Brick Vista) provides a complete server integrated solution to these problems. Latha S. Colby, Richard L. Cole, Edward Haslam, Nasi Jazayeri, Galt Johnson, William J. McKenna, Lee Schumacher, David Wilhite |
ICDE | 3 |