The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2010 vol.22)
pp: 1797-1802
S. Selvan , Francis Xavier Engineering College, Tirunelveli
R.V. Nataraj , PSG College of Technology, Coimbatore
ABSTRACT
In this paper, we address the problem of mining large maximal bicliques from a three-dimensional Boolean symmetric adjacency matrix. We propose CubeMiner-MBC algorithm which enumerates all the maximal bicliques satisfying the user-specified size constraints. Our algorithm enumerates all bicliques with less memory in depth first manner and does not store the previously computed patterns in the main memory for duplicate detection. To efficiently prune duplicate patterns, we have proposed a subtree pruning technique which reduces the total number of nodes that are processed and also reduces the total number of duplicate patterns that are generated. We have also incorporated several optimizations for efficient cutter generation and closure checking. Experiments involving several synthetic data sets show that our algorithm takes less running time than CubeMiner algorithm.
INDEX TERMS
Data mining, maximal bicliques, algorithms, mining methods.
CITATION
S. Selvan, R.V. Nataraj, "Efficient Mining of Large Maximal Bicliques from 3D Symmetric Adjacency Matrix", IEEE Transactions on Knowledge & Data Engineering, vol.22, no. 12, pp. 1797-1802, December 2010, doi:10.1109/TKDE.2010.97
REFERENCES
[1] J. Li, G. Liu, H. Li, and L. Wong, "Maximal Biclique Subgraphs and Closed Pattern Pairs of the Adjacency Matrix: A One-to-One Correspondence and Mining Algorithms," IEEE Trans. Knowledge and Data Eng., vol. 19, no. 12, pp. 1625-1637, Dec. 2007.
[2] J. Liping, K.L. Tan, and A.K.H. Tung, "Mining Frequent Closed Cubes in 3D Data Sets," Proc. 32nd Int'l Conf. Very Large Data Bases, 2006.
[3] L. Cerf, J. Besson, C. Robardet, and J.-F. Boulicaut, "Closed Patterns Meet n-ary Relations," ACM Trans. Knowledge Discovery from Data, vol. 3, no. 1, pp. 1-36, 2009.
[4] L. Ji, K.-L. Tan, and K.H. Tung, "Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets," IEEE Trans. Knowledge and Data Eng., vol. 19, no. 9, pp. 1175-1187, Sept. 2007.
[5] J. Besson, C. Robardet, J.F. Boulicaut, and S. Rome, "Constraint Based Concept Mining and Its Application to Microarray Data Analysis," Intelligent Data Analysis, vol. 9, pp. 59-82, 2005.
[6] J. Liping, "Mining Localized Co-Expressed Gene Patterns from Microarray Data," PhD dissertation, School of Computing, Nat'l Univ. of Singapore, June 2006.
[7] G. Alexe, S. Alexe, Y. Crama, S. Foldes, P.L. Hammer, and B. Simeone, "Consensus Algorithms for the Generation of all Maximal Bicliques," Discrete Applied Math., vol. 145, no. 1, pp.11-21, 2004.
[8] R. Peeters, "The Maximum Edge Biclique Problem is NP-complete," Discrete Applied Math., vol. 131, no. 3, pp. 651-654, 2003.
[9] V.M. Dias, C.M. de Figueiredo, and J.L. Szwarcfiter, "Generating Bicliques of a Graph in Lexicographic Order," J. Theoretical Computer Science, vol. 337, pp. 240-248, 2005.
[10] K. Makino and T. Uno, "New Algorithms for Enumerating all Maximal Cliques," Proc. Ninth Scandinavian Workshop Algorithm Theory (SWAT '04), pp. 260-272, 2004.
[11] D. Eppstein, "Arboricity and Bipartite Subgraph Listing Algorithms," Information Processing Letters, vol. 51, pp. 207-211, 1994.
[12] T. Uno, M. Kiyomi, and H. Arimura, "LCM ver.2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets," Proc. Fourth IEEE Int'l Conf. Data Mining (ICDM '04) Workshop Frequent Itemset Mining Implementations (FIMI '04), 2004.
[13] J. Han, J. Pei, Y. Yin, and R. Mao, "Mining Frequent Pattern without Candidate Generation: A Frequent Pattern Tree Approach," Data Mining and Knowledge Discovery, vol. 8, pp. 53-87, 2004.
[14] M. Song and S. Rajasekaran, "A Transaction Mapping Algorithm for Frequent Itemsets Mining," IEEE Trans. Knowledge and Data Eng., vol. 18, no. 4, pp. 472-481, Apr. 2006.
[15] G. Grahne and J. Zhu, "Fast Algorithms for Frequent Itemset Mining Using FP-Trees," IEEE Trans. Knowledge and Data Eng., vol. 17, no. 10, pp. 1347-1362, Oct. 2005.
[16] C. Lucchese, S. Orlando, and R. Perego, "Fast and Memory Efficient Mining of Frequent Closed Itemsets," IEEE Trans. Knowledge and Data Eng., vol. 18, no. 1, pp. 21-36, Jan. 2006.
[17] R. Jaschke, A. Hotho, C. Schmitz, B. Ganter, and G. Stumme, "TRIAS: An Algorithm for Mining Iceberg Tri-Lattices," Proc. Sixth IEEE Int'l Conf. Data Mining (ICDM '06), pp. 907-911, 2006.
[18] R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," Proc. Int'l Conf. Very Large Data Bases, pp. 487-499, Sept. 1994.
[19] N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Discovering Frequent Closed Itemsets for Association Rules," Proc. Seventh Int'l Conf. Database Theory (ICDT '99), pp. 398-416, Jan. 1999.
[20] M.J. Zaki and C.J. Hsiao, "Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure," IEEE Trans. Knowledge and Data Eng., vol. 17, no. 4, pp. 462-478, Apr. 2005.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool