• Save
Data Mining: clustering and analysis
Upcoming SlideShare
Loading in...5
×

Like this? Share it with your network

Share

Data Mining: clustering and analysis

  • 4,738 views
Uploaded on

Data Mining: clustering and analysis

Data Mining: clustering and analysis

More in: Technology
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
No Downloads

Views

Total Views
4,738
On Slideshare
4,629
From Embeds
109
Number of Embeds
2

Actions

Shares
Downloads
0
Comments
2
Likes
3

Embeds 109

http://www.dataminingtools.net 62
http://dataminingtools.net 47

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide

Transcript

  • 1. Clustering and Analysis in Data Mining
  • 2. What is Clustering?
    The process of grouping a set of physical or abstract objects into classes of similar objects is called clustering.
  • 3. Why Clustering?
    Scalability
    Ability to deal with different types of attributes
    Discovery of clusters with arbitrary shape
    Minimal requirements for domain knowledge to determine input parameters
    Ability to deal with noisy data
    Incremental clustering and insensitivity to the order of input records:
    High dimensionality
    Constraint-based clustering
    Interpretability and usability
  • 4.  Data types in Cluster Analysis
    Data matrix (or object-by-variable structure)
    Interval-Scaled Variables
    Binary Variables
    A categorical variable
    A discrete ordinal variable
    A ratio-scaled variable
  • 5. Methods used in clustering:
    Partitioning method.
    Hierarchical method.
    Data Density based method.
    Grid based method.
    Model Based method.
  • 6. Hierarchical methods in clustering
    There are two types of hierarchical clustering methods:
    Agglomerative hierarchical clustering
    Divisive hierarchical clustering
  • 7. Agglomerative hierarchical clustering
    This bottom-up strategy starts by placing each object in its own cluster and then merges these atomic clusters into larger and larger clusters, until all of the objects are in a single cluster or until certain termination conditions are satisfied.
  • 8. Divisive hierarchical clustering
    This top-down strategy does the reverse of agglomerative hierarchical clustering by starting with all objects in one cluster. It subdivides the cluster into smaller and smaller pieces, until each object forms a cluster on its own or until it satisfies certain termination conditions, such as a desired number of clusters is obtained or the diameter of each cluster is within a certain threshold.
  • 9. Density-Based methods in clustering
    DBSCAN: A Density-Based Clustering Method Based on Connected Regions withSufficiently High Density
    OPTICS: Ordering Points to Identify the Clustering Structure
    DENCLUE: Clustering Based on Density Distribution Functions
  • 10. Grid-Based methods in clustering
    STING: Statistical information gridSTING is a grid-based multi resolution clustering technique in which the spatial area is divided into rectangular cells.
    Wave Cluster: Clustering Using Wavelet TransformationWave Cluster is a multi resolution clustering algorithm that first summarizes the data by imposing a multidimensional grid structure onto the data space. It then uses a wavelet transformation to transform the original feature space, finding dense regions in the transformed space
  • 11. Model-Based Clustering Methods
    Expectation-Maximization
    Conceptual Clustering
    Neural Network Approach
  • 12. Methods of Clustering High-Dimensional Data
    CLIQUE: A Dimension-Growth Subspace Clustering MethodCLIQUE (CLustering In QUEst) was the first algorithm proposed for dimension-growth subspace clustering in high-dimensional space.
    PROCLUS: A Dimension-Reduction Subspace Clustering MethodPROCLUS (PROjected CLUStering) is a typical dimension-reduction subspace clustering method. That is, instead of starting from single-dimensional spaces, it starts by finding an initial approximation of the clusters in the high-dimensional attribute space. Each dimension is then assigned a weight for each cluster, and the updated weights are used in the next iteration to regenerate the clusters.
  • 13. Constraint-Based Cluster Analysis
    Constraint-based clustering finds clusters that satisfy user-specified preferences or constraints, few categories of constraints are :
    Constraints on individual objects
    Constraints on the selection of clustering parameters
    Constraints on distance or similarity functions
    User-specified constraints on the properties of individual clusters
    Semi-supervised clustering based on “partial” supervision
  • 14. Visit more self help tutorials
    Pick a tutorial of your choice and browse through it at your own pace.
    The tutorials section is free, self-guiding and will not involve any additional support.
    Visit us at www.dataminingtools.net