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

Markus Wawryniuk

dblp:03/6137 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

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

Databases, data management, data science and information retrieval · 3Artificial intelligence and machine learning · 1Graphics, 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
3 papers
Data mining · 100%
Computer graphics and multimedia
2 papers
Visualization and visual analytics · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.132003
Analyzing High-Dimensional Data by Subspace Validity · ICDM 2003
HD-Eye - Visual Clustering of High dimensional Data · ICDE 2003
HD-Eye: visual clustering of high dimensional data · SIGMOD Conference 2002
Data mining › clustering
high-dimensional clustering
0.122003
HD-Eye - Visual Clustering of High dimensional Data · ICDE 2003
HD-Eye: visual clustering of high dimensional data · SIGMOD Conference 2002
Visualization and visual analytics › clustering
visual cluster analysis
0.022003
HD-Eye: visual clustering of high dimensional data · SIGMOD Conference 2002
HD-Eye - Visual Clustering of High dimensional Data · ICDE 2003
Data mining
high-dimensional data analysis
0.012003
Analyzing High-Dimensional Data by Subspace Validity · ICDM 2003
Data mining › clustering › high-dimensional clustering
subspace clustering
0.012003
Analyzing High-Dimensional Data by Subspace Validity · ICDM 2003
Data mining › clustering
interactive clustering
0.012002
HD-Eye: visual clustering of high dimensional data · SIGMOD Conference 2002

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

statistical testing · 0.0projected clustering · 0.0
YearPublicationVenuePosition
2004 Multiresolution similarity search in image databases
Martin Heczko, Alexander Hinneburg, Daniel A. Keim, Markus Wawryniuk
Multim. Syst.4
2003 HD-Eye - Visual Clustering of High dimensional Data
abstract
Clustering of large databases is an important research area with a large variety of applications in the data base context. Missing in most of the research efforts are means for guiding the clustering process and understand the results, which is especially important if the data under consideration is high dimensional and has not been collected for the purpose of being analyzed. Visualization technology may help to solve this problem since it allows an effective support of different clustering paradigms and provides means for a visual inspection of the results. Our HD-Eye (high-dimensional eye) system (A. Hinneburg et al., 1999) shows that a tight integration of advanced clustering algorithms and state-of-the-art visualization techniques is powerful for a better understanding and effective guidance of the clustering process, and therefore can help to significantly improve the clustering results. The demonstration shows how the user can visually explore the data by focusing on interesting projections and guide the important steps of the clustering process. Due to its interactive nature, the HD-Eye system allows a combination of multiple clustering paradigms, leading to clustering models, which fit, well to the intended tasks and the users interests. In addition, the integrated data visualization capabilities of the HD-Eye system lead to a better understanding of the clustering results. The applications to be demonstrated include clustering of large image as well as molecular biology databases.
Alexander Hinneburg, Daniel A. Keim, Markus Wawryniuk
ICDE3
2003 Analyzing High-Dimensional Data by Subspace Validity
abstract
We are proposing a novel method that makes it possible to analyze high-dimensional data with arbitrary shaped projected clusters and high noise levels. At the core of our method lies the idea of subspace validity. We map the data in a way that allows us to test the quality of subspaces using statistical tests. Experimental results, both on synthetic and real data sets, demonstrate the potential of our method.
Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, Daniel A. Keim, Markus Wawryniuk
ICDM5
2002 HD-Eye: visual clustering of high dimensional data
abstract
Clustering of large data bases is an important research area with a large variety of applications in the data base context.Missing in most of the research efforts are means for guiding the clustering process and understanding the results, which is especially important for high dimensional data.Visualization technology may help to solve this problem since it provides effective support of different clustering paradigms and allows a visual inspection of the results.The HD-Eye (high-dim.eye) system shows that a tight integration of advanced clustering algorithms and state-of-the-art visualization techniques is powerful for a better understanding and effective guidance of the clustering process, and therefore can help to significantly improve the clustering results.
Alexander Hinneburg, Daniel A. Keim, Markus Wawryniuk
SIGMOD Conference3