RTI uses cookies to offer you the best experience online. By clicking “accept” on this website, you opt in and you agree to the use of cookies. If you would like to know more about how RTI uses cookies and how to manage them please view our Privacy Policy here. You can “opt out” or change your mind by visiting: http://optout.aboutads.info/. Click “accept” to agree.
Padmanabhan, K., Harrison, B., Wilson, K., Warren, M. L., Bright, K., Mosiman, J., Kancherla, J., Phung, H., Miller, B., & Shamseldin, S. (2013). Cluster analysis. In N. F. Samatova, W. Hendrix, J. Jenkins, K. Padmanabhan, & A. Chakraborty (Eds.), Practical Graph Mining with R (1st ed., pp. 205-238). CRC Press.
In Chapter 9, classification is defined as the process of assigning discrete class labels to sets of data. However, what if we do not know what these class labels should be or do not have a training set of data with known relationships? In this case, we wish to group input data together by some measure of similarity. The process of dividing the data into subsets, where each element is as learning.