DETERMINING THE NUMBER OF CLUSTERS FOR A K-MEANS CLUSTERING ALGORTIHM
Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 5
Abstract
Clustering is a process used to divide data into a number of groups. All data points have some mathematical parameter according to which grouping can be done. For instance, if we have a number of points on a twodimensional grid, the x and y coordinates of the points are the parameters according to which clustering is done. If the k-means algorithm is run with k=3, the data points will be split into 3 groups such that the sum of the variance for each group is minimized. The problem here, of course, is the choice of the parameter k. We may get a much better modeling of the data if we split the data points into 2 or 4 groups. Determining the ‘best’ value of k is a broad problem – there is no obvious parameter according to which this can be done. This paper looks at a new, efficient approach to determine the number of clusters.
Authors and Affiliations
Abhijit Kane
Keywords
Related Articles
- EP ID EP140620
- DOI -
- Views 126
- Downloads 0
DOMESTIC INTRUDER SYSTEM
Throughout history, humans have sought to protect their life, property and possessions. In early societies, guards, watchdogs, traps and even noisemakers provided security. Fire was used to baffle wild animals and keep t...
RELATIVE QUERY RESULTS RANKING FOR ONLINE USERS IN WEB DATABASES
To handle with the problem of so many-answers replied from an online Web database in response to a relative query, this paper proposes a unique approach to rank the similar query results. Depending upon the on the databa...
NETWORK INTRUSION DETECTION SYSTEM USING REDUCED DIMENSIONALITY
Intrusion Detection System (IDS) is the science of detection of malicious activity on a computer network and the basic driver for network security. It is defined as a process of monitoring the events occurring in a compu...
SCHEDULING OF MECHANICS IN AUTOMOBILE REPAIR SHOPS USING ANN
Scheduling problems are NP – Hard combinatorial optimization problems, since many algorithms have been developed which offers new promising insights for solving resource allocation problems. Considering the problems face...
SEAMLESS MULTIMEDIA COMMUNICATION OVER HETEROGENEOUS ETWORKS: A LINUX DAEMON APPROACH
Our proposed solution is a Linux daemon approach to vertical handoff for heterogeneous networks. We develop a daemon that accomplishes the handoff process between various radio interfaces supporting IP. This addresses se...