Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information Systems Architecture and Technology

ISAT 2017: Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology – ISAT 2017 pp 195–204Cite as

Constraint-Based Method for Mining Colossal Patterns in High Dimensional Databases

  • Conference paper
  • First Online:

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

Abstract

Constraint-based methods for mining patterns have been developed in recent years. They are based on top-down manner to prune candidate patterns. However, for colossal pattern mining, bottom-up manners are efficient methods, so the previous approaches for pruning candidate patterns based on top-down manner cannot apply to colossal pattern mining with constraint when using bottom-up manner. In this paper, we state the problem of mining colossal pattern with pattern constraints. Next, we develop a theorem for efficient pruning candidate patterns with bottom-up manner. Finally, we propose an efficient algorithm for mining colossal patterns with pattern constraints based on this theorem.

This is a preview of subscription content, 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   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

References

  1. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases, In: SIGMOD, pp. 207–216 (1993)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487–499 (1994)

    Google Scholar 

  3. Ao, X., Luo, P., Li, C., Zhuang, F., He, Q.: Online frequent episode mining. In: ICDE 2015, pp. 891–902 (2015)

    Google Scholar 

  4. Badia, A., Kantardzic, M.: Generalizing association rules: theoretical framework and implementation. intelligent systems design and applications. In: Advances in Soft Computing, vol. 23, pp. 283–292. Springer, Heidelberg (2003)

    Google Scholar 

  5. Baralis, E., Cagliero, L., Cerquitelli, T., Garza, P.: Generalized association rule mining with constraints. Inf. Sci. 194, 68–84 (2012)

    Article  Google Scholar 

  6. Berkhin, P., Dhillon, I.: Knowledge discovery: clustering. In: Encyclopedia of Complexity and Systems Science, pp. 5051–5064 (2009)

    Google Scholar 

  7. Cagliero, L., Garza, P.: Improving classification models with taxonomy information. Data Knowl. Eng. 86, 85–101 (2013)

    Article  Google Scholar 

  8. Dabbiru, M., Shashi, M.: An efficient approach to colossal pattern mining. Int. J. Comput. Sci. Network Secur. 6, 304–312 (2010)

    Google Scholar 

  9. Duong, H.V., Truong, T.C., Vo, B.: An efficient method for mining frequent itemsets with double constraints. Eng. Appl. of AI 27, 148–154 (2014)

    Google Scholar 

  10. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD 2000, pp. 1–12 (2000)

    Google Scholar 

  11. Hyeok, K., Cholyong, J., Unhyok, R.: Implementation of Association Rule Mining for Network Intrusion Detection. CoRR abs/1601.05335 (2016)

    Google Scholar 

  12. Lin, W.Y., Huang, K.W., Wu, C.A.: MCFPTree: An FP-tree-based algorithm for multi-constraint patterns discovery. Int. J. Bus. Intell. Data Mining 5, 231–246 (2010)

    Article  Google Scholar 

  13. Liu, H., Wu, X., Zhang, S.: A new supervised feature selection method for pattern classification. Comput. Intell. 30(2), 342–361 (2014)

    Article  MathSciNet  Google Scholar 

  14. Luo, A., Jia, X., Shang, L., Gao, Y., Yang, Y.: Granular-based partial periodic pattern discovery over time series data. In: Rough Sets and Knowledge Technology, RSKT. LNCS, vol. 6954, pp. 706–711. Springer, Heidelberg (2011)

    Google Scholar 

  15. Mooney, C., Roddick, J.F.: Sequential pattern mining - approaches and algorithms. ACM Comput. Surv. 45(2), 1–19 (2013)

    Article  MATH  Google Scholar 

  16. Ng, R.T., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: ACM SIGMOD International Conference on Management of Data, pp. 13–24 (1998)

    Google Scholar 

  17. Nguyen, T.L., Vo, B., Snásel, V.: Efficient algorithms for mining colossal patterns in high dimensional databases. Knowl.-Based Syst. 122, 75–89 (2017)

    Article  Google Scholar 

  18. Nguyen, D., Vo, B., Le, B.: CCAR: An efficient method for mining class association rules with itemset constraints. Eng. Appl. of AI 37, 115–124 (2015)

    Google Scholar 

  19. Nguyen, D., Nguyen, L.T.T., Vo, B., Hong, T.P.: A novel method for constrained class association rule mining. Inf. Sci. 320, 107–125 (2015)

    Article  MathSciNet  Google Scholar 

  20. Norouzi, M., Bengio, S., Chen, Z., Jaitly, N., Schuster, M., Wu, Y., Schuurmans, D.: Reward augmented maximum likelihood for neural structured prediction. In: NIPS 2016, pp. 1723–1731 (2016)

    Google Scholar 

  21. Raorane, A.A., Kulkarni, R.V., Jitkar, B.D.: Association rule – extracting knowledge using market basket analysis. Res. J. Recent Sci. 1(2), 19–27 (2012)

    Google Scholar 

  22. Raza, K.: Application of data mining in bioinformatics. Indian J. Comput. Sci. Eng. 1(2), 114–118 (2013)

    Google Scholar 

  23. Ng, R., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: ACM SIGMOD International Conference on Management of Data (1998)

    Google Scholar 

  24. Slimani, T., Lazzez, A.: Sequential mining: patterns and algorithms analysis. Int. J. Comput. Electron. Res. 2(5), 639–647 (2013)

    Google Scholar 

  25. Sohrabi, M.K., Barforoush, A.A.: Efficient colossal pattern mining in high dimensional datasets. Knowl. Based Syst. 33, 41–52 (2012)

    Article  Google Scholar 

  26. Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Paper presented at the 3rd International Conference on Knowledge Discovery and Data Mining (KDD 1997) (1997)

    Google Scholar 

  27. Tran, A.N., Duong, H.V., Truong, T.C., Le, B.H.: Efficient algorithms for mining frequent itemsets with constraint. In: Knowledge and Systems Engineering (KSE), pp. 19–25 (2011)

    Google Scholar 

  28. Vo, B., Le, T., Pedrycz, W., Nguyen, G., Baik, S.W.: Mining erasable itemsets with subset and superset itemset constraints. Expert Syst. Appl. 69, 50–61 (2017)

    Article  Google Scholar 

  29. Weichbroth, P., Owoc, M., Pleszkun, M.: Web user navigation patterns discovery from WWW server log files. In: FedCSIS 2012, pp. 1177–1176 (2012)

    Google Scholar 

  30. Wojciechowski, M., Zakrzewicz, M.: Dataset filtering techniques in constraint-based frequent pattern mining. Pattern Detect. Discov. 2447, 77–91 (2002)

    Article  MATH  Google Scholar 

  31. Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: KDD 1997, pp. 283–286 (1997)

    Google Scholar 

  32. Zaki, M.J., Hsiao, C.J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowl. Data Eng. 17(4), 462–478 (2005)

    Article  Google Scholar 

  33. Zhang, C., Zhang, S.: Association Rule Mining: Models and Algorithms. LNCS, vol. 2307. Springer (2002). ISBN: 3-540-43533-6

    Google Scholar 

  34. Zhang, S., Wu, X.: Fundamentals of association rules in data mining and knowledge discovery. Wiley Interdisc. Rev. Data Mining Knowl. Discov. 1(2), 97–116 (2011)

    Article  MathSciNet  Google Scholar 

  35. Zhou, W., Liu, H., Cheng, H.: Mining closed episodes from event sequences efficiently. PAKDD 1, 310–318 (2010)

    Google Scholar 

  36. Zhu, F., Yan, X., Han, J., Yu, P., Cheng, H.: Mining colossal frequent patterns by core pattern fusion. In: ICDE 2007, pp. 706–715 (2007)

    Google Scholar 

  37. Zubi, Z.S., Raiani, M.S.E.: Using web logs dataset via web mining for user behavior understanding. Int. J. Comput. Commun. 8, 103–111 (2014)

    Google Scholar 

Download references

Acknowledgments

This research is funded by NTTU Foundation for Science and Technology Development under grant number 2017.01.75

This work was carried out during the tenure of an ERCIM ‘Alain Bensoussan’ Fellowship Programme.

Author information

Authors and Affiliations

  1. Center for Information Technology, Ho Chi Minh City University of Food Industry, Ho Chi Minh City, Vietnam

    Thanh-Long Nguyen

  2. VŠB-Technical University of Ostrava, Ostrava-Poruba, Czech Republic

    Thanh-Long Nguyen, Bao Huynh & Vaclav Snasel

  3. Faculty of Information Technology, Ho Chi Minh City University of Technology, Ho Chi Minh City, Vietnam

    Bay Vo

  4. Center for Applied Information Technology, Ton Duc Thang University, Ho Chi Minh City, Vietnam

    Bao Huynh

  5. Faculty of Information Technology, Nguyen Tat Thanh University, Ho Chi Minh City, Vietnam

    Loan T. T. Nguyen

  6. Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland

    Loan T. T. Nguyen

Authors
  1. Thanh-Long Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bay Vo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bao Huynh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Vaclav Snasel
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Loan T. T. Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bay Vo .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Leszek Borzemski

  2. Department of Computer Science, Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Jerzy Świątek

  3. Department of Management Systems, Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Zofia Wilimowska

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Nguyen, TL., Vo, B., Huynh, B., Snasel, V., Nguyen, L.T.T. (2018). Constraint-Based Method for Mining Colossal Patterns in High Dimensional Databases. In: Borzemski, L., Świątek, J., Wilimowska, Z. (eds) Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology – ISAT 2017. ISAT 2017. Advances in Intelligent Systems and Computing, vol 655. Springer, Cham. https://doi.org/10.1007/978-3-319-67220-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67220-5_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67219-9

  • Online ISBN: 978-3-319-67220-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation