Subscribe

Issue No.07 - July (2008 vol.20)

pp: 911-923

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.38

ABSTRACT

In data mining and knowledge discovery, pattern discovery extracts previously unknown regularities in the data and is a useful tool for categorical data analysis. However, the number of patterns discovered is often overwhelming. It is difficult and time-consuming to 1) interpret the discovered patterns and 2) use them to further analyze the data set. To overcome these problems, this paper proposes a new method that clusters patterns and their associated data simultaneously. When patterns are clustered, the data containing the patterns are also clustered; and the relation between patterns and data is made explicit. Such an explicit relation allows the user on the one hand to further analyze each pattern cluster via its associated data cluster, and on the other hand to interpret why a data cluster is formed via its corresponding pattern cluster. Since the effectiveness of clustering mainly depends on the distance measure, several distance measures between patterns and their associated data are proposed. Their relationships to the existing common ones are discussed. Once pattern clusters and their associated data clusters are obtained, each of them can be further analyzed individually. To evaluate the effectiveness of the proposed approach, experimental results on synthetic and real data are reported.

INDEX TERMS

Clustering, classification, and association rules, Similarity measures, Data mining

CITATION

Andrew K.C. Wong, Gary C.L. Li, "Simultaneous Pattern and Data Clustering for Pattern Cluster Analysis",

*IEEE Transactions on Knowledge & Data Engineering*, vol.20, no. 7, pp. 911-923, July 2008, doi:10.1109/TKDE.2008.38REFERENCES

- [1] F. Mills,
Statistical Methods. Pitman, 1955.- [4] H. Toivonen, M. Klemetinen, P. Ronkaninen, K. Hatonen, and H. Mannila, “Pruning and Grouping Discovered Association Rules,”
Proc. MLnet Workshop Statistics, Machine Learning, and Discovery in Databases, pp. 47-52, 1995.- [5] G.K. Gupta, A. Strehi, and J. Ghosh, “Distance Based Clustering of Association Rules,”
Proc. Int'l Conf. Artificial Neural Networks in Eng. (ANNIE '99), vol. 9, pp. 759-764, 1999.- [7] J. Han,
Data Mining: Concepts and Techniques. Morgan Kaufmann, 2001.- [8] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,”
Proc. 20th Int'l Conf. Very Large Data Bases (VLDB '94), pp. 487-499, 1994.- [10] S. Brin, R. Motwani, and R. Silverstein, “Beyond Market Basket: Generalizing Association Rules to Correlations,”
Proc. ACM SIGMOD '97, pp. 265-276, 1997.- [12] R. Srikant, Q. Vu, and R. Agrawal, “Mining Association Rules with Item Constraints,”
Proc. Third Int'l Conf. Knowledge Discovery and Data Mining (KDD '97), pp. 67-73, 1997.- [14] N. Wrigley,
Categorical Data Analysis for Geographers and Environmental Scientists. Longman, 1985.- [15] D.R. Cox and E.J.A. Snell, “General Definition of Residuals,”
J.Royal Statistical Soc. B, vol. 30, pp. 248-265, 1968.- [17] P.M. Murph and D.W. Aha,, UCI Repository of Machine Learning Databases, Dept. Information and Computer Science, Univ. of California, Irvine, 1987.
- [18] S. Chawla and J. Davis, “On Local Pruning of Association Rules Using Directed Hypergraphs,” Technical Report 537, School of Information Technologies, Univ. of Sydney, 2003.
- [22] Y. Wang and A.K.C Wong,
Discover*e. Pattern Discovery Technologies, http:/www.patterndiscovery.com, 2008.- [23] R.O. Duda, P.E. Hart, and D.G. Stork,
Pattern Classification. Wiley, 2000.- [24] A.K.C. Wong, D.K.Y. Chiu, and W. Huang, “A Discrete-Valued Clustering Algorithm with Applications to Bimolecular Data,”
Information Sciences, vol. 139, pp. 97-112, 2002. |