Pattern mining based on local distribution

Zhiwen Yu, Xing Wang, Hau-San Wong, Zhongkai Deng

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

1 Citation (Scopus)

Abstract

Pattern mining gains more and more attention due to its useful applications in many areas, such as machine learning, database, multimedia, biology, and so on. Though there exist a lot of approaches for pattern mining, few of them consider the local distribution of the data. In the paper, we not only design six challenge datasets related to the local patterns, but also propose a new pattern mining algorithm based on local distribution. Unlike traditional pattern mining algorithms, our new algorithm first creates a local distribution for each data point by a random approach. Then, the distribution curve of each data point is simulated by the sum of low frequency curves obtained by the wavelet approach. In the third step, the coefficients of these low frequency curves for each data point are clustered by the normalized cut approach. Finally, the patterns of the datasets are obtained by the new pattern mining algorithm. The experiments show that our new algorithm outperforms traditional unsupervised learning approaches, such as K-means, EM, spectral clustering algorithm (SCA), and so on, on these six new datasets. © 2008 IEEE.
Original languageEnglish
Title of host publicationProceedings of the International Joint Conference on Neural Networks
Pages584-588
DOIs
Publication statusPublished - 2008
Event2008 International Joint Conference on Neural Networks, IJCNN 2008 - Hong Kong, China
Duration: 1 Jun 20088 Jun 2008

Conference

Conference2008 International Joint Conference on Neural Networks, IJCNN 2008
PlaceChina
CityHong Kong
Period1/06/088/06/08

Fingerprint

Dive into the research topics of 'Pattern mining based on local distribution'. Together they form a unique fingerprint.

Cite this