Clustering by pairwise similarity
We proposed two novel clustering approaches, AFS and AFSSC, to address the problems in image clustering, semantic learning and manifold learning, respectively. By applying fuzzy membership function for data representation and similarity measure in AFS clustering, the pairwise affinity relationship i...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Curtin University
2016
|
| Online Access: | http://hdl.handle.net/20.500.11937/1939 |
| _version_ | 1848743812408541184 |
|---|---|
| author | Li, Qilin |
| author_facet | Li, Qilin |
| author_sort | Li, Qilin |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | We proposed two novel clustering approaches, AFS and AFSSC, to address the problems in image clustering, semantic learning and manifold learning, respectively. By applying fuzzy membership function for data representation and similarity measure in AFS clustering, the pairwise affinity relationship is revealed more clearly than the commonly used Euclidean distance. In AFSSC method, we formulate AFS for similarity matrix learning and map the matrix to a weighted graph in which the clustering problem can be solved by graph cut theory. |
| first_indexed | 2025-11-14T05:51:31Z |
| format | Thesis |
| id | curtin-20.500.11937-1939 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T05:51:31Z |
| publishDate | 2016 |
| publisher | Curtin University |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-19392017-02-20T06:39:41Z Clustering by pairwise similarity Li, Qilin We proposed two novel clustering approaches, AFS and AFSSC, to address the problems in image clustering, semantic learning and manifold learning, respectively. By applying fuzzy membership function for data representation and similarity measure in AFS clustering, the pairwise affinity relationship is revealed more clearly than the commonly used Euclidean distance. In AFSSC method, we formulate AFS for similarity matrix learning and map the matrix to a weighted graph in which the clustering problem can be solved by graph cut theory. 2016 Thesis http://hdl.handle.net/20.500.11937/1939 en Curtin University fulltext |
| spellingShingle | Li, Qilin Clustering by pairwise similarity |
| title | Clustering by pairwise similarity |
| title_full | Clustering by pairwise similarity |
| title_fullStr | Clustering by pairwise similarity |
| title_full_unstemmed | Clustering by pairwise similarity |
| title_short | Clustering by pairwise similarity |
| title_sort | clustering by pairwise similarity |
| url | http://hdl.handle.net/20.500.11937/1939 |