Mining Frequent Patterns in Wireless Sensor Network Configurations

  • Da-Ren Chen
  • Shu-Ming Hsieh
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 309)


Graph is suitable for modeling many emerging fields such as configuring a wireless sensor network. The graph databases which representing the underlying real-world structures may therefore possess abounding unknown knowledge waiting to be discovered. Consequently, how to automatically mining the hidden information from these graph databases becomes critical for many new and promising applications. This paper proposes a new algorithm MFG (Mining Frequent subGraph patterns), which employs the global orders of labels in molecular graph patterns, in cooperation with fast pruning mechanisms, to reduce the amount of duplicated candidate enumeration. MFG also utilizes several effective data structures to store the subgraph pattern embedding information. By these proposed techniques, MFG shows its benefits such as it reduces candidate duplication dramatically, eliminates subgraph isomorphism checking completely, and alleviates the cost of graph isomorphism testing. The conducted experimental results show that MFG works with more economical memory consumption and better efficiency compared with a state-of-the-art mining method.


wireless sensor network algorithm graph mining frequent patterns 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. ACM Int’l Conf. on Management of Data, pp. 207–216 (1993)Google Scholar
  2. 2.
    Balcázar, J.L., Bifet, A., Lozano, A.: Mining frequent closed rooted trees. Machine Learning 78(1-2), 1–33 (2010)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Borgelt, C.: On Canonical Forms for Frequent Graph Mining. In: Workshop on Mining Graphs, Trees, and Sequences (MGTS), pp. 1–12 (2005)Google Scholar
  4. 4.
    Borgelt, C., Berhold, M.R.: Mining molecular fragments: finding relevant substructures of molecules. In: Proc. of 2002 IEEE Int. Conf. on Data Mining (ICDM), pp. 51–58 (2002)Google Scholar
  5. 5.
    Chartrand, G., Zhang, P.: Introduction to Graph Theory. McGraw Hill, New York (2002)Google Scholar
  6. 6.
    Fischer, I., Meinl, T.: Graph based molecular data mining – an overview. In: Proc. 2004 IEEE Int’l Conf. Systems, Man and Cybernetics (SMC) (2004)Google Scholar
  7. 7.
    Ghazizadeh, S., Chawathe, S.: SEuS: structure extraction using summaries. In: Proc. of the 5th Int’l Conf. Discovery Science, pp. 71–85 (2002)Google Scholar
  8. 8.
    Holder, L., Cook, D., Djoko, S.: Substructure discovery in the SUBDUE system. In: Proc. of the AAAI Workshop on Knowledge Discovery in Databases, pp. 169–180 (1994)Google Scholar
  9. 9.
    Hsieh, S.M., Hsu, C.C., Hsu, L.F.: Efficient method to perform isomorphism testing of labeled graphs. In: Proc. of the 2006 Int’l Conf. on Computational Science and Its Applications (ICCSA), pp. 422–431 (2006)Google Scholar
  10. 10.
    Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraph in the presence of isomorphism. In: Proc. of the 3rd IEEE Int’l Conf. on Data Mining (ICDM), pp. 549–552 (2003)Google Scholar
  11. 11.
    Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Proc. of the 4th European Conf. on Principles of Data Mining and Knowledge Discovery, pp. 13–23 (2000)Google Scholar
  12. 12.
    Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: mining graph data. Machine Learning 50(3), 321–354 (2003)CrossRefMATHGoogle Scholar
  13. 13.
    Jenner, B., Kobler, J., McKenzie, P., Toran, J.: Completeness results for graph isomorphism. Journal of Computer and System Sciences 66(3), 549–566 (2003)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Kuramochi, M., Karypis, G.: An efficient algorithm for discovering frequent subgraphs. IEEE Trans. on Knowledge and Data Engineering 16(9), 1038–1051 (2004)CrossRefGoogle Scholar
  15. 15.
    Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. In: Proc. of SIAM Int. Conf. on Data Mining (2004)Google Scholar
  16. 16.
    Kuramochi, M., Karypis, G.: GREW-ascalable frequent subgraph discovery algorithm. In: Proc. ofthe 4th IEEE Int’l Conf. on Data Mining (ICDM), pp. 439–442 (2004)Google Scholar
  17. 17.
    Lee, J.T., Wu, H.-W., Lee, T.-Y., Liu, Y.-H., Chen, K.-T.: Mining closed patterns in multi-sequence time-series databases. Data & Knowledge Engineering 68(10), 1071–1090 (2009)CrossRefGoogle Scholar
  18. 18.
    Matsuda, T., Motoda, H., Yoshida, T., Washio, T.: Mining patterns from structured data by beam-wise graph-based induction. In: Proc. of the 5th Int’l Conf. on Discovery Science, pp. 422–429 (2002)Google Scholar
  19. 19.
    Nijssen, S., Kok, J.N.: A quickstart in frequent structure mining can make a difference. In: Proc. of the 2004 ACM SIGKDD Int’lConf. on Knowledge Discovery and Data Mining, pp. 647–652 (2004)Google Scholar
  20. 20.
    Nijssen, S., Kok, J.N.: Frequent graph mining and its application to molecular databases. In: Proc. of the IEEE Int’l Conf. on Systems Man and Cybernetics, pp. 4571–4577 (2004)Google Scholar
  21. 21.
    Termier, A., Tamada, A.Y., Numata, K., Imoto, S., Washio, T.: DIGDAG, a first algorithm to mine closed frequent embedded sub-DAGs. In: Proc. 5th Int’l Workshop on Mining and Learning with Graphs (2007)Google Scholar
  22. 22.
    Washio, T., Motoda, H.: State of the art of graph-based data mining. ACM SIGKDD Explorations Newsletter 5(1), 59–68 (2003)CrossRefGoogle Scholar
  23. 23.
    Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: Proc. of the Int’l Conf. on Data Mining (ICDM), pp. 721–724 (2002)Google Scholar
  24. 24.
    Yoo, S., Yang, Y., Lin, F., Moon, I.: Mining Social Networks for Personalized Email Prioritization. In: Proc. of Int’l Conf. on Knowledge Discovery and Data Mining (2009)Google Scholar
  25. 25.
  26. 26.
  27. 27.
    Zhang, F., Chanson, S.T.: Processor voltage scheduling for real-time tasks with non-preemptible sections. In: 23rd Proceedings IEEE Real-Time Systems Symp., RTSS 2002, Austin, TX, pp. 235–245. IEEE (December 2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Da-Ren Chen
    • 1
  • Shu-Ming Hsieh
    • 2
  1. 1.Department of Information ManagementNational Taichung University of Science and TechnologyTaichungTaiwan, R.O.C.
  2. 2.Department of Computer Science and Information EngineeringHwa Hsia Institute of TechnologyTaipeiTaiwan

Personalised recommendations