Motivation. A Botanically Inspired High- Dimensional Visualization with Multivariate Glyphs. Related Work
|
|
- Mae Cummings
- 5 years ago
- Views:
Transcription
1 A Botanically Inspired High- Dimensional Visualization with Multivariate Glyphs Eleanor Chlan & Penny Rheingans Motivation Small amounts of data are easy to represent Aggregation simplifies cognitive management New problem in understanding clusters Still need to understand data & relationships Need to compare data across hierarchy Need to handle high attribute data Need to discern variability and extent of data 1 2 Related Work Hierarchically oriented strategies Cone trees Treemaps[Shneiderman, 1992] Bubble Trees[Boardman, 2000] Cone trees[robertson,mackinlay,card, 1991] 1 Related Work [Kleiberg et. al. 2001] 1 Used by permission - Xerox PARC 3 4 1
2 The Data Set The Botanical Tree Model The The following examples are based on a census data set from the UC Irvine ML repository 30,000+ records 485 clusters Hierarchical clustering obtained through repetitive application of K-means 10 attributes: age, gender, marital status, etc. The Tree View The 5 Leaves The Tree View Builds tree using stochastic, parametric, Lsystem[Prusinkiewicz, et. al, 1990] Provides context Gives overview of dataset, facilitates navigation 6 Marital Status Dark Red (Married) to Green (Never Married) Probability to earn high salary: Dark red (very low probability) to Green Number of sub-clusters controls branching Relative cluster size controls diameter (high probability) 7 Hours worked per week Dark red (very few) to Green (very high) 8 2
3 Alternate Clustering Similarity Factors Leaf coloring is Marital Status Dark Red (Married) to Green (Never Married) Cluto [Karypis, et. al. 1999] 9 10 Based on the Stasko & Zhang Sunburst[2000] Shows the subtree starting at any node Successive rings (going outwards) reflect lower levels of the hierarchy (closer to leaves) Age Arc subtended by a node reflects its relative size All children of a node together subtend same degree of arc as the parent Leaf dividing lines omitted if degree of arc very small Color is average value of attribute Gender Education Marital Status Hours Worked Prob. High Salary
4 Simulates Shows wood cross-section one cluster All immediate subclusters as rings Reflects up to 5 attributes at one time Relative Leaf Occupation sizes reflects cluster sizes clusters have fixed ring sizes Hours worked Beech Cross Section Elliptical shape reflects quality High quality clusters - shorter minor axis - more oblate. Ring color reflects an attribute Bark reflects an attribute Max value --> thickness Min value --> height of troughs above wood Standard deviation --> width of bumps Average of attribute for entire data set --> color Photo by Thomas Siccama, Hubbard Brook Ecosystem Research Study, used with permission
5 Subcluster rings amended with Radial lines Dots Displays additional information Age - Ring and Bark color Age - Ring and Bark color Gender -Dots Gender -Dots Probability to earn high salary - Lines Probability to earn high salary - Lines 17 Summary and Conclusions Tree Thanks to The US Department of Defense The US National Science Foundation for their support High level overview Organizational context Simplifies assimilation of data View -medium level of detail Highlights strong clustering Branch George Karypis for making the Cluto code available And the authors who generously allowed use of their images View - high level of detail Shows extent and variability Direct comparison across children 18 Acknowledgements Metaphor - low level of detail Cluster
APPROVAL SHEET. Name of Candidate: Eleanor Boyle Chlan. Doctor of Philosophy, Dissertation and Abstract Approved:.
APPROVAL SHEET Title of Dissertation: Botanically Inspired Visualization: Exploring Hierarchical Data Sets with Extent and Variation Name of Candidate: Eleanor Boyle Chlan Doctor of Philosophy, 2005 Dissertation
More informationOptimal k-anonymity with Flexible Generalization Schemes through Bottom-up Searching
Optimal k-anonymity with Flexible Generalization Schemes through Bottom-up Searching Tiancheng Li Ninghui Li CERIAS and Department of Computer Science, Purdue University 250 N. University Street, West
More informationHierarchies and Trees 1 (Node-link) CS Information Visualization November 12, 2012 John Stasko
Topic Notes Hierarchies and Trees 1 (Node-link) CS 7450 - Information Visualization November 12, 2012 John Stasko Hierarchies Definition Data repository in which cases are related to subcases Can be thought
More informationHierarchies and Trees 1 (Node-link) CS 4460/ Information Visualization March 10, 2009 John Stasko
Hierarchies and Trees 1 (Node-link) CS 4460/7450 - Information Visualization March 10, 2009 John Stasko Hierarchies Definition Data repository in which cases are related to subcases Can be thought of as
More informationModule 4: Index Structures Lecture 13: Index structure. The Lecture Contains: Index structure. Binary search tree (BST) B-tree. B+-tree.
The Lecture Contains: Index structure Binary search tree (BST) B-tree B+-tree Order file:///c /Documents%20and%20Settings/iitkrana1/My%20Documents/Google%20Talk%20Received%20Files/ist_data/lecture13/13_1.htm[6/14/2012
More informationInformation Visualization. Jing Yang Spring Hierarchy and Tree Visualization
Information Visualization Jing Yang Spring 2008 1 Hierarchy and Tree Visualization 2 1 Hierarchies Definition An ordering of groups in which larger groups encompass sets of smaller groups. Data repository
More informationInteractive Visual Exploration
Interactive Visual Exploration of High Dimensional Datasets Jing Yang Spring 2010 1 Challenges of High Dimensional Datasets High dimensional datasets are common: digital libraries, bioinformatics, simulations,
More informationCSE 214 Computer Science II Introduction to Tree
CSE 214 Computer Science II Introduction to Tree Fall 2017 Stony Brook University Instructor: Shebuti Rayana shebuti.rayana@stonybrook.edu http://www3.cs.stonybrook.edu/~cse214/sec02/ Tree Tree is a non-linear
More informationLesson 3. Prof. Enza Messina
Lesson 3 Prof. Enza Messina Clustering techniques are generally classified into these classes: PARTITIONING ALGORITHMS Directly divides data points into some prespecified number of clusters without a hierarchical
More informationCS Information Visualization Sep. 2, 2015 John Stasko
Multivariate Visual Representations 2 CS 7450 - Information Visualization Sep. 2, 2015 John Stasko Recap We examined a number of techniques for projecting >2 variables (modest number of dimensions) down
More informationCourtesy of Prof. Shixia University
Courtesy of Prof. Shixia Liu @Tsinghua University Introduction Node-Link diagrams Space-Filling representation Hybrid methods Hierarchies often represented as trees Directed, acyclic graph Two main representation
More informationhierarchical techniques
Wolfgang Aigner aigner@ifs.tuwien.ac.at http://ieg.ifs.tuwien.ac.at/~aigner/ wolfgang.aigner@donau-uni.ac.at http://ike.donau-uni.ac.at/~aigner/ Version 1.0 10.11.2007 http://www.caida.org/tools/visualization/walrus/
More informationCS Information Visualization Sep. 19, 2016 John Stasko
Multivariate Visual Representations 2 CS 7450 - Information Visualization Sep. 19, 2016 John Stasko Learning Objectives Explain the concept of dense pixel/small glyph visualization techniques Describe
More informationCS 614 COMPUTER ARCHITECTURE II FALL 2005
CS 614 COMPUTER ARCHITECTURE II FALL 2005 DUE : November 23, 2005 HOMEWORK IV READ : i) Related portions of Chapters : 3, 10, 15, 17 and 18 of the Sima book and ii) Chapter 8 of the Hennessy book. ASSIGNMENT:
More informationVisual Hierarchical Dimension Reduction
Visual Hierarchical Dimension Reduction by Jing Yang A Thesis Submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE In partial fulfillment of the requirements for the Degree of Master of Science
More informationDesktop Studio: Charts. Version: 7.3
Desktop Studio: Charts Version: 7.3 Copyright 2015 Intellicus Technologies This document and its content is copyrighted material of Intellicus Technologies. The content may not be copied or derived from,
More informationCS570: Introduction to Data Mining
CS570: Introduction to Data Mining Scalable Clustering Methods: BIRCH and Others Reading: Chapter 10.3 Han, Chapter 9.5 Tan Cengiz Gunay, Ph.D. Slides courtesy of Li Xiong, Ph.D., 2011 Han, Kamber & Pei.
More informationDesktop Studio: Charts
Desktop Studio: Charts Intellicus Enterprise Reporting and BI Platform Intellicus Technologies info@intellicus.com www.intellicus.com Working with Charts i Copyright 2011 Intellicus Technologies This document
More informationUnit #13 : Integration to Find Areas and Volumes, Volumes of Revolution
Unit #13 : Integration to Find Areas and Volumes, Volumes of Revolution Goals: Beabletoapplyaslicingapproachtoconstructintegralsforareasandvolumes. Be able to visualize surfaces generated by rotating functions
More informationUninformed Search Methods. Informed Search Methods. Midterm Exam 3/13/18. Thursday, March 15, 7:30 9:30 p.m. room 125 Ag Hall
Midterm Exam Thursday, March 15, 7:30 9:30 p.m. room 125 Ag Hall Covers topics through Decision Trees and Random Forests (does not include constraint satisfaction) Closed book 8.5 x 11 sheet with notes
More informationCh. 1.4 Histograms & Stem-&-Leaf Plots
Ch. 1.4 Histograms & Stem-&-Leaf Plots Learning Intentions: Create a histogram & stem-&-leaf plot of a data set. Given a list of data, use a calculator to graph a histogram. Interpret histograms & stem-&-leaf
More informationCluster Analysis. Ying Shen, SSE, Tongji University
Cluster Analysis Ying Shen, SSE, Tongji University Cluster analysis Cluster analysis groups data objects based only on the attributes in the data. The main objective is that The objects within a group
More informationInformation Visualization. Jing Yang Fall Hierarchy and Tree Visualization
Information Visualization Jing Yang Fall 2007 1 Hierarchy and Tree Visualization 2 1 Hierarchies Definition An ordering of groups in which larger groups encompass sets of smaller groups. Data repository
More informationObject Basics. Overview. Ellipse Command. Continued... X Commands. X System Variables
Object Basics Continued... Object Basics 1 Overview X Commands T ARC (Command) T CIRCLE (Command) T DONUT (Command) T ELLIPSE (Command) T HELIX (Command) T PLINE (Command) T SPLINE (Command) T BLEND (Command)
More informationData Visualization. Fall 2016
Data Visualization Fall 2016 Information Visualization Upon now, we dealt with scientific visualization (scivis) Scivisincludes visualization of physical simulations, engineering, medical imaging, Earth
More informationOrdering and Ranking Multivariate Data
Ordering and Ranking Multivariate Data The concept of order or rank within a multivariate dataset can be quite complicated. How would you rank these data: 1 Obs. Number x 1 x 2 1 10 66 2 19 52 3 8 88 4
More informationRINGS : A Technique for Visualizing Large Hierarchies
RINGS : A Technique for Visualizing Large Hierarchies Soon Tee Teoh and Kwan-Liu Ma Computer Science Department, University of California, Davis {teoh, ma}@cs.ucdavis.edu Abstract. We present RINGS, a
More informationData Science Essentials
Data Science Essentials Lab 6 Introduction to Machine Learning Overview In this lab, you will use Azure Machine Learning to train, evaluate, and publish a classification model, a regression model, and
More informationBumptrees for Efficient Function, Constraint, and Classification Learning
umptrees for Efficient Function, Constraint, and Classification Learning Stephen M. Omohundro International Computer Science Institute 1947 Center Street, Suite 600 erkeley, California 94704 Abstract A
More informationK-Anonymity and Other Cluster- Based Methods. Ge Ruan Oct. 11,2007
K-Anonymity and Other Cluster- Based Methods Ge Ruan Oct 11,2007 Data Publishing and Data Privacy Society is experiencing exponential growth in the number and variety of data collections containing person-specific
More informationAutodesk Fusion 360 Training: The Future of Making Things Attendee Guide
Autodesk Fusion 360 Training: The Future of Making Things Attendee Guide Abstract After completing this workshop, you will have a basic understanding of editing 3D models using Autodesk Fusion 360 TM to
More informationCS535 Fall Department of Computer Science Purdue University
Spatial Data Structures and Hierarchies CS535 Fall 2010 Daniel G Aliaga Daniel G. Aliaga Department of Computer Science Purdue University Spatial Data Structures Store geometric information Organize geometric
More informationFacet: Multiple View Methods
Facet: Multiple View Methods Large Data Visualization Torsten Möller Overview Combining views Partitioning Coordinating Multiple Side-by-Side Views Encoding Channels Shared Data Shared Navigation Synchronized
More informationData Mining: Exploring Data. Lecture Notes for Chapter 3
Data Mining: Exploring Data Lecture Notes for Chapter 3 1 What is data exploration? A preliminary exploration of the data to better understand its characteristics. Key motivations of data exploration include
More informationCS573 Data Privacy and Security. Li Xiong
CS573 Data Privacy and Security Anonymizationmethods Li Xiong Today Clustering based anonymization(cont) Permutation based anonymization Other privacy principles Microaggregation/Clustering Two steps:
More informationAutodesk Inventor 2019 and Engineering Graphics
Autodesk Inventor 2019 and Engineering Graphics An Integrated Approach Randy H. Shih SDC PUBLICATIONS Better Textbooks. Lower Prices. www.sdcpublications.com Powered by TCPDF (www.tcpdf.org) Visit the
More informationCascading CurtainMap: An Interactive Visualization. for Depicting Large and Flexible Hierarchies. Bi Wu
Cascading CurtainMap: An Interactive Visualization for Depicting Large and Flexible Hierarchies by Bi Wu A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science Approved
More information11/2/2017 MIST.6060 Business Intelligence and Data Mining 1. Clustering. Two widely used distance metrics to measure the distance between two records
11/2/2017 MIST.6060 Business Intelligence and Data Mining 1 An Example Clustering X 2 X 1 Objective of Clustering The objective of clustering is to group the data into clusters such that the records within
More informationCalypso Construction Features. Construction Features 1
Calypso 1 The Construction dropdown menu contains several useful construction features that can be used to compare two other features or perform special calculations. Construction features will show up
More informationVisual Analytics Tools for the Global Change Assessment Model. Ross Maciejewski Arizona State University
Visual Analytics Tools for the Global Change Assessment Model Ross Maciejewski Arizona State University GCAM Simulation After running thousands or even hundreds of simulations through GCAM this process
More information10701 Machine Learning. Clustering
171 Machine Learning Clustering What is Clustering? Organizing data into clusters such that there is high intra-cluster similarity low inter-cluster similarity Informally, finding natural groupings among
More informationData Mining: Exploring Data. Lecture Notes for Chapter 3. Introduction to Data Mining
Data Mining: Exploring Data Lecture Notes for Chapter 3 Introduction to Data Mining by Tan, Steinbach, Kumar What is data exploration? A preliminary exploration of the data to better understand its characteristics.
More information2.1 Objectives. Math Chapter 2. Chapter 2. Variable. Categorical Variable EXPLORING DATA WITH GRAPHS AND NUMERICAL SUMMARIES
EXPLORING DATA WITH GRAPHS AND NUMERICAL SUMMARIES Chapter 2 2.1 Objectives 2.1 What Are the Types of Data? www.managementscientist.org 1. Know the definitions of a. Variable b. Categorical versus quantitative
More informationData Mining: Exploring Data. Lecture Notes for Data Exploration Chapter. Introduction to Data Mining
Data Mining: Exploring Data Lecture Notes for Data Exploration Chapter Introduction to Data Mining by Tan, Steinbach, Karpatne, Kumar 02/03/2018 Introduction to Data Mining 1 What is data exploration?
More informationNavigating Hierarchies with Structure-Based Brushes
Navigating Hierarchies with Structure-Based Brushes Ying-Huey Fua, Matthew O. Ward and Elke A. Rundensteiner Computer Science Department Worcester Polytechnic Institute Worcester, MA 01609 yingfua,matt,rundenst
More informationUnsupervised Learning Hierarchical Methods
Unsupervised Learning Hierarchical Methods Road Map. Basic Concepts 2. BIRCH 3. ROCK The Principle Group data objects into a tree of clusters Hierarchical methods can be Agglomerative: bottom-up approach
More informationHierarchy and Tree Visualization
Hierarchy and Tree Visualization Fall 2009 Jing Yang 1 Hierarchies Definition An ordering of groups in which h larger groups encompass sets of smaller groups. Data repository in which cases are related
More informationProgramming II (CS300)
1 Programming II (CS300) Chapter 10: Search and Heaps MOUNA KACEM mouna@cs.wisc.edu Spring 2018 Search and Heaps 2 Linear Search Binary Search Introduction to trees Priority Queues Heaps Linear Search
More informationTrees. CSE 373 Data Structures
Trees CSE 373 Data Structures Readings Reading Chapter 7 Trees 2 Why Do We Need Trees? Lists, Stacks, and Queues are linear relationships Information often contains hierarchical relationships File directories
More informationHierarchy. No or very little supervision Some heuristic quality guidances on the quality of the hierarchy. Jian Pei: CMPT 459/741 Clustering (2) 1
Hierarchy An arrangement or classification of things according to inclusiveness A natural way of abstraction, summarization, compression, and simplification for understanding Typical setting: organize
More informationCSE 230 Intermediate Programming in C and C++ Binary Tree
CSE 230 Intermediate Programming in C and C++ Binary Tree Fall 2017 Stony Brook University Instructor: Shebuti Rayana shebuti.rayana@stonybrook.edu Introduction to Tree Tree is a non-linear data structure
More informationcs6964 February TABULAR DATA Miriah Meyer University of Utah
cs6964 February 23 2012 TABULAR DATA Miriah Meyer University of Utah cs6964 February 23 2012 TABULAR DATA Miriah Meyer University of Utah slide acknowledgements: John Stasko, Georgia Tech Tamara Munzner,
More informationhierarchical techniques
Wolfgang Aigner aigner@ifs.tuwien.ac.at http://ieg.ifs.tuwien.ac.at/~aigner/ wolfgang.aigner@donau-uni.ac.at http://ike.donau-uni.ac.at/~aigner/ Version 1.2 30.11.2009 hierarchical techniques http://www.caida.org/tools/visualization/walrus/
More informationK-means and Hierarchical Clustering
K-means and Hierarchical Clustering Xiaohui Xie University of California, Irvine K-means and Hierarchical Clustering p.1/18 Clustering Given n data points X = {x 1, x 2,, x n }. Clustering is the partitioning
More informationData Preprocessing UE 141 Spring 2013
Data Preprocessing UE 141 Spring 2013 Jing Gao SUNY Buffalo 1 Outline Data Data Preprocessing Improve data quality Prepare data for analysis Exploring Data Statistics Visualization 2 Document Data Each
More informationAND NUMERICAL SUMMARIES. Chapter 2
EXPLORING DATA WITH GRAPHS AND NUMERICAL SUMMARIES Chapter 2 2.1 What Are the Types of Data? 2.1 Objectives www.managementscientist.org 1. Know the definitions of a. Variable b. Categorical versus quantitative
More informationGlyphs. Presentation Overview. What is a Glyph!? Cont. What is a Glyph!? Glyph Fundamentals. Goal of Paper. Presented by Bertrand Low
Presentation Overview Glyphs Presented by Bertrand Low A Taxonomy of Glyph Placement Strategies for Multidimensional Data Visualization Matthew O. Ward, Information Visualization Journal, Palmgrave,, Volume
More informationProgramming II (CS300)
1 Programming II (CS300) Chapter 11: Binary Search Trees MOUNA KACEM mouna@cs.wisc.edu Fall 2018 General Overview of Data Structures 2 Introduction to trees 3 Tree: Important non-linear data structure
More informationStudy and Implementation of CHAMELEON algorithm for Gene Clustering
[1] Study and Implementation of CHAMELEON algorithm for Gene Clustering 1. Motivation Saurav Sahay The vast amount of gathered genomic data from Microarray and other experiments makes it extremely difficult
More informationMachine learning. Oleg Ivanov. for better query planning. 5th of February,
Machine learning for better query planning Oleg Ivanov 5th of February, 26 www.postgrespro.ru Outline. Query planning 2. Machine learning 3. Machine learning for better query planning Query execution plan
More informationDirect and Partial Variation. Lesson 12
Direct and Partial Variation Lesson MFMP Foundations of Mathematics Unit Lesson Lesson Twelve Concepts Overall Expectations Apply data-management techniques to investigate relationships between two variables;
More informationStatistical Methods. Instructor: Lingsong Zhang. Any questions, ask me during the office hour, or me, I will answer promptly.
Statistical Methods Instructor: Lingsong Zhang 1 Issues before Class Statistical Methods Lingsong Zhang Office: Math 544 Email: lingsong@purdue.edu Phone: 765-494-7913 Office Hour: Monday 1:00 pm - 2:00
More informationARCHITECTURE & GAMES. A is for Architect Simple Mass Modeling FORM & SPACE. Industry Careers Framework. Applied. Getting Started.
A is for Architect Simple Mass Modeling One of the first introductions to form and space usually comes at a very early age. As an infant, you might have played with building blocks to help hone your motor
More informationHCI Research Methods
HCI Research Methods Ben Shneiderman ben@cs.umd.edu Founding Director (1983-2000), Human-Computer Interaction Lab Professor, Department of Computer Science Member, Institute for Advanced Computer Studies
More informationWe will start at 2:05 pm! Thanks for coming early!
We will start at 2:05 pm! Thanks for coming early! Yesterday Fundamental 1. Value of visualization 2. Design principles 3. Graphical perception Record Information Support Analytical Reasoning Communicate
More informationWHOLE NUMBER AND DECIMAL OPERATIONS
WHOLE NUMBER AND DECIMAL OPERATIONS Whole Number Place Value : 5,854,902 = Ten thousands thousands millions Hundred thousands Ten thousands Adding & Subtracting Decimals : Line up the decimals vertically.
More informationOverview. Data-mining. Commercial & Scientific Applications. Ongoing Research Activities. From Research to Technology Transfer
Data Mining George Karypis Department of Computer Science Digital Technology Center University of Minnesota, Minneapolis, USA. http://www.cs.umn.edu/~karypis karypis@cs.umn.edu Overview Data-mining What
More informationIAT 355 Visual Analytics. Data and Statistical Models. Lyn Bartram
IAT 355 Visual Analytics Data and Statistical Models Lyn Bartram Exploring data Example: US Census People # of people in group Year # 1850 2000 (every decade) Age # 0 90+ Sex (Gender) # Male, female Marital
More informationINFO 424, UW ischool 11/1/2007
Today s Lecture Trees and Networks Thursday 1 Nov 2007 Polle Zellweger Goals of tree & network visualization View structure & connectivity, node properties Challenges of trees & networks size, structure,
More informationLESSON 14 LEARNING OBJECTIVES. After completing this lesson, you will be able to:
LEARNING OBJECTIVES After completing this lesson, you will be able to: 1. Construct 6 Solid model Primitives: Box, Sphere, Cylinder, Cone, Wedge and Torus LESSON 14 CONSTRUCTING SOLID PRIMITIVES AutoCAD
More informationCS 6143 COMPUTER ARCHITECTURE II SPRING 2014
CS 6143 COMPUTER ARCHITECTURE II SPRING 2014 DUE : April 9, 2014 HOMEWORK IV READ : - Related portions of Chapter 5 and Appendces F and I of the Hennessy book - Related portions of Chapter 1, 4 and 6 of
More informationCS 563 Advanced Topics in Computer Graphics QSplat. by Matt Maziarz
CS 563 Advanced Topics in Computer Graphics QSplat by Matt Maziarz Outline Previous work in area Background Overview In-depth look File structure Performance Future Point Rendering To save on setup and
More informationGround and Non-Ground Filtering for Airborne LIDAR Data
Cloud Publications International Journal of Advanced Remote Sensing and GIS 2016, Volume 5, Issue 1, pp. 1500-1506 ISSN 2320-0243, Crossref: 10.23953/cloud.ijarsg.41 Research Article Open Access Ground
More informationCSC148 Week 6. Larry Zhang
CSC148 Week 6 Larry Zhang 1 Announcements Test 1 coverage: trees (topic of today and Wednesday) are not covered Assignment 1 slides posted on the course website. 2 Data Structures 3 Data Structures A data
More informationClutter-Based Dimension Reordering in Multi-Dimensional Data Visualization
Clutter-Based Dimension Reordering in Multi-Dimensional Data Visualization by Wei Peng A Thesis Submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE In partial fulfillment of the requirements
More informationStrategy. Using Strategy 1
Strategy Using Strategy 1 Scan Path / Strategy It is important to visualize the scan path you want for a feature before you begin taking points on your part. You want to try to place your points in a way
More informationA Systematic Overview of Data Mining Algorithms. Sargur Srihari University at Buffalo The State University of New York
A Systematic Overview of Data Mining Algorithms Sargur Srihari University at Buffalo The State University of New York 1 Topics Data Mining Algorithm Definition Example of CART Classification Iris, Wine
More informationPrepare a stem-and-leaf graph for the following data. In your final display, you should arrange the leaves for each stem in increasing order.
Chapter 2 2.1 Descriptive Statistics A stem-and-leaf graph, also called a stemplot, allows for a nice overview of quantitative data without losing information on individual observations. It can be a good
More informationData Mining. 3.5 Lazy Learners (Instance-Based Learners) Fall Instructor: Dr. Masoud Yaghini. Lazy Learners
Data Mining 3.5 (Instance-Based Learners) Fall 2008 Instructor: Dr. Masoud Yaghini Outline Introduction k-nearest-neighbor Classifiers References Introduction Introduction Lazy vs. eager learning Eager
More informationMultidimensional Indexing The R Tree
Multidimensional Indexing The R Tree Module 7, Lecture 1 Database Management Systems, R. Ramakrishnan 1 Single-Dimensional Indexes B+ trees are fundamentally single-dimensional indexes. When we create
More informationSciGraphica. Tutorial Manual - Tutorials 1and 2 Version 0.8.0
SciGraphica Tutorial Manual - Tutorials 1and 2 Version 0.8.0 Copyright (c) 2001 the SciGraphica documentation group Permission is granted to copy, distribute and/or modify this document under the terms
More information2 parallel coordinates (Inselberg and Dimsdale, 1990; Wegman, 1990), scatterplot matrices (Cleveland and McGill, 1988), dimensional stacking (LeBlanc
HIERARCHICAL EXPLORATION OF LARGE MULTIVARIATE DATA SETS Jing Yang, Matthew O. Ward and Elke A. Rundensteiner Computer Science Department Worcester Polytechnic Institute Worcester, MA 01609 yangjing,matt,rundenst}@cs.wpi.edu
More informationINTRODUCTION TO SPSS OUTLINE 6/17/2013. Assoc. Prof. Dr. Md. Mujibur Rahman Room No. BN Phone:
INTRODUCTION TO SPSS Assoc. Prof. Dr. Md. Mujibur Rahman Room No. BN-0-024 Phone: 89287269 E-mail: mujibur@uniten.edu.my OUTLINE About the four-windows in SPSS The basics of managing data files The basic
More informationCO 1: Review Cost Center Standard Hierarchy
CO 1: Review Cost Center Standard Hierarchy Exercise Review the cost center standard hierarchy. Task Use the SAP Easy Access Menu to review the cost center standard hierarchy. Name (Position) Jamie Shamblin
More informationThesaurus Browse View & Hierarchy View tab
EMu Documentation Thesaurus Browse View & Hierarchy Document Version 1 EMu 5.0 Contents SECTION 1 Browse View 1 The primary selection 3 Browse View right-click menu options 4 View menu options 8 SECTION
More informationLesson for levels K-5 Time to complete: min
Lesson Plan: Lesson for levels K-5 Time to complete: 45-90 min Lesson Plan: Level: Grades K-5 (ages 5-10) Time to complete: ~45-90 minutes Learn how to build basic geometry, apply materials, and import
More informationMoore Catholic High School Math Department
Moore Catholic High School Math Department Geometry Vocabulary The following is a list of terms and properties which are necessary for success in a Geometry class. You will be tested on these terms during
More informationLesson 2 Constructive Solid Geometry Concept. Parametric Modeling with I-DEAS 2-1
Lesson 2 Constructive Solid Geometry Concept Parametric Modeling with I-DEAS 2-1 2-2 Parametric Modeling with I-DEAS Introduction In the 1980s, one of the main advancements in Solid Modeling was the development
More informationVisual Hierarchical Dimension Reduction for Exploration of High Dimensional Datasets
Joint EUROGRAPHICS - IEEE TCVG Symposium on Visualization (2003) G.-P. Bonneau, S. Hahmann, C. D. Hansen (Editors) Visual Hierarchical Dimension Reduction for Exploration of High Dimensional Datasets J.
More information2.1: Frequency Distributions and Their Graphs
2.1: Frequency Distributions and Their Graphs Frequency Distribution - way to display data that has many entries - table that shows classes or intervals of data entries and the number of entries in each
More informationCS 231 Data Structures and Algorithms Fall Recursion and Binary Trees Lecture 21 October 24, Prof. Zadia Codabux
CS 231 Data Structures and Algorithms Fall 2018 Recursion and Binary Trees Lecture 21 October 24, 2018 Prof. Zadia Codabux 1 Agenda ArrayQueue.java Recursion Binary Tree Terminologies Traversal 2 Administrative
More informationCALUMMA Management Tool User Manual
CALUMMA Management Tool User Manual CALUMMA Management Tool Your Data Management SIMPLIFIED. by RISC Software GmbH The CALUMMA system is a highly adaptable data acquisition and management system, for complex
More informationChapter 2: Descriptive Statistics
Chapter 2: Descriptive Statistics Student Learning Outcomes By the end of this chapter, you should be able to: Display data graphically and interpret graphs: stemplots, histograms and boxplots. Recognize,
More informationOrganizing Spatial Data
Organizing Spatial Data Spatial data records include a sense of location as an attribute. Typically location is represented by coordinate data (in 2D or 3D). 1 If we are to search spatial data using the
More informationCS127: B-Trees. B-Trees
CS127: B-Trees B-Trees 1 Data Layout on Disk Track: one ring Sector: one pie-shaped piece. Block: intersection of a track and a sector. Disk Based Dictionary Structures Use a disk-based method when the
More informationData Mining and Machine Learning: Techniques and Algorithms
Instance based classification Data Mining and Machine Learning: Techniques and Algorithms Eneldo Loza Mencía eneldo@ke.tu-darmstadt.de Knowledge Engineering Group, TU Darmstadt International Week 2019,
More informationEXERCISE 2: MODELING MINOAN COLUMNS
Minoan Column at the Palace of Minos, Crete CARLI Digital Collections EXERCISE 2: MODELING MINOAN COLUMNS ASSIGNMENT: In this exercise you will create an architectural element, a Minoan shaped column,
More informationThe University of Texas at Austin McDonald Observatory and Department of Astronomy BOARD OF VISITORS
BIOGRAPHICAL DATA REQUEST The University of Texas at Austin McDonald Observatory and Department of Astronomy BOARD OF VISITORS For the Board of Visitors Roster, we ask that you provide the following three
More informationInformation Visualization
Overview 0 Information Visualization Techniques for high-dimensional data scatter plots, PCA parallel coordinates link + brush pixel-oriented techniques icon-based techniques Techniques for hierarchical
More informationStructure-Based Brushes: A Mechanism for Navigating Hierarchically Organized Data and Information Spaces
Structure-Based Brushes: A Mechanism for Navigating Hierarchically Organized Data and Information Spaces Ying-Huey Fua, Matthew O. Ward and Elke A. Rundensteiner Computer Science Department Worcester Polytechnic
More information