Semantics of Narrative in Collective, Distributed Problem-Solving Environments based on Correspondence Analysis and Hierarchical Clustering

Size: px
Start display at page:

Download "Semantics of Narrative in Collective, Distributed Problem-Solving Environments based on Correspondence Analysis and Hierarchical Clustering"

Transcription

1 Correspondence Analysis & Related Methods, CARME 2011 Semantics of Narrative in Collective, Distributed Problem-Solving Environments based on Correspondence Analysis and Hierarchical Clustering Fionn Murtagh (1, 2), Adam Ganz (2), Joe Reddington (2) (1) Science Foundation Ireland (2) Royal Holloway, University of London

2 Narrativization: our aims include Build, from an arbitrarily large number of texts, a story-line Achieve a fixed target story-line size or length Ensure preservation of data rights (implying: knowing and protecting data sources at all stages) Map story transitions so as to allow interactive reading and other adaptive usage frameworks Determine smooth story transitions so as to allow story subplot embedding, or other information placement

3 Correspondence Analysis inside Correspondence Analysis is A Tale of Three Metrics - Chi squared metric - appropriate for profiles of frequencies of occurrence - Euclidean metric, for visualization, and for static context - Ultrametric, for hierarchic relations and for dynamic context

4 Triangular inequality holds for metrics Vertical x y z Example: Euclidean or as the crow flies distance d(x, z) d(x, y)+d(y, z) Horizontal

5 Ultrametric Euclidean distances makes a lot of sense when the population is homogeneous Ultrametric distance makes a lot of sense when the observables are heterogeneous, discontinuous Latter is especially useful for determining: anomalous, atypical, innovative cases

6 Property Property 1

7 Property Property 1

8 Property Property 1

9 Property Property 1

10 Property Property 1

11 Property Property 1

12 Property Property 1

13 Property Property 1

14 Property Property 1

15 Property Isosceles triangle: approx equal long sides Property 1

16 Strong triangular inequality, or ultrametric inequality, holds for tree distances d(x, z) Height max{d(x, y),d(y, z)} d(x, z) =35 x y z d(x, y) =35 d(y, z) =10 Closest common ancestor distance is an ultrametric

17 Other Publications Deal With the Importance of Ultrametricity In the (high dimensional) limit, everything is hierarchical Ultrametricity is ubiquitous and pervasive

18 Hierarchical clustering on the time-line or other total order on the set of observables Sequence of n-1 pairwise agglomerations using the usual algorithm, given n observables Complete link criterion used But: agglomerands must be adjacent Adjacency between clusters q and q is defined as at least i and i adjacent, with i in q, i in q Theorem: the complete link method under this adjacency constraint is guaranteed not to give rise to inversions (or reversals) in the agglomerative sequence Proof: F Murtagh, Multidimensional Clustering Algorithms, Physica-Verlag, 1985

19 Convergence between Film, TV, Games, Print Media, Social Networking, Telecoms - and Overlapping Deployment in Education and Training, Entertainment, Healthcare and Assisted Living, Culture Multiplay degree environment From game to TV or film: Final Fantasy, Tomb Raider From film to TV and games: Indiana Jones TV to film, game, online: Simpsons, Lost Online to TV: Sofia s Diary (Bebo to Fiver)

20 Interaction and decision making - Casablanca (1942) Script half completed when production began Dialog for some scenes written while shooting in progress

21 Our way of analyzing semantics Based always on data ie filmscript text We discern story semantics arising out of the orientation of narrative This is based on the web of interrelationships First now I will examine caesuras and breakpoints in the flow of narrative

22 Caesuras and Break-Points Hierarchy represents change - caesuras, breakpoints - very well We use a contiguity (ie scene sequence) constrained complete link agglomerative hierarchical clustering algorithm This is based on a Euclidean embedding, resulting from all words and scenes being projected into a Euclidean space - Correspondence Analysis does that In the following we use subscenes of a scene and also hierarchically cluster orientations of vectors

23 Analysis of Casablanca s Mid-Act Climax, Scene 43 subdivided into 11 beats (subscenes) McKee divides this scene, relating to Ilsa and Rick seeking black market exit visas, into 11 beats Beat 1 is Rick finding Ilsa in the market Beats 2, 3, 4 are rejections of him by Ilsa Beats 5, 6 express rapprochement by both Beat 7 is guilt-tripping by each in turn Beat 8 is a jump in content: Ilsa says she will leave Casablanca soon In beat 9, Rick calls her a coward, and Ilsa calls him a fool In beat 10, Rick propositions her In beat 11, the climax, all goes to rack and ruin: Ilsa says she was married to Laszlo all along Rick is stunned

24 MPrincipal plane of 11 beats in scene 43 m-10 M20 m-20 M-20 M-15 M-10 M-05 M00 M05 M10 M15 MFactor 1, 2, 126% 122% of inertia Principal plane of 11 beats in scene Factor 2, 122% of inertia Factor 1, 126% of inertia 210 words used in these 11 beats or subscenes

25 MPrincipal plane of 11 beats in scene 43 m-10 M20 m-20 M-20 M-15 M-10 M-05 M00 M05 M10 M15 MFactor 1, 2, 126% 122% of inertia Principal plane of 11 beats in scene Factor 2, 122% of inertia Factor 1, 126% of inertia

26 MPrincipal plane of 11 beats in scene 43 m-10 M20 m-20 M-20 M-15 M-10 M-05 M00 M05 M10 M15 MFactor 1, 2, 126% 122% of inertia Principal plane of 11 beats in scene 43 Factor 2, 122% of inertia Repulsion 00 Attraction Beat 8: Ilsa to leave Casablanca! Beat 11: Ilsa married to Laszlo all along! Factor 1, 126% of inertia

27 MHierarchical clustering of 11 beats, using their orientations m00 M00 M02 M04 M06 M08 M10 1M 2M 3M 4M 5M 6M 7M 8M 9M Hierarchical clustering of 11 beats, using their orientations Full dimensionality analysis Note caesura in moving from beat 7 to 8, and back to 9 Less so in moving from 4 to 5 but still quite pronounced

28 McKee, Methuen, 1999 Casablance is based on a range of miniplots McKee: its composition is virtually perfect Text is the sensory surface of the underlying semantics

29 Style analysis of scene 43 based on McKee Monte Carlo tested against 999 uniformly randomized sets of the beats In the great majority of cases (against 83% and more of the randomized alternatives) we find the style in scene 43 to be characterized by: small variability of movement from one beat to the next greater tempo of beats high mean rhythm

30 Analysis of style and structure, using 999 randomizations, of sequence of 77 scenes In all, 9 attributes were used Entire Casablanca plot is well-characterized by the variability of movement from one scene to the next (attribute 2) Variability of movement from one beat to the next is smaller than randomized alternatives in 82% of cases Similarity of orientation from one scene to the next (attribute 3) is very tight, ie smaller than randomized alternatives We found this to hold in 95% of cases The variability of orientations (attribute 4) was also tighter, in 82% of cases Attribute 6, the mean of ups and downs of tempos is also revealing In 96% of cases, it was smaller in the real Casablanca, as opposed to the randomized alternatives This points to the balance of up and down movement in pace

31 Work of J Eliashberg, Wharton, U Penn Use features characterizing scripts to predict boxoffice success

32 Other Features We have various practical ways of determining the texture of text So we can match genre and style We could have highly multi-outcome games, for example, created in a crowd sourcing way - and ensure homogeneity and cohesion

33 Looked at: characterization of narrative, using script --- analysis Next: narrativization, or assembling narrative --- synthesis Example of multiple versions of the same storyline (cf creating a game from the story) Collaborative, distributed creation of narrative

34 Text Synthesis Aristotle s Poetics (c 350 BC) Outlines and episodization - Stories should first be set out in universal terms on that basis, one should then turn the story into episodes and elaborate it reasoning is the speech which the agents use to argue a case or put forwards an opinion

35 Project TooManyCooks: Applying Software Design Principles to Fiction Writing Joe Reddington (Comp Sci), Doug Cowie (English) and myself!!!!

36 Support environment for collaborative, distributed creating of narrative Pinpointing anomalous sections Assessing homogeneity of style over successive iterations of the work Scenario experimentation and planning This includes condensing parts, or elaborating Similarity of structure relative to best practice in chosen genre

37 From testimonial, The Writers Desk (London) Overall we at The Writers Desk have found this analysis to be of a great assistance to our editorial work in all aspects of the editorial process From helping to identify target markets, to highlighting problem areas within the novel, to illustrating writing style, these analysis reports have become a rather important part of our working operations

38 Segmentation and Nodal Points in Narrative We used 9 versions of a Scottish lowlands ballad, Lady Maisry Ballad relates to woman who became pregnant by an English lord, and as a result is burnt to death by her own family Interest in nodal points in narrative include, beyond literature, the importance of such locations in the narrative for introducing change, eg to create derivative or parallel versions, or to support user interaction in the context of the storyline Initial 4 stanzas (out of 27) from ballad 65B 65B1! IN came her sister,! Stepping on the floor;! Says, It s telling me, my sister Janet,! That you re become a whore 65B2! A whore, sister, a whore, sister?! That s what I ll never be;! I m no so great a whore, sister,! As liars does on me lee 65B3! In came her brother,! Stepping on the floor;! Says, It s telling me, my sister Janet,! That you re become a whore 65B4! A whore, brother, a whore, brother?! A whore I ll never be;! I m no so bad a woman, brother,! As liears does on me lee

39 Opening stanzas of 9 variants All 219 stanzas as dots B C H K A E G D 4 3 F Factor Factor Factor 2 Last stanzas of 9 variants All 219 stanzas as dots F H A K E G D C Factor 1 B 2

40 65A: Lady Maisry 65B: Lady Maisry 65C: Lady Maisry G: Lady Maisry 65H: Lady Maisry 65K: Lady Maisry

41 To Read Further F Murtagh, Correspondence Analysis and Data Coding with R and Java, Chapman and Hall/CRC Press, 2005 See chapter 5 on text analysis Software at wwwcorrespondancesinfo F Murtagh, A Ganz and J Reddington, New methods of analysis of narrative and semantics in support of interactivity, Entertainment Computing, advance access online, 2010 F Murtagh, A Ganz, S McKie, J Mothe and K Englmeier, "Tag clouds for displaying semantics: The case of filmscripts", Information Visualization Journal, 9, , 2010 F Murtagh, "The Correspondence Analysis platform for uncovering deep structure in data and information", Sixth Boole Lecture, Computer Journal, 53, , 2010 F Murtagh, A Ganz and S McKie, "The structure of narrative: the case of film scripts", Pattern Recognition, 42, , 2009 (See discussion in Z Merali, "Here's looking at you, kid Software promises to identify blockbuster scripts", Nature, 453, p 708, 4 June 2008) T Cooks, The Shadow Hours, 2009, 231 pp T Cooks, The Delivery, MPG Books Group, 2009, 213 pp And more See

42

Semantics from Narrative: State of the Art and Future Prospects

Semantics from Narrative: State of the Art and Future Prospects SLDS 2009 Semantics from Narrative: State of the Art and Future Prospects Fionn Murtagh Science Foundation Ireland, and Royal Holloway, University of London Challenges Addressed Great masses of data, textual

More information

Analysis & Synthesis of Narrative Two applications

Analysis & Synthesis of Narrative Two applications Analysis & Synthesis of Narrative Two applications Casablanca movie - middle scene 43 Mapping and tracking emotion Short look at: stochastic analyses of structure and style Supporting collective, collaborative

More information

arxiv: v1 [cs.ai] 24 May 2008

arxiv: v1 [cs.ai] 24 May 2008 The Structure of Narrative: the Case of Film Scripts arxiv:08053799v1 [csai] 24 ay 2008 Fionn urtagh (1), Adam Ganz (2) and Stewart ckie (2) (1) Department of Computer Science (2) Department of edia Arts

More information

Hard clustering. Each object is assigned to one and only one cluster. Hierarchical clustering is usually hard. Soft (fuzzy) clustering

Hard clustering. Each object is assigned to one and only one cluster. Hierarchical clustering is usually hard. Soft (fuzzy) clustering An unsupervised machine learning problem Grouping a set of objects in such a way that objects in the same group (a cluster) are more similar (in some sense or another) to each other than to those in other

More information

Machine Learning (BSMC-GA 4439) Wenke Liu

Machine Learning (BSMC-GA 4439) Wenke Liu Machine Learning (BSMC-GA 4439) Wenke Liu 01-31-017 Outline Background Defining proximity Clustering methods Determining number of clusters Comparing two solutions Cluster analysis as unsupervised Learning

More information

Grade 6 Middle School Math Solution Alignment to Oklahoma Academic Standards

Grade 6 Middle School Math Solution Alignment to Oklahoma Academic Standards 6.N.1 Read, write, and represent integers and rational numbers expressed as fractions, decimals, percents, and ratios; write positive integers as products of factors; use these representations in real-world

More information

Machine Learning (BSMC-GA 4439) Wenke Liu

Machine Learning (BSMC-GA 4439) Wenke Liu Machine Learning (BSMC-GA 4439) Wenke Liu 01-25-2018 Outline Background Defining proximity Clustering methods Determining number of clusters Other approaches Cluster analysis as unsupervised Learning Unsupervised

More information

Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations

Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations Emma Twersky May 2017 Abstract This paper is an exploration into centroidal Voronoi tessellations, or CVTs. A centroidal

More information

Bachelor's degree in Audiovisual Communication - Syllabus

Bachelor's degree in Audiovisual Communication - Syllabus Bachelor's degree in Audiovisual - Syllabus Branch of knowledge Duration Schedule Academic year Languages Credits Social and legal sciences Four academic years Half-day schedule in the first two years,

More information

Unsupervised Learning and Clustering

Unsupervised Learning and Clustering Unsupervised Learning and Clustering Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Spring 2008 CS 551, Spring 2008 c 2008, Selim Aksoy (Bilkent University)

More information

Course Outline. Video Game AI: Lecture 7 Heuristics & Smoothing. Finding the best location out of several. Variable size units / special movement?

Course Outline. Video Game AI: Lecture 7 Heuristics & Smoothing. Finding the best location out of several. Variable size units / special movement? Course Outline Video Game AI: Lecture 7 Heuristics & Smoothing Nathan Sturtevant COMP 3705 http://aigamedev.com/ now has free interviews! Miscellaneous details Heuristics How better heuristics can be built

More information

Introduction to Machine Learning. Xiaojin Zhu

Introduction to Machine Learning. Xiaojin Zhu Introduction to Machine Learning Xiaojin Zhu jerryzhu@cs.wisc.edu Read Chapter 1 of this book: Xiaojin Zhu and Andrew B. Goldberg. Introduction to Semi- Supervised Learning. http://www.morganclaypool.com/doi/abs/10.2200/s00196ed1v01y200906aim006

More information

Beyond A*: Speeding up pathfinding through hierarchical abstraction. Daniel Harabor NICTA & The Australian National University

Beyond A*: Speeding up pathfinding through hierarchical abstraction. Daniel Harabor NICTA & The Australian National University Beyond A*: Speeding up pathfinding through hierarchical abstraction Daniel Harabor NICTA & The Australian National University Motivation Myth: Pathfinding is a solved problem. Motivation Myth: Pathfinding

More information

Transform your video services with a cloud platform: Succeed in a fragmented marketplace

Transform your video services with a cloud platform: Succeed in a fragmented marketplace with a cloud platform: Succeed in a fragmented marketplace Contents 3 4 7 cloud-based platform 8 10 12 14 16 points: Great in action 18 : Your business faces a significant challenge. Subscriber demands

More information

Feature Extractors. CS 188: Artificial Intelligence Fall Nearest-Neighbor Classification. The Perceptron Update Rule.

Feature Extractors. CS 188: Artificial Intelligence Fall Nearest-Neighbor Classification. The Perceptron Update Rule. CS 188: Artificial Intelligence Fall 2007 Lecture 26: Kernels 11/29/2007 Dan Klein UC Berkeley Feature Extractors A feature extractor maps inputs to feature vectors Dear Sir. First, I must solicit your

More information

Stat 321: Transposable Data Clustering

Stat 321: Transposable Data Clustering Stat 321: Transposable Data Clustering Art B. Owen Stanford Statistics Art B. Owen (Stanford Statistics) Clustering 1 / 27 Clustering Given n objects with d attributes, place them (the objects) into groups.

More information

5 Mathematics Curriculum. Module Overview... i. Topic A: Concepts of Volume... 5.A.1

5 Mathematics Curriculum. Module Overview... i. Topic A: Concepts of Volume... 5.A.1 5 Mathematics Curriculum G R A D E Table of Contents GRADE 5 MODULE 5 Addition and Multiplication with Volume and Area GRADE 5 MODULE 5 Module Overview... i Topic A: Concepts of Volume... 5.A.1 Topic B:

More information

A Location Model for Ambient Intelligence

A Location Model for Ambient Intelligence A Location Model for Ambient Intelligence National Institute of Informatics, Japan Email: ichiro@nii.ac.jp Outline 1. Motivation 2. Approach 3. Location Model 4. Design and Implementation 5. Applications

More information

Clustering. CE-717: Machine Learning Sharif University of Technology Spring Soleymani

Clustering. CE-717: Machine Learning Sharif University of Technology Spring Soleymani Clustering CE-717: Machine Learning Sharif University of Technology Spring 2016 Soleymani Outline Clustering Definition Clustering main approaches Partitional (flat) Hierarchical Clustering validation

More information

Clustering. Lecture 6, 1/24/03 ECS289A

Clustering. Lecture 6, 1/24/03 ECS289A Clustering Lecture 6, 1/24/03 What is Clustering? Given n objects, assign them to groups (clusters) based on their similarity Unsupervised Machine Learning Class Discovery Difficult, and maybe ill-posed

More information

3. Cluster analysis Overview

3. Cluster analysis Overview Université Laval Multivariate analysis - February 2006 1 3.1. Overview 3. Cluster analysis Clustering requires the recognition of discontinuous subsets in an environment that is sometimes discrete (as

More information

Theories & Principles of Animation

Theories & Principles of Animation Module 10: Theories & Principles of Animation Stage 1 Semester 1 Module Title Theories & Principles of Animation Module Number 10 Module Status Elective Module ECTS Credits 5 Module NFQ level 9 Pre-Requisite

More information

Kernels and Clustering

Kernels and Clustering Kernels and Clustering Robert Platt Northeastern University All slides in this file are adapted from CS188 UC Berkeley Case-Based Learning Non-Separable Data Case-Based Reasoning Classification from similarity

More information

Tree Models of Similarity and Association. Clustering and Classification Lecture 5

Tree Models of Similarity and Association. Clustering and Classification Lecture 5 Tree Models of Similarity and Association Clustering and Lecture 5 Today s Class Tree models. Hierarchical clustering methods. Fun with ultrametrics. 2 Preliminaries Today s lecture is based on the monograph

More information

WHO SHOULD ATTEND? ITIL Foundation is suitable for anyone working in IT services requiring more information about the ITIL best practice framework.

WHO SHOULD ATTEND? ITIL Foundation is suitable for anyone working in IT services requiring more information about the ITIL best practice framework. Learning Objectives and Course Descriptions: FOUNDATION IN IT SERVICE MANAGEMENT This official ITIL Foundation certification course provides you with a general overview of the IT Service Management Lifecycle

More information

A Content Based Image Retrieval System Based on Color Features

A Content Based Image Retrieval System Based on Color Features A Content Based Image Retrieval System Based on Features Irena Valova, University of Rousse Angel Kanchev, Department of Computer Systems and Technologies, Rousse, Bulgaria, Irena@ecs.ru.acad.bg Boris

More information

The Uneasy Relationship Between Statistical Methods and Anthropological Research. Dr. Dwight Read Dept. of Anthropology and Dept. of Statistics UCLA

The Uneasy Relationship Between Statistical Methods and Anthropological Research. Dr. Dwight Read Dept. of Anthropology and Dept. of Statistics UCLA The Uneasy Relationship Between Statistical Methods and Anthropological Research Dr. Dwight Read Dept. of Anthropology and Dept. of Statistics UCLA Introduction I willl begin by characterizing statistics

More information

Outline. CS38 Introduction to Algorithms. Approximation Algorithms. Optimization Problems. Set Cover. Set cover 5/29/2014. coping with intractibility

Outline. CS38 Introduction to Algorithms. Approximation Algorithms. Optimization Problems. Set Cover. Set cover 5/29/2014. coping with intractibility Outline CS38 Introduction to Algorithms Lecture 18 May 29, 2014 coping with intractibility approximation algorithms set cover TSP center selection randomness in algorithms May 29, 2014 CS38 Lecture 18

More information

INTRODUCTION TO IMAGE PROCESSING (COMPUTER VISION)

INTRODUCTION TO IMAGE PROCESSING (COMPUTER VISION) INTRODUCTION TO IMAGE PROCESSING (COMPUTER VISION) Revision: 1.4, dated: November 10, 2005 Tomáš Svoboda Czech Technical University, Faculty of Electrical Engineering Center for Machine Perception, Prague,

More information

Data Clustering Hierarchical Clustering, Density based clustering Grid based clustering

Data Clustering Hierarchical Clustering, Density based clustering Grid based clustering Data Clustering Hierarchical Clustering, Density based clustering Grid based clustering Team 2 Prof. Anita Wasilewska CSE 634 Data Mining All Sources Used for the Presentation Olson CF. Parallel algorithms

More information

Ultrametric Topology Perspective. Analysis of Massive, Very High Dimensional Data Stores

Ultrametric Topology Perspective. Analysis of Massive, Very High Dimensional Data Stores The on Analysis of Massive, Very High Dimensional Data Stores Science Foundation Ireland, Wilton Park House, Wilton Place, Dublin 2, Ireland Dept. Computer Science, Royal Holloway, Univ. London, Egham

More information

Unsupervised Learning and Clustering

Unsupervised Learning and Clustering Unsupervised Learning and Clustering Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Spring 2009 CS 551, Spring 2009 c 2009, Selim Aksoy (Bilkent University)

More information

Chapter 3! Planning and Design! 2012 Elsevier, Inc. All rights reserved.

Chapter 3! Planning and Design! 2012 Elsevier, Inc. All rights reserved. Chapter 3! Planning and Design! 2012 Elsevier, Inc. All rights reserved. Road Map The time and effort you put into planning a multimedia project will determine how well (or not) the project hits its mark.!!!

More information

The Ultrametric Topology Perspective on Analysis of Massive, Very High Dimensional Data Stores

The Ultrametric Topology Perspective on Analysis of Massive, Very High Dimensional Data Stores The Ultrametric Topology Perspective on Analysis of Massive, Very High Dimensional Data Stores Erice, April 2007 Lessons Very high dimensional spaces are of very simple structure. It becomes easier to

More information

ECS 234: Data Analysis: Clustering ECS 234

ECS 234: Data Analysis: Clustering ECS 234 : Data Analysis: Clustering What is Clustering? Given n objects, assign them to groups (clusters) based on their similarity Unsupervised Machine Learning Class Discovery Difficult, and maybe ill-posed

More information

Case-Based Reasoning. CS 188: Artificial Intelligence Fall Nearest-Neighbor Classification. Parametric / Non-parametric.

Case-Based Reasoning. CS 188: Artificial Intelligence Fall Nearest-Neighbor Classification. Parametric / Non-parametric. CS 188: Artificial Intelligence Fall 2008 Lecture 25: Kernels and Clustering 12/2/2008 Dan Klein UC Berkeley Case-Based Reasoning Similarity for classification Case-based reasoning Predict an instance

More information

CS 188: Artificial Intelligence Fall 2008

CS 188: Artificial Intelligence Fall 2008 CS 188: Artificial Intelligence Fall 2008 Lecture 25: Kernels and Clustering 12/2/2008 Dan Klein UC Berkeley 1 1 Case-Based Reasoning Similarity for classification Case-based reasoning Predict an instance

More information

Lecture 10: Semantic Segmentation and Clustering

Lecture 10: Semantic Segmentation and Clustering Lecture 10: Semantic Segmentation and Clustering Vineet Kosaraju, Davy Ragland, Adrien Truong, Effie Nehoran, Maneekwan Toyungyernsub Department of Computer Science Stanford University Stanford, CA 94305

More information

Algorithms for Bioinformatics

Algorithms for Bioinformatics Adapted from slides by Leena Salmena and Veli Mäkinen, which are partly from http: //bix.ucsd.edu/bioalgorithms/slides.php. 582670 Algorithms for Bioinformatics Lecture 6: Distance based clustering and

More information

CS 343: Artificial Intelligence

CS 343: Artificial Intelligence CS 343: Artificial Intelligence Kernels and Clustering Prof. Scott Niekum The University of Texas at Austin [These slides based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.

More information

Practices (1) 6.MP.2. Reason abstractly and quantitatively.

Practices (1) 6.MP.2. Reason abstractly and quantitatively. Common Core Scope and Sequence Sixth Grade Quarter 3 Unit 6: Coordinate Plane and Proportional Relationships Domain: The Number System, Geometry, Expressions and Equations, Ratios and Proportional Relationships

More information

Foundations of Machine Learning CentraleSupélec Fall Clustering Chloé-Agathe Azencot

Foundations of Machine Learning CentraleSupélec Fall Clustering Chloé-Agathe Azencot Foundations of Machine Learning CentraleSupélec Fall 2017 12. Clustering Chloé-Agathe Azencot Centre for Computational Biology, Mines ParisTech chloe-agathe.azencott@mines-paristech.fr Learning objectives

More information

Course Title: Math 7 Grade Level: 7

Course Title: Math 7 Grade Level: 7 Content Area: Mathematics Course Title: Math 7 Grade Level: 7 Integers Rational Numbers and Equations Expressions and Equations Marking Period 1 Inequalities Ratio and Proportion Marking Period 2 Percents

More information

Mathematics Curriculum

Mathematics Curriculum New York State Common Core Mathematics Curriculum Table of Contents 1 Congruence, Proof, and Constructions MODULE 1... 3 Topic A: Basic Constructions (G-CO.1, G-CO.12, G-CO.13)... 7 Lesson 1: Construct

More information

MRT based Adaptive Transform Coder with Classified Vector Quantization (MATC-CVQ)

MRT based Adaptive Transform Coder with Classified Vector Quantization (MATC-CVQ) 5 MRT based Adaptive Transform Coder with Classified Vector Quantization (MATC-CVQ) Contents 5.1 Introduction.128 5.2 Vector Quantization in MRT Domain Using Isometric Transformations and Scaling.130 5.2.1

More information

PERFECT-EDIT.COM PROFESSIONAL EDITING & WRITING SERVICE. About Perfect Edit

PERFECT-EDIT.COM PROFESSIONAL EDITING & WRITING SERVICE. About Perfect Edit About Perfect Edit PERFECT-EDIT. COM offers professional Editing and Writing Services for the discerning author and publisher. Our expertise covers the literary genre: Fiction-novels, Story books; Nonfiction:

More information

Chapter 1. Introduction

Chapter 1. Introduction Chapter 1 Introduction A Monte Carlo method is a compuational method that uses random numbers to compute (estimate) some quantity of interest. Very often the quantity we want to compute is the mean of

More information

6. Concluding Remarks

6. Concluding Remarks [8] K. J. Supowit, The relative neighborhood graph with an application to minimum spanning trees, Tech. Rept., Department of Computer Science, University of Illinois, Urbana-Champaign, August 1980, also

More information

Lecture 4.5: Interpolation and Splines

Lecture 4.5: Interpolation and Splines Lecture 4.5: Interpolation and Splines D. Jason Koskinen koskinen@nbi.ku.dk Photo by Howard Jackman University of Copenhagen Advanced Methods in Applied Statistics Feb - Apr 2018 Niels Bohr Institute 2

More information

MSA220 - Statistical Learning for Big Data

MSA220 - Statistical Learning for Big Data MSA220 - Statistical Learning for Big Data Lecture 13 Rebecka Jörnsten Mathematical Sciences University of Gothenburg and Chalmers University of Technology Clustering Explorative analysis - finding groups

More information

What You ll Learn. Why It s Important

What You ll Learn. Why It s Important First Nations artists use their artwork to preserve their heritage. Haida artist Don Yeomans is one of the foremost Northwest Coast artists. Look at this print called The Benefit, created by Don Yeomans.

More information

Linear Discriminant Functions: Gradient Descent and Perceptron Convergence

Linear Discriminant Functions: Gradient Descent and Perceptron Convergence Linear Discriminant Functions: Gradient Descent and Perceptron Convergence The Two-Category Linearly Separable Case (5.4) Minimizing the Perceptron Criterion Function (5.5) Role of Linear Discriminant

More information

COMP 102: Computers and Computing

COMP 102: Computers and Computing COMP 102: Computers and Computing Lecture 23: Computer Vision Instructor: Kaleem Siddiqi (siddiqi@cim.mcgill.ca) Class web page: www.cim.mcgill.ca/~siddiqi/102.html What is computer vision? Broadly speaking,

More information

By Atul S. Kulkarni Graduate Student, University of Minnesota Duluth. Under The Guidance of Dr. Richard Maclin

By Atul S. Kulkarni Graduate Student, University of Minnesota Duluth. Under The Guidance of Dr. Richard Maclin By Atul S. Kulkarni Graduate Student, University of Minnesota Duluth Under The Guidance of Dr. Richard Maclin Outline Problem Statement Background Proposed Solution Experiments & Results Related Work Future

More information

Visualizing Dynamic Transformations In Interactive Electronic Communication Patricia Search

Visualizing Dynamic Transformations In Interactive Electronic Communication Patricia Search Visualizing Dynamic Transformations In Interactive Electronic Communication Patricia Search Abstract In this research animated patterns of graphics and text provide an overview of the information in an

More information

Networking for a dynamic infrastructure: getting it right.

Networking for a dynamic infrastructure: getting it right. IBM Global Technology Services Networking for a dynamic infrastructure: getting it right. A guide for realizing the full potential of virtualization June 2009 Executive summary June 2009 Networking for

More information

1 The Arthur-Merlin Story

1 The Arthur-Merlin Story Comp 260: Advanced Algorithms Tufts University, Spring 2011 Prof. Lenore Cowen Scribe: Andrew Winslow Lecture 1: Perfect and Stable Marriages 1 The Arthur-Merlin Story In the land ruled by the legendary

More information

Measures of Clustering Quality: A Working Set of Axioms for Clustering

Measures of Clustering Quality: A Working Set of Axioms for Clustering Measures of Clustering Quality: A Working Set of Axioms for Clustering Margareta Ackerman and Shai Ben-David School of Computer Science University of Waterloo, Canada Abstract Aiming towards the development

More information

3. Cluster analysis Overview

3. Cluster analysis Overview Université Laval Analyse multivariable - mars-avril 2008 1 3.1. Overview 3. Cluster analysis Clustering requires the recognition of discontinuous subsets in an environment that is sometimes discrete (as

More information

DIABLO VALLEY COLLEGE CATALOG

DIABLO VALLEY COLLEGE CATALOG ART DIGITAL MEDIA ARTDM Toni Fannin, Dean Applied and Fine Arts Division Business and Foreign Language Building, Room 204 Possible career opportunities Digital media or graphic design jobs cover all ends

More information

Lecture 5 Finding meaningful clusters in data. 5.1 Kleinberg s axiomatic framework for clustering

Lecture 5 Finding meaningful clusters in data. 5.1 Kleinberg s axiomatic framework for clustering CSE 291: Unsupervised learning Spring 2008 Lecture 5 Finding meaningful clusters in data So far we ve been in the vector quantization mindset, where we want to approximate a data set by a small number

More information

Key learning outcome: To write a story about overcoming a monster. Medium-term plan

Key learning outcome: To write a story about overcoming a monster. Medium-term plan Key Stage: Upper KS2 Y5/6 Genre: Fiction Text: Beowulf by Kevin Crossley-Holland Length of sequence: 3 weeks Key learning outcome: To write a story about overcoming a monster Elicitation task: Share with

More information

Application of Clustering Techniques to Energy Data to Enhance Analysts Productivity

Application of Clustering Techniques to Energy Data to Enhance Analysts Productivity Application of Clustering Techniques to Energy Data to Enhance Analysts Productivity Wendy Foslien, Honeywell Labs Valerie Guralnik, Honeywell Labs Steve Harp, Honeywell Labs William Koran, Honeywell Atrium

More information

Particle Swarm Optimization applied to Pattern Recognition

Particle Swarm Optimization applied to Pattern Recognition Particle Swarm Optimization applied to Pattern Recognition by Abel Mengistu Advisor: Dr. Raheel Ahmad CS Senior Research 2011 Manchester College May, 2011-1 - Table of Contents Introduction... - 3 - Objectives...

More information

Statistical Pattern Recognition

Statistical Pattern Recognition Statistical Pattern Recognition Features and Feature Selection Hamid R. Rabiee Jafar Muhammadi Spring 2013 http://ce.sharif.edu/courses/91-92/2/ce725-1/ Agenda Features and Patterns The Curse of Size and

More information

Hierarchical Clustering 4/5/17

Hierarchical Clustering 4/5/17 Hierarchical Clustering 4/5/17 Hypothesis Space Continuous inputs Output is a binary tree with data points as leaves. Useful for explaining the training data. Not useful for making new predictions. Direction

More information

Machine Learning for OR & FE

Machine Learning for OR & FE Machine Learning for OR & FE Unsupervised Learning: Clustering Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com (Some material

More information

5 MORE PRACTICE. 1 Complete the sentences with the words below and a suitable suffix.

5 MORE PRACTICE. 1 Complete the sentences with the words below and a suitable suffix. Name Vocabulary 1 Complete the sentences with the words below and a suitable suffix. real emotion innovate danger predict 1. Don t drive so fast, it s! 2. The film was boring and. 3. These prizes are given

More information

Now-Crowd Billboards User Manual

Now-Crowd Billboards User Manual Now-Crowd Billboards User Manual Now-Crowd Billboards User Manual 2017-2018, RiverSoftArt Contents Introduction... 1 Features... 1 How to use Now-Crowd Billboards... 2 Now-Crowd Orient Billboard to Camera

More information

Clustering: Overview and K-means algorithm

Clustering: Overview and K-means algorithm Clustering: Overview and K-means algorithm Informal goal Given set of objects and measure of similarity between them, group similar objects together K-Means illustrations thanks to 2006 student Martin

More information

Irradiance Gradients. Media & Occlusions

Irradiance Gradients. Media & Occlusions Irradiance Gradients in the Presence of Media & Occlusions Wojciech Jarosz in collaboration with Matthias Zwicker and Henrik Wann Jensen University of California, San Diego June 23, 2008 Wojciech Jarosz

More information

Analysis of Image and Video Using Color, Texture and Shape Features for Object Identification

Analysis of Image and Video Using Color, Texture and Shape Features for Object Identification IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 16, Issue 6, Ver. VI (Nov Dec. 2014), PP 29-33 Analysis of Image and Video Using Color, Texture and Shape Features

More information

Cpk: What is its Capability? By: Rick Haynes, Master Black Belt Smarter Solutions, Inc.

Cpk: What is its Capability? By: Rick Haynes, Master Black Belt Smarter Solutions, Inc. C: What is its Capability? By: Rick Haynes, Master Black Belt Smarter Solutions, Inc. C is one of many capability metrics that are available. When capability metrics are used, organizations typically provide

More information

Identifying and Exploiting Ultrametricity

Identifying and Exploiting Ultrametricity Identifying and Exploiting Ultrametricity Fionn Murtagh Department of Computer Science Royal Holloway, University of London Egham TW20 0EX, England fmurtagh@acm.org Abstract. We begin with pervasive ultrametricity

More information

Using the Best of Both!

Using the Best of Both! Using the Best of Both! A Guide to Using Connected Mathematics 2 with Prentice Hall Mathematics Courses 1, 2, 3 2012, and Algebra Readiness MatBro111707BestOfBothPH10&CMP2.indd 1 6/7/11 11:59 AM Using

More information

QED Q: Why is it called the triangle inequality? A: Analogue with euclidean distance in the plane: picture Defn: Minimum Distance of a code C:

QED Q: Why is it called the triangle inequality? A: Analogue with euclidean distance in the plane: picture Defn: Minimum Distance of a code C: Lecture 3: Lecture notes posted online each week. Recall Defn Hamming distance: for words x = x 1... x n, y = y 1... y n of the same length over the same alphabet, d(x, y) = {1 i n : x i y i } i.e., d(x,

More information

High Dimensional Indexing by Clustering

High Dimensional Indexing by Clustering Yufei Tao ITEE University of Queensland Recall that, our discussion so far has assumed that the dimensionality d is moderately high, such that it can be regarded as a constant. This means that d should

More information

Unsupervised learning in Vision

Unsupervised learning in Vision Chapter 7 Unsupervised learning in Vision The fields of Computer Vision and Machine Learning complement each other in a very natural way: the aim of the former is to extract useful information from visual

More information

Mathematics Curriculum

Mathematics Curriculum New York State Common Core Mathematics Curriculum Table of Contents 1 MODULE 1... 3 Topic A: Basic Constructions (G-CO.A.1, G-CO.D.12, G-CO.D.13)... 11 Lessons 1 2: Construct an Equilateral Triangle...

More information

8 th Grade Pre Algebra Pacing Guide 1 st Nine Weeks

8 th Grade Pre Algebra Pacing Guide 1 st Nine Weeks 8 th Grade Pre Algebra Pacing Guide 1 st Nine Weeks MS Objective CCSS Standard I Can Statements Included in MS Framework + Included in Phase 1 infusion Included in Phase 2 infusion 1a. Define, classify,

More information

Math 7 Glossary Terms

Math 7 Glossary Terms Math 7 Glossary Terms Absolute Value Absolute value is the distance, or number of units, a number is from zero. Distance is always a positive value; therefore, absolute value is always a positive value.

More information

Cluster Analysis and Visualization. Workshop on Statistics and Machine Learning 2004/2/6

Cluster Analysis and Visualization. Workshop on Statistics and Machine Learning 2004/2/6 Cluster Analysis and Visualization Workshop on Statistics and Machine Learning 2004/2/6 Outlines Introduction Stages in Clustering Clustering Analysis and Visualization One/two-dimensional Data Histogram,

More information

Clustering and Visualisation of Data

Clustering and Visualisation of Data Clustering and Visualisation of Data Hiroshi Shimodaira January-March 28 Cluster analysis aims to partition a data set into meaningful or useful groups, based on distances between data points. In some

More information

CSC 2529F Computer Animation Graduate Project -Collaborative Motion Graphs. Alex & Philipp Hertel

CSC 2529F Computer Animation Graduate Project -Collaborative Motion Graphs. Alex & Philipp Hertel CSC 2529F Computer Animation Graduate Project -Collaborative Motion Graphs Alex & Philipp Hertel April 15th, 2003 Introduction There has recently been much interest in using motion graphs as a means of

More information

Lecturer: Shuchi Chawla Topic: Euclidean TSP (contd.) Date: 2/8/07

Lecturer: Shuchi Chawla Topic: Euclidean TSP (contd.) Date: 2/8/07 CS880: Approximations Algorithms Scribe: Dave Andrzejewski Lecturer: Shuchi Chawla Topic: Euclidean TSP (contd.) Date: 2/8/07 Today we continue the discussion of a dynamic programming (DP) approach to

More information

COMP 551 Applied Machine Learning Lecture 13: Unsupervised learning

COMP 551 Applied Machine Learning Lecture 13: Unsupervised learning COMP 551 Applied Machine Learning Lecture 13: Unsupervised learning Associate Instructor: Herke van Hoof (herke.vanhoof@mail.mcgill.ca) Slides mostly by: (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/comp551

More information

Applied Algorithm Design Lecture 3

Applied Algorithm Design Lecture 3 Applied Algorithm Design Lecture 3 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 3 1 / 75 PART I : GREEDY ALGORITHMS Pietro Michiardi (Eurecom) Applied Algorithm

More information

Strategies for simulating pedestrian navigation with multiple reinforcement learning agents

Strategies for simulating pedestrian navigation with multiple reinforcement learning agents Strategies for simulating pedestrian navigation with multiple reinforcement learning agents Francisco Martinez-Gil, Miguel Lozano, Fernando Ferna ndez Presented by: Daniel Geschwender 9/29/2016 1 Overview

More information

Non-Bayesian Classifiers Part I: k-nearest Neighbor Classifier and Distance Functions

Non-Bayesian Classifiers Part I: k-nearest Neighbor Classifier and Distance Functions Non-Bayesian Classifiers Part I: k-nearest Neighbor Classifier and Distance Functions Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Fall 2017 CS 551,

More information

Short-Cut MCMC: An Alternative to Adaptation

Short-Cut MCMC: An Alternative to Adaptation Short-Cut MCMC: An Alternative to Adaptation Radford M. Neal Dept. of Statistics and Dept. of Computer Science University of Toronto http://www.cs.utoronto.ca/ radford/ Third Workshop on Monte Carlo Methods,

More information

Emerging Technologies in Knowledge Management By Ramana Rao, CTO of Inxight Software, Inc.

Emerging Technologies in Knowledge Management By Ramana Rao, CTO of Inxight Software, Inc. Emerging Technologies in Knowledge Management By Ramana Rao, CTO of Inxight Software, Inc. This paper provides an overview of a presentation at the Internet Librarian International conference in London

More information

Segmentation Computer Vision Spring 2018, Lecture 27

Segmentation Computer Vision Spring 2018, Lecture 27 Segmentation http://www.cs.cmu.edu/~16385/ 16-385 Computer Vision Spring 218, Lecture 27 Course announcements Homework 7 is due on Sunday 6 th. - Any questions about homework 7? - How many of you have

More information

Sergei Silvestrov, Christopher Engström. January 29, 2013

Sergei Silvestrov, Christopher Engström. January 29, 2013 Sergei Silvestrov, January 29, 2013 L2: t Todays lecture:. L2: t Todays lecture:. measurements. L2: t Todays lecture:. measurements. s. L2: t Todays lecture:. measurements. s.. First we would like to define

More information

Statistics 202: Data Mining. c Jonathan Taylor. Week 8 Based in part on slides from textbook, slides of Susan Holmes. December 2, / 1

Statistics 202: Data Mining. c Jonathan Taylor. Week 8 Based in part on slides from textbook, slides of Susan Holmes. December 2, / 1 Week 8 Based in part on slides from textbook, slides of Susan Holmes December 2, 2012 1 / 1 Part I Clustering 2 / 1 Clustering Clustering Goal: Finding groups of objects such that the objects in a group

More information

Diploma Of Computing

Diploma Of Computing Diploma Of Computing Course Outline Campus Intake CRICOS Course Duration Teaching Methods Assessment Course Structure Units Melbourne Burwood Campus / Jakarta Campus, Indonesia March, June, October 022638B

More information

Cluster Analysis. Prof. Thomas B. Fomby Department of Economics Southern Methodist University Dallas, TX April 2008 April 2010

Cluster Analysis. Prof. Thomas B. Fomby Department of Economics Southern Methodist University Dallas, TX April 2008 April 2010 Cluster Analysis Prof. Thomas B. Fomby Department of Economics Southern Methodist University Dallas, TX 7575 April 008 April 010 Cluster Analysis, sometimes called data segmentation or customer segmentation,

More information

Clustering. Informal goal. General types of clustering. Applications: Clustering in information search and analysis. Example applications in search

Clustering. Informal goal. General types of clustering. Applications: Clustering in information search and analysis. Example applications in search Informal goal Clustering Given set of objects and measure of similarity between them, group similar objects together What mean by similar? What is good grouping? Computation time / quality tradeoff 1 2

More information

Iteration Reduction K Means Clustering Algorithm

Iteration Reduction K Means Clustering Algorithm Iteration Reduction K Means Clustering Algorithm Kedar Sawant 1 and Snehal Bhogan 2 1 Department of Computer Engineering, Agnel Institute of Technology and Design, Assagao, Goa 403507, India 2 Department

More information

IU Kokomo Career and Accessibility Center

IU Kokomo Career and Accessibility Center Creating an Accessible Syllabus in Microsoft Word Incorporating the use of headings and a table of contents (if needed) in your syllabus will make the document increasingly accessible to all students.

More information

Statistical Pattern Recognition

Statistical Pattern Recognition Statistical Pattern Recognition Features and Feature Selection Hamid R. Rabiee Jafar Muhammadi Spring 2012 http://ce.sharif.edu/courses/90-91/2/ce725-1/ Agenda Features and Patterns The Curse of Size and

More information