Demo Data from EDBT 2026 / reviewers in the wild / expert
Dominic Mazzoni
dblp:98/5435
· DBLP profile ↗
8ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 6 · 1 first-authorArtificial intelligence and machine learning · 3
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.
| Theoretical computer science
2 papers |
Algorithms and data structures · 54% Mathematical optimization · 46% | |
| Artificial intelligence
3 papers |
Learning theory · 50% Kernel, tree and ensemble methods · 34% Image recognition and object detection · 16% | |
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 100% |
Topics — the 8 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization
continuous optimization |
0.1 | 1 | 2006 | Multiclass reduced-set support vector machines · ICML 2006 |
Algorithms and data structures
kernel methods |
0.1 | 1 | 2006 | Multiclass reduced-set support vector machines · ICML 2006 |
Mathematical optimization
support vector machine |
0.1 | 1 | 2006 | Multiclass reduced-set support vector machines · ICML 2006 |
Machine learning › Learning theory › classification › nonlinear classification
kernel-based classification |
0.0 | 1 | 2003 | Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors · ICML 2003 |
Machine learning › Kernel, tree and ensemble methods
support vector machine |
0.0 | 1 | 2003 | Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors · ICML 2003 |
Algorithms and data structures › similarity search › nearest neighbor search
approximate nearest neighbor search |
0.0 | 1 | 2003 | Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors · ICML 2003 |
Algorithms and data structures › similarity search
nearest neighbor search |
0.0 | 1 | 2003 | Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors · ICML 2003 |
Computer vision › Image recognition and object detection › hyperspectral image analysis
hyperspectral image classification |
0.0 | 1 | 2006 | Onboard classifiers for science event detection on a remote sensing spacecraft · KDD 2006 |
Methods — techniques the papers use, named apart from their topics
thresholded band ratios · 0.1support vector machine · 0.1differential evolution · 0.1decision tree · 0.1SVM objective optimization · 0.1query optimization · 0.1incremental learning · 0.1reduced-set methods · 0.1reduced set method · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Progressive refinement for support vector machines
Kiri Wagstaff, Michael Kocurek, Dominic Mazzoni, Benyang Tang |
Data Min. Knowl. Discov. | 3 |
| 2006 | Active Learning with Irrelevant Examples
Dominic Mazzoni, Kiri Wagstaff, Michael C. Burl |
ECML | 1 |
| 2006 | Multiclass reduced-set support vector machinesabstractThere are well-established methods for reducing the number of support vectors in a trained binary support vector machine, often with minimal impact on accuracy. We show how reduced-set methods can be applied to multiclass SVMs made up of several binary SVMs, with significantly better results than reducing each binary SVM independently. Our approach is based on Burges' approach that constructs each reduced-set vector as the pre-image of a vector in kernel space, but we extend this by recomputing the SVM weights and bias optimally using the original SVM objective function. This leads to greater accuracy for a binary reduced-set SVM, and also allows vectors to be "shared" between multiple binary SVMs for greater multiclass accuracy with fewer reduced-set vectors. We also propose computing pre-images using differential evolution, which we have found to be more robust than gradient descent alone. We show experimental results on a variety of problems and find that this new approach is consistently better than previous multiclass reduced-set methods, sometimes with a dramatic difference. Benyang Tang, Dominic Mazzoni |
ICML | 2 |
| 2006 | Onboard classifiers for science event detection on a remote sensing spacecraftabstractTypically, data collected by a spacecraft is downlinked to Earth and pre-processed before any analysis is performed. We have developed classifiers that can be used onboard a spacecraft to identify high priority data for downlink to Earth, providing a method for maximizing the use of a potentially bandwidth limited downlink channel. Onboard analysis can also enable rapid reaction to dynamic events, such as flooding, volcanic eruptions or sea ice break-up. Four classifiers were developed to identify cryosphere events using hyperspectral images. These classifiers include a manually constructed classifier, a Support Vector Machine (SVM), a Decision Tree and a classifier derived by searching over combinations of thresholded band ratios. Each of the classifiers was designed to run in the computationally constrained operating environment of the spacecraft. A set of scenes was hand-labeled to provide training and testing data. Performance results on the test data indicate that the SVM and manual classifiers outperformed the Decision Tree and band-ratio classifiers with the SVM yielding slightly better classifications than the manual classifier. The manual and SVM classifiers have been uploaded to the EO-1 spacecraft and have been running onboard the spacecraft for over a year. Results of the onboard analysis are used by the Autonomous Sciencecraft Experiment (ASE) of NASA’s New Millennium Program onboard EO-1 to automatically target the spacecraft to collect follow-on imagery. The software demonstrates the potential for future deep space missions to use onboard decision making to capture short-lived science events. Rebecca Castaño, Dominic Mazzoni, Nghia Tang, Ronald Greeley, Thomas Doggett, Benjamin Cichy, Steve A. Chien, Ashley Davies |
KDD | 2 |
| 2006 | Automated Knowledge Discovery from SimulatorsabstractIn this paper, we explore one aspect of knowledge discovery from simulators, the landscape characterization problem, where the aim is to identify regions in the input/parameter/model space that lead to a particular output behavior. Large-scale numerical simulators are in widespread use by scientists and engineers across a range of government agencies, academia, and industry; in many cases, simulators provide the only means to examine processes that are infeasible or impossible to study otherwise. However, the cost of simulation studies can be quite high, both in terms of the time and computational resources required to conduct the trials and the manpower needed to sift through the resulting output. Thus, there is strong motivation to develop automated methods that enable more efficient knowledge extraction. Unlike traditional data mining, knowledge discovery from simulators is not limited to a static, pre-determined dataset; instead, the simulator itself can be used as an oracle to generate new data of our own choosing. We exploit this opportunity by employing active learning and support vector machines (SVMs) to choose which are the most valuable simulation trials to run next. On two realworld scientific simulators, one for asteroid collisions and one for magnetospheric modeling, we demonstrate twofold and sixfold reductions, respectively, in the number of simulator trials required to achieve a particular level of fidelity in landscape characterization as compared with a standard grid-based sampling approach. Michael C. Burl, Dennis DeCoste, Brian L. Enke, Dominic Mazzoni, William J. Merline, Lucas Scharenbroich |
SDM | 4 |
| 2006 | A Demonstration of the SciFlo Grid Workflow EngineabstractSciFlo is a system for Scientific Knowledge Creation on the Grid using a Semantically-Enabled Dataflow Execution Environment. SciFlo leverages Simple Object Access Protocol (SOAP) Web Services and the Grid Computing standards (WS-* & Globus Alliance toolkits), and enables scientists to do multi-instrument Earth Science by assembling reusable Web Services and native executables into a distributed computing flow (operator graph). SciFlo’s XML dataflow documents can be a mixture of concrete operators (fully bound operations) and abstract template operators (late binding via semantic lookup). All data objects and operators can be both simply typed (simple and complex types in XML schema) and semantically typed (linked to OWL ontologies). We will demonstrate a version of the SciFlo workflow engine executing a variety of workflow documents. [Note: This document is a quick description of the proposed demo, not a fully referenced and defended paper.] Brian D. Wilson, Gerald Manipon, Dominic Mazzoni, Benyang Tang, Thomas P. Yunck |
SSDBM | 3 |
| 2005 | GENESIS SciFlo: Scientific Knowledge Creation on the Grid using a Semantically-Enabled Dataflow Execution Environment
Brian D. Wilson, Benyang Tang, Gerald Manipon, Dominic Mazzoni, Eric J. Fetzer, Annmarie Eldering, Amy Braverman, Elaine R. Dobinson, Thomas P. Yunck |
SSDBM | 4 |
| 2003 | Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors
Dennis DeCoste, Dominic Mazzoni |
ICML | 2 |