- Title
- Nonsmooth optimization models and algorithms for data clustering and visualization
- Creator
- Mohebi, Ehsan
- Date
- 2015
- Type
- Text; Thesis
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/77001
- Identifier
- vital:7638
- Abstract
- Cluster analysis deals with the problem of organization of a collection of patterns into clusters based on a similarity measure. Various distance functions can be used to define this measure. Clustering problems with the similarity measure defined by the squared Euclidean distance have been studied extensively over the last five decades. However, problems with other Minkowski norms have attracted significantly less attention. The use of different similarity measures may help to identify different cluster structures of a data set. This in turn may help to significantly improve the decision making process. High dimensional data visualization is another important task in the field of data mining and pattern recognition. To date, the principal component analysis and the self-organizing maps techniques have been used to solve such problems. In this thesis we develop algorithms for solving clustering problems in large data sets using various similarity measures. Such similarity measures are based on the squared L; Doctor of Philosophy
- Publisher
- Federation University Australia
- Rights
- Copyright Ehsan Mohebi
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- Cluster analysis; Clustering problems; Cluster structure; Data set; High dimensional data visualization; Algorithms; Similarity measures
- Full Text
- Thesis Supervisor
- Bagirov, Adil
- Hits: 1568
- Visitors: 1620
- Downloads: 116
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Australian Digital Thesis | 8 MB | Adobe Acrobat PDF | View Details Download |