Research Article
Article:Closed Pattern Mining from n-ary Relations
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 1 - Issue 9 |
| Published: February 2010 |
| Authors: R V Nataraj, S Selvan |
10.5120/210-353
|
R V Nataraj, S Selvan . Article:Closed Pattern Mining from n-ary Relations. International Journal of Computer Applications. 1, 9 (February 2010), 9-13. DOI=10.5120/210-353
@article{ 10.5120/210-353,
author = { R V Nataraj,S Selvan },
title = { Article:Closed Pattern Mining from n-ary Relations },
journal = { International Journal of Computer Applications },
year = { 2010 },
volume = { 1 },
number = { 9 },
pages = { 9-13 },
doi = { 10.5120/210-353 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2010
%A R V Nataraj
%A S Selvan
%T Article:Closed Pattern Mining from n-ary Relations%T
%J International Journal of Computer Applications
%V 1
%N 9
%P 9-13
%R 10.5120/210-353
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In this paper, we address the problem of closed pattern mining from n-ary relations. We propose CnS-Miner algorithm which enumerates all the closed patterns of the given n-dimensional dataset in depth first manner satisfying the user specified minimum size constraints. From the given input, the CnS-Miner algorithm generates an n-ary tree and visits the tree in depth first manner. We have proposed a generalized duplicate pruning method which prunes the subtrees that generate duplicate patterns. The space complexity of our algorithm is O(D+d) where D is the n-ary dataset and d is the depth of the tree. We have experimentally compared the proposed algorithm with DataPeeler, a recently proposed algorithm for closed pattern mining from n-ary relations.
References
- Loïc Cerf, Jérémy Besson, Céline Robardet, and Jean-François Boulicaut, "Closed Patterns meet n-ary relations", ACM Transactions on Knowledge Discovery from Data, Vol 3, Issue 1, March 2009. http://doi.acm.org/10.1145/ 1497577.1497580
- J. Besson, C. Robardet, J.F. Boulicaut and S. Rome,"Constraint Based Concept Mining and its Application to Microarray Data Analysis", Journal of Intelligent Data Analysis, pp. 59-82, 2005.
- Jinyan Li, Guimei Liu, Haiquan Li, Limsoon Wong, "Maximal Biclique Subgraphs and Closed Pattern Pairs of the Adjacency Matrix: A One-to-One Correspondence and Mining Algorithms," IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 12, pp. 1625-1637, Dec. 2007
- Ji Liping, K.L. Tan and A.K.H. Tung, "Mining Frequent Closed Cubes in 3D datasets," Proc. 32nd int. conference on very large data-bases, 2006
- Ji Liping, Kian-Lee Tan,K H. Tung, "Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets," IEEE Trans. on Knowledge and Data Engineering, Vol 19, No.9, Sept 2007.
- T. Uno, T. Asai, Y. Uchida, H. Arimura, "LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets," In Proc. IEEE ICDM'03 Workshop FIMI'03, 2003.
- N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Discovering Frequent Closed Itemsets for Association Rules," Proc. 7th Int. Conf. Database Theory (ICDT'99), pages 398-416, Jan 1999.
- G. Grahne, J.Zhu, "Fast Algorithms for Frequent Itemset Mining Using FP-Trees," IEEE Transactions on Knowledge and Data Engineering, Vol 17, No 10, pages 1347-1362, October 2005.
- C. Lucchese,S. Orlando and R. Perego, "Fast and Memory Efficient Mining of Frequent Closed Itemsets", IEEE Transactions on Knowledge and Data Engineering, VOL 18, No 1, pages 21-36, January 2006.
- G.Liu, "Supporting Efficient and Scalable Frequent Pattern Mining," PhD dissertation, Dept. of Computer Science., Hong Kong University., May 2005.
Index Terms
Keywords