Articles via Databases
Articles via Journals
Online Catalog
E-books
Research & Information Literacy
Interlibrary loan
Theses & Dissertations
Collections
Policies
Services
About / Contact Us
Administration
Littman Architecture Library
This site will be removed in January 2019, please change your bookmarks.
This page will redirect to https://digitalcommons.njit.edu/theses/2400/ in 5 seconds

The New Jersey Institute of Technology's
Electronic Theses & Dissertations Project

Title: Development of an adaptive fuzzy shell clustering algorithm and validity measures
Author: Bhaswan, Kurra
View Online: njit-etd1991-081
(ix, 71 pages ~ 2.5 MB pdf)
Department: Department of Mechanical and Industrial Engineering
Degree: Master of Science
Program: Mechanical Engineering
Document Type: Thesis
Advisory Committee: Dave, Rajesh N. (Committee chair)
Rosato, Anthony D. (Committee member)
Fischer, Ian Sanford (Committee member)
Date: 1991-05
Keywords: Fuzzy algorithms
Cluster analysis -- Computer programs
Availability: Unrestricted
Abstract:

In objective functional based fuzzy clustering algorithms the weighted sum of the distances of the feature vectors from cluster prototype are minimized. The fuzzy memberships are utilized as weighing factors. The cluster prototype can be a point or a line or a plane, etc. This work extends the recent concept of using curved prototypes by utilizing the Adaptive Norm Theorem proposed by Dave1 to develop an algorithm for the detection of fuzzy hyper-ellipsoidal shell prototypes. The Objective functional associates a norm for each cluster in which to measure the proximity of the shell prototype adaptively. The resulting implementation necessitates solving a set of non-linear equations through the application of the Newton's method which requires good starting values as a pre-requisite for convergence. A robust initialization scheme is presented to obtain good starting values for the partition and the prototype. The kind of substructures encountered are isolated and categorized into two groups and appropriate strategies suggested. Two schemes are suggested for the initial partition and the spatial properties of the domain are used to generate starting values for the prototypes. An iterative algorithm is outlined to obtain the starting guesses for the Newton's method. The algorithm is coerced to find a good initial guess by the use of different prototypes at different phases during its operation. Examples typifying substructures commonly encountered are shown to demonstrate the combined results of the initialization and the subsequent application of the AFCS algorithm. The problem of validating the number of subsets present in the data and the evaluation of the resulting substructure is also addressed. The existing validity measures for fuzzy clustering are surveyed and are shown to be partition based. Three new measures specifically designed to validate the shell substructure are introduced. Several examples are included to demonstrate the superiority of the new measures over the existing measures.

1 R. N. Dave and K. J. Patel, FCES Clustering Algorithm and detection of ellipsoidal shapes, Proc. of the SPIE Conf. on Intelligent Robots and Computer Vision IX , Boston, pp. 320-333, Nov.


If you have any questions please contact the ETD Team, libetd@njit.edu.

 
ETD Information
Digital Commons @ NJIT
Theses and DIssertations
ETD Policies & Procedures
ETD FAQ's
ETD home

Request a Scan
NDLTD

NJIT's ETD project was given an ACRL/NJ Technology Innovation Honorable Mention Award in spring 2003