Topic 5: Cluster Analysis

Slides:



Advertisements
Similar presentations
CLUSTERING.
Advertisements

Copyright Jiawei Han, modified by Charles Ling for CS411a
What is Cluster Analysis?
Clustering Basic Concepts and Algorithms
PARTITIONAL CLUSTERING
CS690L: Clustering References:
MIS2502: Data Analytics Clustering and Segmentation.
Data Mining Techniques: Clustering
Clustering II.
Clustering.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Slide 1 EE3J2 Data Mining Lecture 16 Unsupervised Learning Ali Al-Shahib.
Cluster Analysis.
What is Cluster Analysis
Segmentação (Clustering) (baseado nos slides do Han)
1 Chapter 8: Clustering. 2 Searching for groups Clustering is unsupervised or undirected. Unlike classification, in clustering, no pre- classified data.
CLUSTERING (Segmentation)
Clustering Ram Akella Lecture 6 February 23, & 280I University of California Berkeley Silicon Valley Center/SC.
What is Cluster Analysis?
CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website:
Unsupervised Learning. CS583, Bing Liu, UIC 2 Supervised learning vs. unsupervised learning Supervised learning: discover patterns in the data that relate.
Cluster Analysis Part I
1 Lecture 10 Clustering. 2 Preview Introduction Partitioning methods Hierarchical methods Model-based methods Density-based methods.
1 Motivation Web query is usually two or three words long. –Prone to ambiguity –Example “keyboard” –Input device of computer –Musical instruments How can.
Unsupervised Learning. Supervised learning vs. unsupervised learning.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Clustering COMP Research Seminar BCB 713 Module Spring 2011 Wei Wang.
COMP Data Mining: Concepts, Algorithms, and Applications 1 K-means Arbitrarily choose k objects as the initial cluster centers Until no change,
Cluster Analysis Potyó László. Cluster: a collection of data objects Similar to one another within the same cluster Similar to one another within the.
Clustering Clustering is a technique for finding similarity groups in data, called clusters. I.e., it groups data instances that are similar to (near)
Clustering.
Slide 1 EE3J2 Data Mining Lecture 18 K-means and Agglomerative Algorithms.
Data Mining Algorithms
Cluster Analysis Dr. Bernard Chen Assistant Professor Department of Computer Science University of Central Arkansas.
Mr. Idrissa Y. H. Assistant Lecturer, Geography & Environment Department of Social Sciences School of Natural & Social Sciences State University of Zanzibar.
Cluster Analysis Dr. Bernard Chen Ph.D. Assistant Professor Department of Computer Science University of Central Arkansas Fall 2010.
Clustering Wei Wang. Outline What is clustering Partitioning methods Hierarchical methods Density-based methods Grid-based methods Model-based clustering.
1 Similarity and Dissimilarity Between Objects Distances are normally used to measure the similarity or dissimilarity between two data objects Some popular.
Cluster Analysis What is Cluster Analysis? Types of Data in Cluster Analysis A Categorization of Major Clustering Methods Partitioning Methods.
Nearest Neighbour and Clustering. Nearest Neighbour and clustering Clustering and nearest neighbour prediction technique was one of the oldest techniques.
CLUSTER ANALYSIS. Cluster Analysis  Cluster analysis is a major technique for classifying a ‘mountain’ of information into manageable meaningful piles.
Topic 4: Cluster Analysis Analysis of Customer Behavior and Service Modeling.
COMP24111 Machine Learning K-means Clustering Ke Chen.
MIS2502: Data Analytics Clustering and Segmentation Jeremy Shafer
GROUP 6 KIIZA FELIX 2013/BIT/110 MUHANGUZI EUSTUS 2013/BIT/104/PS TUGIROKWIKIRIZA FLAVIA 2013/BIT/111/PS HAMSTONE NATOSHA 2013/BIT/122/PS GILBERT MUMBERE.
Cluster Analysis This work is created by Dr. Anamika Bhargava, Ms. Pooja Kaul, Ms. Priti Bali and Ms. Rajnipriya Dhawan and licensed under a Creative Commons.
Data Mining Comp. Sc. and Inf. Mgmt. Asian Institute of Technology
What Is Cluster Analysis?
Data Mining: Basic Cluster Analysis
Data Mining: Concepts and Techniques (3rd ed.) — Chapter 10 —
CSC 4510/9010: Applied Machine Learning
Data Mining--Clustering
Slides by Eamonn Keogh (UC Riverside)
Data Mining K-means Algorithm
Data Mining -Cluster Analysis. What is a clustering ? Clustering is the process of grouping data into classes, or clusters, so that objects within a cluster.
Topic 3: Cluster Analysis
©Jiawei Han and Micheline Kamber Department of Computer Science
CSE 5243 Intro. to Data Mining
MIS2502: Data Analytics Clustering and Segmentation
Self organizing networks
Fuzzy Clustering.
Dr. Unnikrishnan P.C. Professor, EEE
MIS2502: Data Analytics Clustering and Segmentation
Data Mining 資料探勘 分群分析 (Cluster Analysis) Min-Yuh Day 戴敏育
DATA MINING Introductory and Advanced Topics Part II - Clustering
Data Mining: Clustering
CSCI N317 Computation for Scientific Applications Unit Weka
Análisis de Cluster.
MIS2502: Data Analytics Clustering and Segmentation
MIS2502: Data Analytics Clustering and Segmentation
Clustering Wei Wang.
Presentation transcript:

Topic 5: Cluster Analysis

What is Cluster Analysis? Cluster: a collection of data objects Similar to one another within the same cluster Dissimilar to the objects in other clusters Cluster Analysis Grouping a set of data objects into clusters Typical applications: As a stand-alone tool to get insight into data distribution As a preprocessing step for other algorithms

Clustering income education age

General Applications of Clustering Spatial data analysis Create thematic maps in GIS by clustering feature spaces. Detect spatial clusters and explain them in spatial data mining. Image Processing Pattern recognition WWW Document classification Cluster Web-log data to discover groups of similar access patterns

Examples of Clustering Applications Marketing: Help marketers discover distinct groups in their customer bases, and then use this knowledge to develop targeted marketing programs. Land use: Identification of areas of similar land use in an earth observation database. Insurance: Identifying groups of motor insurance policy holders with a high average claim cost. City-planning: Identifying groups of houses according to their house type, value, and geographical location.

What is Good Clustering? A good clustering method will produce high quality clusters with High intra-class similarity Low inter-class similarity The quality of a clustering result depends on both the similarity measure used by the method and its implementation. The quality of a clustering method is also measured by its ability to discover hidden patterns.

Clustering Methods (I) Partitioning Method Construct various partitions and then evaluate them by some criterion, e.g., minimizing the sum of square errors K-means Hierarchical Method Create a hierarchical decomposition of the set of data (or objects) using some criterion Density-based Method Based on connectivity and density functions

Similarity and Dissimilarity Between Objects Distances are normally used to measure the similarity or dissimilarity between two data objects Some popular ones include: Minkowski distance where i = (xi1, xi2, …, xip) and j = (xj1, xj2, …, xjp) are two p-dimensional data objects, and q is a positive integer

Data Structures in Clustering Data matrix An Example 4 points A(1, 2) , C(3, 4) B(2, 1) , D(4, 3)

The K-Means Clustering Method Given k, the k-means algorithm is implemented in 4 steps: Step 1: Partition objects into k nonempty subsets Step 2: Compute seed points as the centroids of the clusters of the current partition. The centroid is the center (mean point) of the cluster. Step 3: Assign each object to the cluster with the nearest seed point. Step 4: Go back to Step 2, stop when no more new assignment.

K-Means Clustering

Example of the K-Means Clustering Method 1 2 3 4 5 6 7 8 9 10 10 9 8 7 6 5 Assign each objects to the most similar centroid Update the cluster means 4 3 2 1 1 2 3 4 5 6 7 8 9 10 Re-assign Re-assign Given k = 2: Arbitrarily choose k object as initial cluster centroid Update the cluster means

Comments on the k-Means Method Strength Easy to Implement and Relatively efficient Often terminates at a local optimum. The global optimum may be found using techniques such as, genetic algorithms Weakness Applicable only when mean is defined, then what about categorical data? Need to specify k, the number of clusters, in advance Unable to handle noisy data and outliers