A Novel Efficient Density-Based Clustering Algorithm Using Cross and Rotating Expansion Technique
碩士 === 國立屏東科技大學 === 資訊管理系所 === 101 === This thesis develops a novel clustering technique called SPY_DBSACN. It presents a new density-based clustering technique with diagonal sampling and a new way of fold and rotation. The SPY_DBSCAN’s expansion without selecting data points to increase computation...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/58781996689408058679 |
id |
ndltd-TW-101NPUS5396018 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-101NPUS53960182016-12-22T04:18:36Z http://ndltd.ncl.edu.tw/handle/58781996689408058679 A Novel Efficient Density-Based Clustering Algorithm Using Cross and Rotating Expansion Technique 一個使用交叉旋轉技術之新高效率密度式分群技術 She, Po-Yi 佘柏毅 碩士 國立屏東科技大學 資訊管理系所 101 This thesis develops a novel clustering technique called SPY_DBSACN. It presents a new density-based clustering technique with diagonal sampling and a new way of fold and rotation. The SPY_DBSCAN’s expansion without selecting data points to increase computation cost and it may considerably reduce time cost. The experimental results confirm that the proposed technique has very high clustering accuracy and noise filtering rate, and is faster than the well-known density-based data clustering approaches such as DBSCAN, IDBSCAN and KIDBSCAN schemes. The thesis has the merits as follows: 1) the proposed method utilizes cross method to form similarly rotate expansion of clustering, 2) the proposed approach can decrease the data points in the seeds so it can reduce the time of processing. According to the simulation results, the SPY_DBSCAN may lower about sixty-seven percent time cost for performing data clustering comparing with IDBSCAN in 100,000 points dataset experiment. It even decreases more than eighty-six percent time cost for conducting data clustering comparing with DBSCAN in more than 100,000 points dataset experiment, 3) the SPY_DBSCAN has very high clustering accuracy and noise filtering rate, both close to one hundred percent, 4) the proposed approach is very simple and easily to apply in numerous related fields. Tsai, Cheng-Fa 蔡正發 2013 學位論文 ; thesis 87 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立屏東科技大學 === 資訊管理系所 === 101 === This thesis develops a novel clustering technique called SPY_DBSACN. It presents a new density-based clustering technique with diagonal sampling and a new way of fold and rotation. The SPY_DBSCAN’s expansion without selecting data points to increase computation cost and it may considerably reduce time cost. The experimental results confirm that the proposed technique has very high clustering accuracy and noise filtering rate, and is faster than the well-known density-based data clustering approaches such as DBSCAN, IDBSCAN and KIDBSCAN schemes.
The thesis has the merits as follows: 1) the proposed method utilizes cross method to form similarly rotate expansion of clustering, 2) the proposed approach can decrease the data points in the seeds so it can reduce the time of processing. According to the simulation results, the SPY_DBSCAN may lower about sixty-seven percent time cost for performing data clustering comparing with IDBSCAN in 100,000 points dataset experiment. It even decreases more than eighty-six percent time cost for conducting data clustering comparing with DBSCAN in more than 100,000 points dataset experiment, 3) the SPY_DBSCAN has very high clustering accuracy and noise filtering rate, both close to one hundred percent, 4) the proposed approach is very simple and easily to apply in numerous related fields.
|
author2 |
Tsai, Cheng-Fa |
author_facet |
Tsai, Cheng-Fa She, Po-Yi 佘柏毅 |
author |
She, Po-Yi 佘柏毅 |
spellingShingle |
She, Po-Yi 佘柏毅 A Novel Efficient Density-Based Clustering Algorithm Using Cross and Rotating Expansion Technique |
author_sort |
She, Po-Yi |
title |
A Novel Efficient Density-Based Clustering Algorithm Using Cross and Rotating Expansion Technique |
title_short |
A Novel Efficient Density-Based Clustering Algorithm Using Cross and Rotating Expansion Technique |
title_full |
A Novel Efficient Density-Based Clustering Algorithm Using Cross and Rotating Expansion Technique |
title_fullStr |
A Novel Efficient Density-Based Clustering Algorithm Using Cross and Rotating Expansion Technique |
title_full_unstemmed |
A Novel Efficient Density-Based Clustering Algorithm Using Cross and Rotating Expansion Technique |
title_sort |
novel efficient density-based clustering algorithm using cross and rotating expansion technique |
publishDate |
2013 |
url |
http://ndltd.ncl.edu.tw/handle/58781996689408058679 |
work_keys_str_mv |
AT shepoyi anovelefficientdensitybasedclusteringalgorithmusingcrossandrotatingexpansiontechnique AT shébǎiyì anovelefficientdensitybasedclusteringalgorithmusingcrossandrotatingexpansiontechnique AT shepoyi yīgèshǐyòngjiāochāxuánzhuǎnjìshùzhīxīngāoxiàolǜmìdùshìfēnqúnjìshù AT shébǎiyì yīgèshǐyòngjiāochāxuánzhuǎnjìshùzhīxīngāoxiàolǜmìdùshìfēnqúnjìshù AT shepoyi novelefficientdensitybasedclusteringalgorithmusingcrossandrotatingexpansiontechnique AT shébǎiyì novelefficientdensitybasedclusteringalgorithmusingcrossandrotatingexpansiontechnique |
_version_ |
1718404829439590400 |