Support Vector Clustering with an Optimal Parameter Search Method and Its Application to Emotion Classification of Music
博士 === 國立成功大學 === 電機工程學系碩博士班 === 97 === Support vector clustering (SVC) has been widely researched in both theoretical development and practical applications due to its outstanding features—arbitrary-shaped cluster representations. SVC involves three main steps: 1) finding the hyper-sphere by solvin...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/61693266273289932298 |
id |
ndltd-TW-097NCKU5442043 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-097NCKU54420432016-05-04T04:17:06Z http://ndltd.ncl.edu.tw/handle/61693266273289932298 Support Vector Clustering with an Optimal Parameter Search Method and Its Application to Emotion Classification of Music 具最佳參數搜尋機制之支持向量群聚演算法及其音樂情緒分類之應用 Jen-Chieh Chiang 姜仁傑 博士 國立成功大學 電機工程學系碩博士班 97 Support vector clustering (SVC) has been widely researched in both theoretical development and practical applications due to its outstanding features—arbitrary-shaped cluster representations. SVC involves three main steps: 1) finding the hyper-sphere by solving the Wolfe dual optimization problem, 2) identifying the clusters by labeling the data points with cluster labels, and 3) searching a satisfactory clustering outcome by tuning kernel parameters. These three steps make using SVC to process large datasets inefficient and time-consuming. Based on the above problems, an efficient data preprocessing procedure is first proposed to eliminate insignificant data points from training datasets without significantly affecting the final cluster configuration. Since the size of dataset is reduced, the computational burden for solving the optimization problem as well as cluster labeling can be greatly decreased. Next, an optimal parameter search method is proposed to find the suitable parameter of kernel functions and soft-margin constant of Lagrangian functions of SVC. This dissertation enables SVC to identify optimal cluster configurations with a less number of executions. The applicability of the proposed approach to real-world applications is validated through music emotion classification problems. The classification process of the music samples includes feature extraction, features selection, feature transformation, and classification. Each of these processes possesses its own significant and plays an important role in music emotion classification. Finally, the effectiveness of the proposed approach is successfully validated by computer simulations on benchmark datasets and real-world applications. Jeen-Shing Wang 王振興 2009 學位論文 ; thesis 124 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
博士 === 國立成功大學 === 電機工程學系碩博士班 === 97 === Support vector clustering (SVC) has been widely researched in both theoretical development and practical applications due to its outstanding features—arbitrary-shaped cluster representations. SVC involves three main steps: 1) finding the hyper-sphere by solving the Wolfe dual optimization problem, 2) identifying the clusters by labeling the data points with cluster labels, and 3) searching a satisfactory clustering outcome by tuning kernel parameters. These three steps make using SVC to process large datasets inefficient and time-consuming. Based on the above problems, an efficient data preprocessing procedure is first proposed to eliminate insignificant data points from training datasets without significantly affecting the final cluster configuration. Since the size of dataset is reduced, the computational burden for solving the optimization problem as well as cluster labeling can be greatly decreased. Next, an optimal parameter search method is proposed to find the suitable parameter of kernel functions and soft-margin constant of Lagrangian functions of SVC. This dissertation enables SVC to identify optimal cluster configurations with a less number of executions. The applicability of the proposed approach to real-world applications is validated through music emotion classification problems. The classification process of the music samples includes feature extraction, features selection, feature transformation, and classification. Each of these processes possesses its own significant and plays an important role in music emotion classification. Finally, the effectiveness of the proposed approach is successfully validated by computer simulations on benchmark datasets and real-world applications.
|
author2 |
Jeen-Shing Wang |
author_facet |
Jeen-Shing Wang Jen-Chieh Chiang 姜仁傑 |
author |
Jen-Chieh Chiang 姜仁傑 |
spellingShingle |
Jen-Chieh Chiang 姜仁傑 Support Vector Clustering with an Optimal Parameter Search Method and Its Application to Emotion Classification of Music |
author_sort |
Jen-Chieh Chiang |
title |
Support Vector Clustering with an Optimal Parameter Search Method and Its Application to Emotion Classification of Music |
title_short |
Support Vector Clustering with an Optimal Parameter Search Method and Its Application to Emotion Classification of Music |
title_full |
Support Vector Clustering with an Optimal Parameter Search Method and Its Application to Emotion Classification of Music |
title_fullStr |
Support Vector Clustering with an Optimal Parameter Search Method and Its Application to Emotion Classification of Music |
title_full_unstemmed |
Support Vector Clustering with an Optimal Parameter Search Method and Its Application to Emotion Classification of Music |
title_sort |
support vector clustering with an optimal parameter search method and its application to emotion classification of music |
publishDate |
2009 |
url |
http://ndltd.ncl.edu.tw/handle/61693266273289932298 |
work_keys_str_mv |
AT jenchiehchiang supportvectorclusteringwithanoptimalparametersearchmethodanditsapplicationtoemotionclassificationofmusic AT jiāngrénjié supportvectorclusteringwithanoptimalparametersearchmethodanditsapplicationtoemotionclassificationofmusic AT jenchiehchiang jùzuìjiācānshùsōuxúnjīzhìzhīzhīchíxiàngliàngqúnjùyǎnsuànfǎjíqíyīnlèqíngxùfēnlèizhīyīngyòng AT jiāngrénjié jùzuìjiācānshùsōuxúnjīzhìzhīzhīchíxiàngliàngqúnjùyǎnsuànfǎjíqíyīnlèqíngxùfēnlèizhīyīngyòng |
_version_ |
1718255564764479488 |