Jewels, Himalayas and Fireworks, Extending Methods for

Slides:



Advertisements
Similar presentations
Principal Component Analysis (PCA) for Clustering Gene Expression Data K. Y. Yeung and W. L. Ruzzo.
Advertisements

Three Dimensional Modeling Transformations
Scalability with many lights II (row-column sampling, visibity clustering) Miloš Hašan.
Mapping Nominal Values to Numbers for Effective Visualization Presented by Matthew O. Ward Geraldine Rosario, Elke Rundensteiner, David Brown, Matthew.
Informationsteknologi Monday, October 29, 2007Computer Graphics - Class 21 Today’s class Graphics programming Color.
Principal Component Analysis (PCA) for Clustering Gene Expression Data K. Y. Yeung and W. L. Ruzzo.
The Tutorial of Principal Component Analysis, Hierarchical Clustering, and Multidimensional Scaling Wenshan Wang.
Exploratory Data Analysis. Computing Science, University of Aberdeen2 Introduction Applying data mining (InfoVis as well) techniques requires gaining.
PATTERN RECOGNITION AND MACHINE LEARNING
Preparing Data for Analysis and Analyzing Spatial Data/ Geoprocessing Class 11 GISG 110.
Mathematical Processes GLE  I can recognize which symbol correlates with the correct term.  I can recall the correct definition for each mathematical.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
IDL GUI for Digital Halftoning Final Project for SIMG-726 Computing For Imaging Science Changmeng Liu
Artificial Neural Network Theory and Application Ashish Venugopal Sriram Gollapalli Ulas Bardak.
Windows Programming Parallel Coordinates Adithya Addanki(aa207) Instructor: Dr. Yingcai Xiao.
Partitioning – A Uniform Model for Data Mining Anne Denton, Qin Ding, William Jockheck, Qiang Ding and William Perrizo.
Acute angle An angle with a measure less than 90 degrees.
Summer Student Program 15 August 2007 Cluster visualization using parallel coordinates representation Bastien Dalla Piazza Supervisor: Olivier Couet.
Semantic Wordfication of Document Collections Presenter: Yingyu Wu.
Applied Quantitative Analysis and Practices
VisDB: Database Exploration Using Multidimensional Visualization Maithili Narasimha 4/24/2001.
Intelligent Database Systems Lab N.Y.U.S.T. I. M. Externally growing self-organizing maps and its application to database visualization and exploration.
VizDB A tool to support Exploration of large databases By using Human Visual System To analyze mid-size to large data.
CATA 2010 March 2010 Jewels, Himalayas and Fireworks, Extending Methods for Visualizing N Dimensional Clustering W. Jockheck Dept. of Computer Science.
Subject Name: Computer Graphics Subject Code: Textbook: “Computer Graphics”, C Version By Hearn and Baker Credits: 6 1.
12/24/2015 A.Aruna/Assistant professor/IT/SNSCE 1.
CS COMPUTER GRAPHICS LABORATORY. LIST OF EXPERIMENTS 1.Implementation of Bresenhams Algorithm – Line, Circle, Ellipse. 2.Implementation of Line,
3/13/2016 Data Mining 1 Lecture 2-1 Data Exploration: Understanding Data Phayung Meesad, Ph.D. King Mongkut’s University of Technology North Bangkok (KMUTNB)
Clustering Microarray Data based on Density and Shared Nearest Neighbor Measure CATA’06, March 23-25, 2006 Seattle, WA, USA Ranapratap Syamala, Taufik.
Principal Components Analysis ( PCA)
M. MASTAK AL AMIN The summary Table A summary table indicates the frequency, amount or percentage of items in a set of categories so that you can see differences.
Extension of Star Coordinates into Three Dimensions Nathan Cooprider University of Utah School of Computing Robert Burton Brigham Young.
Another Example: Circle Detection
Drawing Geometric Objects
CSSE463: Image Recognition Day 27
Charts & Graphs CTEC V
Finite state machine optimization
Finite state machine optimization
Computer Graphics CC416 Week 15 3D Graphics.
Background on Classification
Spatial analysis Measurements - Points: centroid, clustering, density
Principal Component Analysis (PCA)
Data Preparation for Deep Learning
William Norris Professor and Head, Department of Computer Science
Principal Component Analysis
Jianping Fan Dept of CS UNC-Charlotte
Organizing and Visualizing Variables
Overview Identify similarities present in biological sequences and present them in a comprehensible manner to the biologists Objective Capturing Similarity.
Copyright © 2014 John Wiley & Sons, Inc. All rights reserved.
Domain-Modeling Techniques
Three Dimensional Viewing
Introduction to Perception and Color
CSC4820/6820 Computer Graphics Algorithms Ying Zhu Georgia State University Transformations.
William Norris Professor and Head, Department of Computer Science
Geometric Hashing: An Overview
Computation & Estimation
Star Coordinates A Multi-dimensional Visualization Technique with Uniform Treatment of Dimensions.
Capabilities of Threshold Neurons
CSSE463: Image Recognition Day 25
Lecture 4 - Monte Carlo improvements via variance reduction techniques: antithetic sampling Antithetic variates: for any one path obtained by a gaussian.
Jewels, Himalayas and Fireworks, Extending Methods for
Taufik Abidin and William Perrizo
Quantitative Data Who? Cans of cola. What? Weight (g) of contents.
Computer Vision Lecture 19: Object Recognition III
Math review - scalars, vectors, and matrices
Displaying data Seminar 2.
Objective- To graph a relationship in a table.
Visual Algebra for Teachers
Star Coordinates : A Multi-dimensional Visualization Technique with Uniform Treatment of Dimensions Rohit Kelapure & David Tussedorf.
Data exploration and visualization
Presentation transcript:

Jewels, Himalayas and Fireworks, Extending Methods for Visualizing N Dimensional Clustering W. Jockheck Dept. of Computer Science North Dakota State University Fargo, North Dakota 58105 William.Jockheck@ndsu.nodak.edu Dr. William Perrizo William.Perrizo@ndsu.nodak.edu CATA 2010 March 2010

Overview Visualization of high dimensional data is awkward and in some cases leads to incorrect conclusions. The human mind is the most sophisticated and effective pattern recognition device available for two-dimensional (or three-dimensional) patterns. This paper considers “pattern preserving” (cluster preserving) transformations of high dimensional data into two dimensional space. The techniques enable quick visual scans which can yield significant amounts of pattern related information. Then other methods can be used for further drill down. CATA 2010 March 2010

Visualizing N Dimensional Clustering Chernoff's faces Parallel Coordinates Jewel Diagram CATA 2010 March 2010

Table Columns as Dimensions A table of n numeric columns can be considered as a set of points in n dimensional space (e.g., the 1st 4 IRIS columns). CATA 2010 March 2010

Projecting Hypercube into 2D When projecting an arbitrary vector is used for each dimensional axis. Five dimensional hypercube using the axis indicated. CATA 2010 March 2010

Jewel Diagram and Projections The single combined points in the jewel diagram represent an n-dimensional projection using the sides of the polygon as the axis of the dimensions. CATA 2010 March 2010

Jewel Diagram Revisited Other methods of projecting points Variations on parallel coordinates Himalayan variation A1 A5 CATA 2010 March 2010

Jewel Diagram Revisited Himalayan and odd sided polygon versions CATA 2010 March 2010

Adjustments and Fixes Variations on the arrangement and directionality of the axis were explored. In some variations pairs of attributes off set each other. Generally, parallel or similar axis were found to minimize visibility of differences. This lead to placing all axis in a single quadrant (so that they don’t cancel out each other’s effects). CATA 2010 March 2010

Single Quadrant Variations Uniform Axis Spacing Himalayan Axis Spacing CATA 2010 March 2010

Fireworks CATA 2010 March 2010

Injection of Noise To test the sensitivity to noise, additional attributes were added to the iris data that were random. In addition various method of favoring and arranging attributes were tested. CATA 2010 March 2010

Variations with Weighting and Noise Iris data With Noise All Weighted CATA 2010 March 2010

X Why not 3D instead of 2D VRML version was a “3D” implementation with samples slightly offset in the Z axis. 2D rant Humans only see in 2D. The retina, while curved only captures a 2D projection. Computer displays are 2D. Printed outputs are 2D. VRML only allows the modification of the projection into 2D. CATA 2010 March 2010

Problems As n increases Sequence attributes (sides /axes) Jewel diagram polygon approaches a circle. Fireworks axes become indistinguishable. Projected points tend to overlap and obscure. Possibility of coincident points increases. Sequence attributes (sides /axes) Alter projected point distribution. Convey different information. CATA 2010 March 2010

Problem Mitigation The reality of points and lines. Point has no dimensions, only location. Lines have no width. The reality of displays. Points have to have dimension to be visible. Lines have to have width to be visible. Scaling as a solution. CATA 2010 March 2010

Contribution of the Visualization Single projected point represents sample showing its relationship in the data set. Provides display of each attribute distribution. Provides visual input, full picture for the user. CATA 2010 March 2010

Summary Jewel / Fireworks Visualization of Dimensions beyond 3 Provides a single point projection for each sample (tuple). Computationally simple Very modifiable and adaptable Colors, sequences, weighting, scaling CATA 2010 March 2010

Jewels, Himalayas and Fireworks, Extending Methods for Visualizing N Dimensional Clustering W. Jockheck Dept. of Computer Science North Dakota State University Fargo, North Dakota 58105 William.Jockheck@ndsu.nodak.edu Dr. William Perrizo William.Perrizo@ndsu.nodak.edu CATA 2010 March 2010