Scribd
Upload
6 views2 pages

Unit 4

Unit IV covers various aspects of clustering in data mining, including application areas, typical requirements, and different clustering methods such as partitioning, hierarchical, density-based, and grid-based algorithms. It also discusses evaluation techniques for clustering, challenges in high-dimensional data clustering, and methods for outlier detection and analysis. Additionally, the unit addresses clustering with constraints and provides insights into statistical and proximity-based approaches.

Uploaded by

M style satham
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views2 pages

Unit 4

Unit IV covers various aspects of clustering in data mining, including application areas, typical requirements, and different clustering methods such as partitioning, hierarchical, density-based, and grid-based algorithms. It also discusses evaluation techniques for clustering, challenges in high-dimensional data clustering, and methods for outlier detection and analysis. Additionally, the unit addresses clustering with constraints and provides insights into statistical and proximity-based approaches.

Uploaded by

M style satham
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

UNIT IV

4.1 INTRODUCTION

4.1.1 application areas of clustering

4.1.2 typical requirements of clustering data mining

4.2 TYPES CLUISTERING METHODS

4.3 ALGORITHMS BASED ON PARTITIONING METHOD

4.3.1 k-means algorithm

4.3.2 PAM algorithm/ k- mediods algorithm

4.4 ALGORITHMS BASED ON HIERARCHICAL METHODS

4.4.1 Birch

4.4.2 CURE

4.5 ALGORITHM BASERA DENSITY BASED PARTIONING METHOD

4.5.1 DBSCAN

4.5.2 DENCLUE

4.5.3 Advantages Of DENCLUE Algorithm

4.6 ALGORITHM BASED ON GRID BASED PARTITONING METHOD

4.6.1 STING (Statistical Information Grid)

4.6.2 Wave cluster

4.7 EVALUATION OF CLUSTERING

4.7.1 Assesimg clustering tendency

4.7.2 determing the number of clusters

4.7.3 measuring clustering quality

4.8 CLUSTERING HIGH -DIMENSIONAL DATA

4.8.1 Clustering high dimensional data problems challenges and major methodology

4.8.2 sab space clustering methods

4.8.3 biclustering
4.8.4 diminished radiation method and spectaral clustering

4.9 CLUST GRAPH AND NETWORK DATA

4.9.1 application and challenges

4.9.2 similarity Measures

4.9.3 graph clustering methods

4.10 CLUSTERING WITH CONSTAINTS

4.10.1 Categorisation of constraints

4.10.2 Methods for clustering with constraints

4.11 OUTLAYERS AND OUTLIER ANALYSIS

4.11.1 types of outliers

4.12 Outlier Dedication Methods

4.12.1 supervisor semi supervised and supervisor methods

4.12.2 statical methods proximity based methods and clust based methods

4.13 STATICAL APPROACHES

4.13.1 parametric methods

4.13.2 non parametric methods

4.14 PROXIMITY BASED APPROAC

4.14.1 distance based out liar dedication and nested loop method

4.15 CLUSTERING BASED APPROACHES

4.16 CLASSIFICATION BASED APPROACHES

4.17 OUTLIER MEDICATION IN HIGH DIMENSIONAL DATA

4.171.1 extending conventional outlier dedication

4.17.2 finding out liar in subspace

4.17.3 modelling high definition outiers

You might also like