Concept Map: Clustering Visualizations of Categorical Domains

Slides:

Advertisements

Similar presentations

Algorithms and applications

Advertisements

TEMPLATE DESIGN © Self Organized Neural Networks Applied to Animal Communication Abstract Background Objective The main.

Introduction to Bioinformatics

Making Sense of Complicated Microarray Data Part II Gene Clustering and Data Analysis Gabriel Eichler Boston University Some slides adapted from: MeV documentation.

Self Organizing Maps. This presentation is based on: SOM’s are invented by Teuvo Kohonen. They represent multidimensional.

Midterm 2 Overview Fawzi Emad Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.

© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.

Ameriranikistan Muhammad Ahmad Kyle Huston Farhad Majdeteimouri Dan Mackin.

Visual Querying By Color Perceptive Regions Alberto del Bimbo, M. Mugnaini, P. Pala, and F. Turco University of Florence, Italy Pattern Recognition, 1998.

/department of mathematics and computer science Visualization of Transition Systems Hannes Pretorius Visualization Group

Interactive Exploration of Hierarchical Clustering Results HCE (Hierarchical Clustering Explorer) Jinwook Seo and Ben Shneiderman Human-Computer Interaction.

Neural Network Homework Report: Clustering of the Self-Organizing Map Professor ： Hahn-Ming Lee Student : Hsin-Chung Chen M IEEE TRANSACTIONS ON.

Lecture 09 Clustering-based Learning

Content Based Image Organization CS491 Spring 2006 Prof. Chengyu Sun Kelly Breed.

Using Interpretive Structural Modeling to Identify and Quantify Interactive Risks ASTIN 2007 Orlando, FL, USA Rick Gorvett, FCAS, MAAA, ARM, FRM, PhD Director,

Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.

Computer Vision James Hays, Brown

JingTao Yao Growing Hierarchical Self-Organizing Maps for Web Mining Joseph P. Herbert and JingTao Yao Department of Computer Science, University or Regina.

CZ5225: Modeling and Simulation in Biology Lecture 5: Clustering Analysis for Microarray Data III Prof. Chen Yu Zong Tel:

Self organizing maps 1 iCSC2014, Juan López González, University of Oviedo Self organizing maps A visualization technique with data dimension reduction.

Community Architectures for Network Information Systems

VAST 2011 Sebastian Bremm, Tatiana von Landesberger, Martin Heß, Tobias Schreck, Philipp Weil, and Kay Hamacher Interactive-Graphics Systems TU Darmstadt,

A Scalable Self-organizing Map Algorithm for Textual Classification: A Neural Network Approach to Thesaurus Generation Dmitri G. Roussinov Department of.

Introduction to machine learning and data mining 1 iCSC2014, Juan López González, University of Oviedo Introduction to machine learning Juan López González.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 A Comparison of SOM Based Document Categorization Systems.

Support Vector Machines Reading: Ben-Hur and Weston, “A User’s Guide to Support Vector Machines” (linked from class web page)

Foundations of Technology Modeling and Prototypes

University of Malta CSA3080: Lecture 4 © Chris Staff 1 of 14 CSA3080: Adaptive Hypertext Systems I Dr. Christopher Staff Department.

Clustering What is clustering? Also called “unsupervised learning”Also called “unsupervised learning”

Semantic Wordfication of Document Collections Presenter: Yingyu Wu.

Chapter 14 – Cluster Analysis © Galit Shmueli and Peter Bruce 2010 Data Mining for Business Intelligence Shmueli, Patel & Bruce.

MACHINE LEARNING 8. Clustering. Motivation Based on E ALPAYDIN 2004 Introduction to Machine Learning © The MIT Press (V1.1) 2  Classification problem:

Neural Networks - Lecture 81 Unsupervised competitive learning Particularities of unsupervised learning Data clustering Neural networks for clustering.

Challenges in Mining Large Image Datasets Jelena Tešić, B.S. Manjunath University of California, Santa Barbara

Conceptual structures in modern information retrieval Claudio Carpineto Fondazione Ugo Bordoni

CUNY Graduate Center December 15 Erdal Kose. Outlines Define SOMs Application Areas Structure Of SOMs (Basic Algorithm) Learning Algorithm Simulation.

Cluster Analysis.

Hierarchical Clustering Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree like diagram that.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 A self-organizing map for adaptive processing of structured.

Hybrid Intelligent Systems for Network Security Lane Thames Georgia Institute of Technology Savannah, GA

Using Bayesian Networks to Predict Plankton Production from Satellite Data By: Rob Curtis, Richard Fenn, Damon Oberholster Supervisors: Anet Potgieter,

Support Vector Machines Reading: Ben-Hur and Weston, “A User’s Guide to Support Vector Machines” (linked from class web page)

A Tutorial on Spectral Clustering Ulrike von Luxburg Max Planck Institute for Biological Cybernetics Statistics and Computing, Dec. 2007, Vol. 17, No.

Hierarchical clustering approaches for high-throughput data Colin Dewey BMI/CS 576 Fall 2015.

Exploring High-D Spaces with Multiform Matrices and Small Multiples Presented by Ray Chen and Sorelle Friedler Authors: MacEachren, A., Dai, X., Hardisty,

Dynamic Network Analysis Case study of PageRank-based Rewiring Narjès Bellamine-BenSaoud Galen Wilkerson 2 nd Second Annual French Complex Systems Summer.

A Self-organizing Semantic Map for Information Retrieval Xia Lin, Dagobert Soergel, Gary Marchionini presented by Yi-Ting.

Computational Intelligence: Methods and Applications Lecture 9 Self-Organized Mappings Włodzisław Duch Dept. of Informatics, UMK Google: W Duch.

Chapter 5 Unsupervised learning

Graph Representations

Data Mining, Neural Network and Genetic Programming

Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.

Hansheng Xue School of Computer Science and Technology

Clustering (3) Center-based algorithms Fuzzy k-means

Visual Perception.

Overview Identify similarities present in biological sequences and present them in a comprehensible manner to the biologists Objective Capturing Similarity.

Hierarchical clustering approaches for high-throughput data

Step-By-Step Instructions for Miniproject 2

Self-Organizing Maps Corby Ziesman March 21, 2007.

Department of Computer Science University of York

Scale-Space Representation for Matching of 3D Models

Overview of Oracle Site Hub

Ernest Valveny Computer Vision Center

Unsupervised Learning and Clustering

Text Categorization Berlin Chen 2003 Reference:

Motivation Semantic Transformation Module Most of the existing works neglect the semantic relationship between the visual feature and linguistic knowledge,

Strength of relation High Low Number of data Relationship Data

APPLICATIONS OF LINEAR ALGEBRA IN INFORMATION TECHNOLOGY

Presentation transcript:

Concept Map: Clustering Visualizations of Categorical Domains David Rouff and Mark McLean CMSC 743 Information Visualization, Spring 07 Department of Computer Science University of Maryland

1.INTRODUCTION Categorical Data Sets are hard to visualize No inherrent order, variable size, each element and it’s associations is a dimension Popular Node-Link quickly becomes occluded Adjacency matrix hard to understand, elements disjoint Concept Map visualizes categorical data with Multiple, coordinated views Modified hierarchical clustering and SOM clustering Tunable clustering and display parameters

3. Design Approach Mockups and prototypes guided development. Dendrogram/Adjacency Matrix in Matlab SOM/Node Link in Flex

Implementation of Dendrogram and Clustered Adjacency Matrix

Adaptations to Hierarchical clustering Similarity distance calculation FOIL

Interesting Features in the Dendrogram and Adjacency Matrix

Dendrogram and Adjacency Matrix Demo Then switch to SOM and Node Link

Magic… Hierarchy from Flatness and Clarity of Thought - Overview

Behind the Scenes Convert articles into vectors Compress the vectors to 24-bit space Apply vector to random SOM Best matching unit (BMU) learns and so does its neighbors – Mexican hat Group Clusters – low dimensional grouping Create Node-Link Graph

This hierarchy can then be traversed to explore articles Results Proves a large corpus of articles can be reconstructed into a meaningful hierarchy This hierarchy can then be traversed to explore articles The node-link representation delivers a clear distance between nodes and relationship among nodes

Lessons learned… where to begin Don’t bite off more than you can chew, in other words if it sounds like you are going to save the world, it might take more than 6 weeks to do it. When up against a short deadline, don’t try to learn a new language even if they swear it decreases development time and a 6 year old can use it. (in other words Caveat Emptor) There is always time to design no matter how small you think your program will be. Conceptually problems are easy to solve…. Practically they aren’t

Analysis, user feedback, conclusion, questions…