NDLI: Improved k-medoids clustering based on cluster validity index and object density

Content Provider	IEEE Xplore Digital Library
Author	Pardeshi, B. Toshniwal, D.
Copyright Year	2010
Description	Author affiliation: Department of Electronics and Computer Engineering, Indian Institute of Technology Roorkee, 247667, India (Pardeshi, B.; Toshniwal, D.)
Abstract	Clustering is the process of classifying objects in to different groups by partitioning sets of data into a series of subsets called clusters. Clustering has taken its roots from algorithms like k-means and k-medoids. However conventional k-medoids clustering algorithm suffers from many limitations. Firstly, it needs to have prior knowledge about the number of cluster parameter k. Secondly, it also initially needs to make random selection of k representative objects and if these initial k medoids are not selected properly then natural cluster may not be obtained. Thirdly, it is also sensitive to the order of input dataset. First limitation was removed by using cluster validity index. Aiming at the second and third limitations of conventional k-medoids, we have proposed an improved k-medoids algorithm. In this work instead of random selection of initial k objects as medoids we have proposed a new technique for the initial representative object selection. The approach is based on density of objects. We find out set of objects which are densely populated and choose medoids from each of this obtained set. These k data objects selected as initial medoids are further used in clustering process. The validity of the proposed algorithm has been proved using iris and diet structure dataset to find the natural clusters in this datasets.
Starting Page	379
Ending Page	384
File Size	273923
Page Count	6
File Format	PDF
ISBN	9781424447909
DOI	10.1109/IADCC.2010.5422924
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-02-19
Publisher Place	India
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Intra-cluster variance Separation Compactness Dataset Data engineering Partitioning algorithms Pattern recognition Data mining Iris Image segmentation Centroid Density Cluster Validity Index Image analysis Partitioning Clustering algorithms Market research Pattern analysis Medoid
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An Efficient Density based Improved K-Medoids Clustering algorithm

K-medoids clustering technique using bat algorithm.

An efficient density based improved k- medoids clustering algorithm.

A hybrid outlier detection algorithm based on partitioning clustering and density measures

Scaling k-medoid algorithm for clustering large categorical dataset and its performance analysis

An improved k-medoids clustering algorithm

Computational Complexity between K-Means and K-Medoids Clustering Algorithms for Normal and Uniform Distributions of Data Points

Statistical cluster validity indexes to consider cohesion and separation

ALGORITHM TO INCREASE SCALABILITY AND EFFICIENCY FOR LARGE DATASET Gopi Gandhi

Improved k-medoids clustering based on cluster validity index and object density

Similar Documents

An Efficient Density based Improved K-Medoids Clustering algorithm

K-medoids clustering technique using bat algorithm.

An efficient density based improved k- medoids clustering algorithm.

A hybrid outlier detection algorithm based on partitioning clustering and density measures

Scaling k-medoid algorithm for clustering large categorical dataset and its performance analysis

An improved k-medoids clustering algorithm

Computational Complexity between K-Means and K-Medoids Clustering Algorithms for Normal and Uniform Distributions of Data Points

Statistical cluster validity indexes to consider cohesion and separation

ALGORITHM TO INCREASE SCALABILITY AND EFFICIENCY FOR LARGE DATASET Gopi Gandhi

Improved k-medoids clustering based on cluster validity index and object density