|Table of Contents|

Research of Clustering Initial Center Selection(PDF)

《南京师大学报（自然科学版）》[ISSN:1001-4616/CN:32-1239/N]

Issue:
2010年04期
Page:
161-165
Research Field:
计算机科学
Publishing date:

Info

Title:
Research of Clustering Initial Center Selection
Author(s):
Yang Tianxia; Wang Zhihe; Wang Hua; Wang Lingyun
College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,China
Keywords:
K-m eans;  sequentia l patterns;  H uffm an tree;  cluster ing;  in itial cen ter
PACS:
TP311.13
DOI:
-
Abstract:
The paper stud ied the problem o f recluster ing and red iscover ing in the sequence da tabase on the basis o f the resu lts o f sequentia l patte rn m ining. A im ing at this shortcom ing tha t it could lead to the instab ility o f c lustering results to se lect random ly the initial fo ca l po ints in the ex isting K-m eans c luster ing a lgo rithm, an in itia l center se lec tion a lgo rithm nam ed K-SPAM ( K-m eans algor ithm of sequence pa ttern m in ing based on theH uffm anM ethod) algor ithm was proposed. It was based on Hu ffm an idea. The a lgo rithm cou ld reduce probability of lo ca l optim um to a certa in ex tent. M o reover, a h ighly effic ient / and0 and / o r0 operato rs w ere adopted to ca lculate sim ilar ity betw een pa irs o f sequences. To do so could g rea tly im prove the ex ecution effic iency of the a lgor ithm.

References:

[ 1] Ag rawa l A, Sr ikant R. M ining sequential pa tterns[ C ] / / Taipe :i Proc o f the 11 st Int Conf on Data Eng inee ring, 1995: 3-14.
[ 2] Kaufman L, Roueeeuw P J. Finding Groups in Data: An Introduc tion to C luster Analysis[M ]. New York: JohnW iley& Sons, 1990.
[ 3] Mo rzy T, W o jciechow sk iM, Zakrzew iczM. Sca lab le h ierar-ch ica l c luste ring m ethod for sequences of ca tego rical va lues [ C] / /Proc o f the 5th Pac ific-Asia Conference on Know ledg eD iscovery and DataM ining ( PA KDD) , Lecture Notes in Compu ter Sc ience 2035. New Yo rk: Spr inger-V erlag, 2001: 282-293.
[ 4] Ay res J, Gehrkeeta l J. Sequen tia l pattern m in ing using a b itm ap representation[ C] / / Proc of the 8 th ACM S IGKDD Int Conf on Know ledge D iscove ry and DataM in ing. Edm onton, 2002: 429-435.
[ 5] 严蔚敏, 吴伟民. 数据结构[M ]. 北京: 清华大学出版社, 2007: 144-145.
[ 6] UCI 数据集[ DB /OL]. [ 2008-03-13]. h ttp: / /down load. csdn. ne t/source /378926.
[ 7] IBM A lmaden Research Cente r. Quest DataM in ing Pro ject[ DB /OL]. ( 1996-03-12) [ 2007-05-26]. http: / /www. a lm aden. ibm. com /cs /quest /syndata. html .

Memo

Memo:
-
Last Update: 2013-04-08