An Approximate Fisher Linear Discriminant Analysis for Clustering
碩士 === 國立交通大學 === 電控工程研究所 === 99 === In the era we get the large amounts of data more and more easily, the data clustering becomes more and more important. The difficulty of clustering is that every case has many statistics which call features, how we choose these features or their combination will...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/27461978138598350716 |
id |
ndltd-TW-099NCTU5449059 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-099NCTU54490592015-10-13T20:37:10Z http://ndltd.ncl.edu.tw/handle/27461978138598350716 An Approximate Fisher Linear Discriminant Analysis for Clustering 一近似的費雪線性鑑別分析於分群的應用 Yang, Cheng-Gang 楊承綱 碩士 國立交通大學 電控工程研究所 99 In the era we get the large amounts of data more and more easily, the data clustering becomes more and more important. The difficulty of clustering is that every case has many statistics which call features, how we choose these features or their combination will effect the clustering result extremely. Principal component analysis (PCA) is one of the common feature extraction methods, but extracting the components of maximum variance is uncertain best for both classification and clustering. This thesis focuses on improving the feature extraction, we combine Fisher linear discriminant (FLD) which can extract the features excellently for classification and the traditional K-means clustering to an approximate Fisher linear discriminant (AFD) algorithm. Let the K-means clustering result is the known class, then use FLD to find the best features, after that, use these features to cluster and then do FLD again, we also get the best features for this new clustering result. Repeat above process until convergence. This thesis chooses two kinds of the data, Iris and Wine, that have three classes to do experiment, and compare the clustering accuracy by the real class. By experiment we find that even though the components of maximum variance can contain the most information of the original data, but it is not useful for clustering. Extracting the key features by AFD algorithm to cluster is better than PCA, and in the same number of features AFD algorithm has better clustering result than PCA. Jou, Chi-Cheng 周志成 2011 學位論文 ; thesis 47 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 電控工程研究所 === 99 === In the era we get the large amounts of data more and more easily, the data clustering becomes more and more important. The difficulty of clustering is that every case has many statistics which call features, how we choose these features or their combination will effect the clustering result extremely. Principal component analysis (PCA) is one of the common feature extraction methods, but extracting the components of maximum variance is uncertain best for both classification and clustering. This thesis focuses on improving the feature extraction, we combine Fisher linear discriminant (FLD) which can extract the features excellently for classification and the traditional K-means clustering to an approximate Fisher linear discriminant (AFD) algorithm. Let the K-means clustering result is the known class, then use FLD to find the best features, after that, use these features to cluster and then do FLD again, we also get the best features for this new clustering result. Repeat above process until convergence. This thesis chooses two kinds of the data, Iris and Wine, that have three classes to do experiment, and compare the clustering accuracy by the real class. By experiment we find that even though the components of maximum variance can contain the most information of the original data, but it is not useful for clustering. Extracting the key features by AFD algorithm to cluster is better than PCA, and in the same number of features AFD algorithm has better clustering result than PCA.
|
author2 |
Jou, Chi-Cheng |
author_facet |
Jou, Chi-Cheng Yang, Cheng-Gang 楊承綱 |
author |
Yang, Cheng-Gang 楊承綱 |
spellingShingle |
Yang, Cheng-Gang 楊承綱 An Approximate Fisher Linear Discriminant Analysis for Clustering |
author_sort |
Yang, Cheng-Gang |
title |
An Approximate Fisher Linear Discriminant Analysis for Clustering |
title_short |
An Approximate Fisher Linear Discriminant Analysis for Clustering |
title_full |
An Approximate Fisher Linear Discriminant Analysis for Clustering |
title_fullStr |
An Approximate Fisher Linear Discriminant Analysis for Clustering |
title_full_unstemmed |
An Approximate Fisher Linear Discriminant Analysis for Clustering |
title_sort |
approximate fisher linear discriminant analysis for clustering |
publishDate |
2011 |
url |
http://ndltd.ncl.edu.tw/handle/27461978138598350716 |
work_keys_str_mv |
AT yangchenggang anapproximatefisherlineardiscriminantanalysisforclustering AT yángchénggāng anapproximatefisherlineardiscriminantanalysisforclustering AT yangchenggang yījìnshìdefèixuěxiànxìngjiànbiéfēnxīyúfēnqúndeyīngyòng AT yángchénggāng yījìnshìdefèixuěxiànxìngjiànbiéfēnxīyúfēnqúndeyīngyòng AT yangchenggang approximatefisherlineardiscriminantanalysisforclustering AT yángchénggāng approximatefisherlineardiscriminantanalysisforclustering |
_version_ |
1718049590839607296 |