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

Adrian Becker

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

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

Artificial intelligence and machine learning · 2Systems, architecture and hardware · 1 · 1 since 2021Databases, 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
Data mining · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › predictive modeling
classification
0.112005
Handling Generalized Cost Functions in the Partitioning Optimization Problem through Sequential Binary Programming · ICDM 2005
Data mining › predictive modeling › classification › cost-sensitive learning
cost-sensitive classification
0.112005
Handling Generalized Cost Functions in the Partitioning Optimization Problem through Sequential Binary Programming · ICDM 2005
Mathematical optimization › integer programming
binary optimization
0.112005
Handling Generalized Cost Functions in the Partitioning Optimization Problem through Sequential Binary Programming · ICDM 2005
Mathematical optimization
discrete optimization
0.112005
Handling Generalized Cost Functions in the Partitioning Optimization Problem through Sequential Binary Programming · ICDM 2005

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

sequential binary programming · 0.1decision trees · 0.1decision tree · 0.1
YearPublicationVenuePosition
2024 Deep Learning Method for Doppler Disambiguation
abstract
Velocities measured by radar sensors suffer from ambiguities caused by aliasing effects associated with signal processing. These ambiguities are highly undesired as they affect otherwise very accurate speed measurements. For automotive applications utilizing radar sensors, this means that measured velocities are potentially unreliable which can lead to unsafe conditions for automated driving functionalities. This work presents the first approach to disambiguate radial velocities measured by radar sensors based on Deep Learning methods. By utilizing the presented method, radial velocity estimates can be obtained which are both highly accurate while being reliable as ambiguities are resolved.
Marco Braun, Adrian Becker, Mirko Meuter, Simon Roesler, Kevin Kollek, Anton Kummert
ISCAS2
2009 Inducing a marketing strategy for a new pet insurance company using decision trees
Alan S. Abrahams, Adrian Becker, Daniel Sabido, Rosskyn D'Souza, George Makriyiannis, Michal Krasnodebski
Expert Syst. Appl.2
2005 Handling Generalized Cost Functions in the Partitioning Optimization Problem through Sequential Binary Programming
abstract
This paper proposes a framework for cost-sensitive classification under a generalized cost function. By combining decision trees with sequential binary programming, we can handle unequal misclassification costs, constrained classification, and complex objective functions that other methods cannot. Our approach has two main contributions. First, it provides a new method for cost-sensitive classification that outperforms a traditional, accuracy-based method and some current cost-sensitive approaches. Second, and more important, our approach can handle a generalized cost function, instead of the simpler misclassification cost matrix to which other approaches are limited.
Alan S. Abrahams, Adrian Becker, Daniel Fleder, Ian C. MacMillan
ICDM2