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

Yvonne Mülle

dblp:117/8839 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 1 first-authorArtificial intelligence and machine learning · 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
2 papers
Spatial and temporal data management · 60% Data mining · 40%

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

TopicWeightPapersLastEvidence papers
Spatial and temporal data management
temporal databases
0.412020
Query Results over Ongoing Databases that Remain Valid as Time Passes By · ICDE 2020
Spatial and temporal data management
temporal query processing
0.412020
Query Results over Ongoing Databases that Remain Valid as Time Passes By · ICDE 2020
Data mining
anomaly detection
0.112012
Outlier Ranking via Subspace Analysis in Multiple Views of the Data · ICDM 2012
Data mining
clustering
0.112012
Outlier Ranking via Subspace Analysis in Multiple Views of the Data · ICDM 2012
Data mining › anomaly detection › outlier detection
outlier ranking
0.112012
Outlier Ranking via Subspace Analysis in Multiple Views of the Data · ICDM 2012
Data mining › clustering › high-dimensional clustering
subspace clustering
0.112012
Outlier Ranking via Subspace Analysis in Multiple Views of the Data · ICDM 2012

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

predicate evaluation at reference times · 0.4subspace analysis · 0.1clustered region comparison · 0.1
YearPublicationVenuePosition
2020 Query Results over Ongoing Databases that Remain Valid as Time Passes By
abstract
Ongoing time point now is used to state that a tuple is valid from the start point onward. For database systems ongoing time points have far-reaching implications since they change continuously as time passes by. State-of-the-art approaches deal with ongoing time points by instantiating them to the reference time. The instantiation yields query results that are only valid at the chosen time and get invalidated as time passes by. We propose a solution that keeps ongoing time points uninstantiated during query processing. We do so by evaluating predicates and functions at all possible reference times. This renders query results independent of a specific reference time and yields results that remain valid as time passes by. As query results, we propose ongoing relations that include a reference time attribute. The value of the reference time attribute is restricted by predicates and functions on ongoing attributes. We describe and evaluate an efficient implementation of ongoing data types and operations in PostgreSQL.
Yvonne Mülle, Michael H. Böhlen
ICDE1
2012 Outlier Ranking via Subspace Analysis in Multiple Views of the Data
abstract
Outlier mining is an important task for finding anomalous objects. In practice, however, there is not always a clear distinction between outliers and regular objects as objects have different roles w.r.t. different attribute sets. An object may deviate in one subspace, i.e. a subset of attributes. And the same object might appear perfectly regular in other subspaces. One can think of subspaces as multiple views on one database. Traditional methods consider only one view (the full attribute space). Thus, they miss complex outliers that are hidden in multiple subspaces. In this work, we propose Outrank, a novel outlier ranking concept. Outrank exploits subspace analysis to determine the degree of outlierness. It considers different subsets of the attributes as individual outlier properties. It compares clustered regions in arbitrary subspaces and derives an outlierness score for each object. Its principled integration of multiple views into an outlierness measure uncovers outliers that are not detectable in the full attribute space. Our experimental evaluation demonstrates that Outrank successfully determines a high quality outlier ranking, and outperforms state-of-the-art outlierness measures.
Emmanuel Müller, Ira Assent, Patricia Iglesias Sánchez, Yvonne Mülle, Klemens Böhm
ICDM4