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

Philip Driessen

dblp:07/8693 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

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

Databases, data management, data science and information retrieval · 2Graphics, computer vision, multimedia, augmented reality and games · 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
Indexing and storage engines · 100%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
metric space indexing
0.112010
Index support for content-based multimedia exploration · ACM Multimedia 2010
Indexing and storage engines
multidimensional indexing
0.112010
Index support for content-based multimedia exploration · ACM Multimedia 2010
Multimedia analysis and retrieval › multimedia retrieval › content-based retrieval
content-based multimedia retrieval
0.112010
Index support for content-based multimedia exploration · ACM Multimedia 2010

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

similarity search · 0.2
YearPublicationVenuePosition
2014 Inverse predictions on continuous models in scientific databases
abstract
Using continuous models in scientific databases has received an increased attention in the last years. It allows for a more efficient and accurate querying, as well as predictions of the outputs even where no measurements were performed. The most common queries are on how the output looks like for a given input setting. In this paper we study inverse model-based queries on continuous models, where one specifies a desired output and searches for the appropriate input setting, which falls into the reverse engineering category. We propose two possible approaches. The first one is an extension of the inverse regression paradigm. But simply switching the roles of input and output variables poses new challenges, which we overcome by using partial least squares. The second approach formulates the inverse prediction queries as linear optimization problems. We show that even though these two approaches seem completely different, they are closely related, and that the latter is more general. It facilitates the formulation of a wide range of queries, with specifications of fixed values and ranges in both input and output space, enabling the intuitive exploration of the experimental data and understanding the underlying process.
Anca Maria Zimmer, Philip Driessen, Philipp Kranen, Thomas Seidl 0001
SSDBM2
2012 PA-Miner: Process Analysis Using Retrieval, Modeling, and Prediction
Anca Maria Zimmer, Philipp Kranen, Manfred Smieschek, Philip Driessen, Thomas Seidl 0001
DASFAA (2)4
2010 Index support for content-based multimedia exploration
abstract
Content-based multimedia exploration systems support users in browsing and searching voluminous multimedia databases in an interactive and playful way. Guiding the user navigation and exploration process through the database contents, similarity-based layouts frequently serve as effective and intuitive user interfaces offering a multitude of easy-to-use query functionalities. In order to process queries arising in similarity-based layouts efficiently, we propose to support content-based exploration systems with index structures. For this purpose, we present a general approach which supports any kind of distance-based index structure. By evaluating our approach, we show that it improves the efficiency of content-based multimedia exploration.
Christian Beecks, Philip Driessen, Thomas Seidl 0001
ACM Multimedia2