Skip to main content
SpringerLink
Log in

Efficient Algorithm for Maximal Biclique Enumeration on Bipartite Graphs

  • Conference paper
  • First Online:
Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1075))

  • 1428 Accesses

Abstract

Maximal Biclique Enumeration (MBE) has become a central task to many data mining problems arising in Web mining, shopping recommendation, business and bioinformatics. It is crucial to accelerate the sequential MBE that is the basis of the parallel MBE. In this paper, we present an efficient algorithm for maximal biclique enumeration (EMBE) on bipartite graphs in a depth-first manner and need not to store previously computed maximal bicliques in memory for duplicate detection. Previous studies have shown that reduce the number of checking closure condition and manage the child nodes are huge challenges for generating all maximal bicliques. In this paper, we propose that (1) an efficient implementation for pruning technique based on the stack when checking nodes are closed or not, (2) a new method to manage the expansion child nodes through a global data structure.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discrete Appl. Math. 145(1), 11–21 (2004)

    Article  MathSciNet  Google Scholar 

  2. Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. ACM SIGMOD Rec. 26(2), 255–264 (1997)

    Article  Google Scholar 

  3. Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 150–160. ACM (2000)

    Google Scholar 

  4. Gély, A., Nourine, L., Sadi, B.: Enumeration aspects of maximal cliques and bicliques. Discrete Appl. Math. 157(7), 1447–1459 (2009)

    Article  MathSciNet  Google Scholar 

  5. Grahne, G., Zhu, J.: Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans. Knowl. Data Eng. 17(10), 1347–1362 (2005)

    Article  Google Scholar 

  6. Hashem, T., Karim, M.R., Samiullah, M., Ahmed, C.F.: An efficient dynamic superset bit-vector approach for mining frequent closed itemsets and their lattice structure. Expert Syst. Appl. 67, 252–271 (2017)

    Article  Google Scholar 

  7. Huan, J., Wang, W., Prins, J., Yang, J.: Spin: mining maximal frequent subgraphs from graph databases. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 581–586. ACM (2004)

    Google Scholar 

  8. Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: mining graph data. Mach. Learn. 50(3), 321–354 (2003)

    Article  Google Scholar 

  9. Li, J., Liu, G., Li, H., Wong, L.: Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: a one-to-one correspondence and mining algorithms. IEEE Trans. Knowl. Data Eng. 19(12), 1625–1637 (2007)

    Article  Google Scholar 

  10. Malgrange, Y.: Recherche des sous-matrices premières d’une matrice à coefficients binaires. Applications à certains problèmes de graphe. In: Proceedings of the Deuxième Congrès de l’AFCALTI, pp. 231–242 (1962)

    Google Scholar 

  11. Mukherjee, A.P., Tirthapura, S.: Enumerating maximal bicliques from a large graph using mapreduce. IEEE Trans. Serv. Comput. 10(5), 771–784 (2017)

    Article  Google Scholar 

  12. Nagarajan, N., Kingsford, C.: Uncovering genomic reassortments among influenza strains by enumerating maximal bicliques. In: 2008 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2008, pp. 223–230. IEEE (2008)

    Google Scholar 

  13. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: International Conference on Database Theory, pp. 398–416. Springer (1999)

    Google Scholar 

  14. Pei, J., Han, J., Mao, R., et al.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, vol. 4, pp. 21–30 (2000)

    Google Scholar 

  15. Selvan, S., Nataraj, R.: Efficient mining of large maximal bicliques from 3D symmetric adjacency matrix. IEEE Trans. Knowl. Data Eng. 22(12), 1797–1802 (2010)

    Article  Google Scholar 

  16. Shin, K., Hooi, B., Faloutsos, C.: M-Zoom: fast dense-block detection in tensors with quality guarantees. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 264–280. Springer (2016)

    Google Scholar 

  17. Sinthuja, M., Puviarasan, N., Aruna, P.: Geo map visualization for frequent purchaser in online shopping database using an algorithm LP-growth for mining closed frequent itemsets. Procedia Comput. Sci. 132, 1512–1522 (2018)

    Article  Google Scholar 

  18. Uno, T., Asai, T., Uchida, Y., Arimura, H.: LCM: an efficient algorithm for enumerating frequent closed item sets. In: Fimi, vol. 90. Citeseer (2003)

    Google Scholar 

  19. Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: efficient mining algorithms for frequent/closed/maximal itemsets. In: Fimi, vol. 126 (2004)

    Google Scholar 

  20. Wang, J., Han, J., Pei, J.: CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 236–245. ACM (2003)

    Google Scholar 

  21. Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 286–295. ACM (2003)

    Google Scholar 

  22. Zaki, M.J., Hsiao, C.J.: CHARM: an efficient algorithm for closed itemset mining. In: Proceedings of the 2002 SIAM International Conference on Data Mining, pp. 457–473. SIAM (2002)

    Google Scholar 

  23. Zhong-Ji, F., Ming-Xue, L., Xiao-Xin, H., Xiao-Hui, H., Xin, Z.: Efficient algorithm for extreme maximal biclique mining in cognitive frequency decision making. In: 2011 IEEE 3rd International Conference on Communication Software and Networks (ICCSN), pp. 25–30. IEEE (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Chinese Academy of Sciences, UCAS, 80# ZhongGuanCun East Road, Beijing, 100190, People’s Republic of China

    CaiXia Qin

  2. Institute of Software, Chinese Academy of Sciences, ISCAS, 4# South Fourth Street, ZhongGuanCun, Beijing, 100190, People’s Republic of China

    CaiXia Qin, MingXue Liao, YuanYuan Liang & ChangWen Zheng

Authors
  1. CaiXia Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. MingXue Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. YuanYuan Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. ChangWen Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to CaiXia Qin .

Editor information

Editors and Affiliations

  1. The University of Aizu, Aizuwakamatsu, Japan

    Yong Liu

  2. School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore

    Lipo Wang

  3. Computer Science and Mathematics, University of Sao Paulo, Ribeirao Preto, Brazil

    Liang Zhao

  4. School of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, China

    Zhengtao Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Qin, C., Liao, M., Liang, Y., Zheng, C. (2020). Efficient Algorithm for Maximal Biclique Enumeration on Bipartite Graphs. In: Liu, Y., Wang, L., Zhao, L., Yu, Z. (eds) Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery. ICNC-FSKD 2019. Advances in Intelligent Systems and Computing, vol 1075. Springer, Cham. https://doi.org/10.1007/978-3-030-32591-6_1

Download citation

Publish with us

Policies and ethics

Search

Navigation