東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back to Search results for [ null ]

Switch To: Labeled | MARC Mode | ISBD

A categorical data clustering approa...

Liu, Yu.

Linked to FindBook

Google Book

Amazon

博客來

A categorical data clustering approach with expectation maximization and K-nearest neighbour.

Record Type:	Electronic resources : Monograph/item
Title/Author:	A categorical data clustering approach with expectation maximization and K-nearest neighbour./
Author:	Liu, Yu.
Description:	86 p.
Notes:	Source: Masters Abstracts International, Volume: 42-03, page: 0968.
Contained By:	Masters Abstracts International42-03.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ84575
ISBN:	0612845753

A categorical data clustering approach with expectation maximization and K-nearest neighbour.
Liu, Yu.

A categorical data clustering approach with expectation maximization and K-nearest neighbour. - 86 p.

Source: Masters Abstracts International, Volume: 42-03, page: 0968.

Thesis (M.Sc.)--University of Windsor (Canada), 2003.

In data mining, clustering analysis is an important research area. The goal of clustering is to group the objects in a data set into meaningful subclasses. Many algorithms have been designed for numerical data clustering and categorical data clustering respectively. However, very few people paid attention to the clustering problem of mixed-type data set which includes data objects that are of both numerical and categorical attributes. This thesis proposes an approach to the solution of this problem. The method is called CCEM-KNN which stands for Categorical data Clustering approach with Expectation Maximization and K-Nearest Neighbour. First, we apply a categorical clustering method over the categorical attributes of the whole data objects to get an initial partition. Then, we apply Expectation-Maximization classification algorithm based on this partition over the numerical attributes of each cluster to create a sample data set. Finally, we apply another classification algorithm K-Nearest Neighbour to perform classification which is based on the sample data set we created. In this way, we finally solve the mixed-type clustering problem. Experiment show that CCEM-KNN performs better than previous work and can also handle large data set well.

ISBN: 0612845753Subjects--Topical Terms:

626642
Computer Science.

A categorical data clustering approach with expectation maximization and K-nearest neighbour.
LDR:02120nmm 2200265 4500 001 1841258
005 20050825081239.5
008 130614s2003 eng d
020 $a 0612845753
035 $a (UnM)AAIMQ84575
035 $a AAIMQ84575
040 $a UnM $c UnM
100 1 $a Liu, Yu. $3 1259717
245 1 2 $a A categorical data clustering approach with expectation maximization and K-nearest neighbour.
300 $a 86 p.
500 $a Source: Masters Abstracts International, Volume: 42-03, page: 0968.
500 $a Adviser: Alioune Ngom.
502 $a Thesis (M.Sc.)--University of Windsor (Canada), 2003.
520 $a In data mining, clustering analysis is an important research area. The goal of clustering is to group the objects in a data set into meaningful subclasses. Many algorithms have been designed for numerical data clustering and categorical data clustering respectively. However, very few people paid attention to the clustering problem of mixed-type data set which includes data objects that are of both numerical and categorical attributes. This thesis proposes an approach to the solution of this problem. The method is called CCEM-KNN which stands for Categorical data Clustering approach with Expectation Maximization and K-Nearest Neighbour. First, we apply a categorical clustering method over the categorical attributes of the whole data objects to get an initial partition. Then, we apply Expectation-Maximization classification algorithm based on this partition over the numerical attributes of each cluster to create a sample data set. Finally, we apply another classification algorithm K-Nearest Neighbour to perform classification which is based on the sample data set we created. In this way, we finally solve the mixed-type clustering problem. Experiment show that CCEM-KNN performs better than previous work and can also handle large data set well.
590 $a School code: 0115.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Windsor (Canada). $3 1018526
773 0 $t Masters Abstracts International $g 42-03.
790 1 0 $a Ngom, Alioune, $e advisor
790 $a 0115
791 $a M.Sc.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ84575