Skip to main content

Mining of Removable Closed Patterns in Goods Dataset

  • Conference paper
  • First Online:
Artificial Intelligence and Evolutionary Computations in Engineering Systems

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

  • 1291 Accesses

Abstract

Production factories have many items produced with various parts to bring out the complete product at the end. Every product that is produced in the factory obtains the company some amount of income. The manufacturing of these products also costs a huge sum for purchase and production. When a situation arises for the company to shut down its manufacturing or when there is some crisis, the industry will not have money to buy the parts to finish the product. The problem of removable pattern mining is to identify the patterns which can be removed to reduce the loss to the factory’s profit under certain conditions. In such situations, the production managers need an alternate to reduce the cost of production without decreasing the profit rate. This paper proposes removable closed patterns to represent and compress the mined removable patterns without much profit reduction. Erasable closed pattern mining algorithm is implemented to mine all the erasable closed patterns by reducing the resources needed for production without affecting the information loss. The removable itemset with one pattern  along with their element occurrence pair is taken into consideration. Further the erasable patterns are mined and used for useful extraction of members. Then the erasable closed patterns are mined using the module that checks the closeness of the patterns in the product datasets.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

Similar content being viewed by others

References

  1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. Proc. VLDB 94, 487–499 (1994)

    Google Scholar 

  2. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between set of items in large databases. Proc. SIGMOD 93(2), 207–216 (1993)

    Article  Google Scholar 

  3. Deng, Z.-H., Xu, X.-R.: Fast mining erasable itemsets using NC_sets. Expert Syst. Appl. 39(4), 4453–4463 (2012)

    Article  Google Scholar 

  4. Dam, T.-L., Li, K., Fournier-Viger, P., Duong, Q.-H.: An efficient algorithm for mining top-rank-k frequent patterns. Appl. Intell. 45(1), 96–111 (2016)

    Article  Google Scholar 

  5. Deng, Z.H.: Mining top-rank-k erasable itemsets by PID_lists. Int. J. Intell. Syst. 28(4), 366–379 (2013)

    Article  Google Scholar 

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

    Article  Google Scholar 

  7. Lan, G.C., Hong, T.P., Huang, J.P., Tseng, V.S.: On-shelf utility mining with negative item values. Expert Syst. Appl. 41(7), 3450–3459 (2014)

    Article  Google Scholar 

  8. Huynh, T.L.Q., Le, T., Vo, B., Le, B.: An efficient and effective algorithm for mining top-rank-k frequent patterns. Expert Syst. Appl. 42(1), 156–164 (2015)

    Article  Google Scholar 

  9. Lan, G.C., Hong, T.P., Lee, H.Y.: An efficient approach for finding weighted sequential patterns from sequence databases. Appl. Intell. 41(2), 439–452 (2014)

    Article  Google Scholar 

  10. Le, T., Vo, B.: MEI: an efficient algorithm for mining erasable itemsets. Eng. Appl. Artif. Intell. 27, 155–166 (2014)

    Article  Google Scholar 

  11. Le, T., Vo, B., Nguyen, G.: A survey of erasable itemset mining algorithms. WIREs Data Min. Knowl. Discov. 4(5), 356–379 (2014)

    Article  Google Scholar 

  12. Le, T., Vo, B., Coenen, F.: An efficient algorithm for mining erasable itemsets using the difference of NC-sets. In: 2013 IEEE International Conference on Systems, Man, and Cybernetics, vol. 13, pp. 2270–2274, June 2013

    Google Scholar 

  13. Nguyen, G., Le, T., Vo, B., Le, B.: EIFDDAn efficient approach for erasable itemset mining of very dense datasets. Appl. Intell. 43(1), 85–94 (2015)

    Article  Google Scholar 

  14. Yun, U., Shin, H., Ryu, K.H., Yoon, E.: An efficient mining algorithm for maximal weighted frequent patterns in transactional databases. Know. Based Syst. 33, 53–64 (2012)

    Article  Google Scholar 

  15. Le, T., Vo, B.: An N-list-based algorithm for mining frequent closed patterns. Expert Syst. Appl. 42(19), 6648–6657 (2015)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to B. Valarmathi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Amala Kaviya, V.S., Valarmathi, B., Chellatamilan, T. (2020). Mining of Removable Closed Patterns in Goods Dataset. In: Dash, S., Lakshmi, C., Das, S., Panigrahi, B. (eds) Artificial Intelligence and Evolutionary Computations in Engineering Systems. Advances in Intelligent Systems and Computing, vol 1056. Springer, Singapore. https://doi.org/10.1007/978-981-15-0199-9_16

Download citation

Publish with us

Policies and ethics