Skip to main content
Top

2014 | OriginalPaper | Chapter

4. Efficient Mining Frequent Closed Resource Patterns in Resource Effectiveness Data: The MFPattern Approach

Authors : Lihua Zhang, Miao Wang, Qingfan Gu, Zhengjun Zhai, Guoqing Wang

Published in: Proceedings of the First Symposium on Aviation Maintenance and Management-Volume II

Publisher: Springer Berlin Heidelberg

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

As the occurrence of failure of electronic resources is sudden, real-time record analysis on the effectiveness of all resources in the system can discover abnormal resources earlier and start using backup resources or restructure resources in time, thus managing abnormal situations and finally realizing health management of the system. This paper proposed an algorithm for mining frequent closed resource patterns from data effectiveness matrix with the method of column extension: MFPattern, which uses effective pruning strategies to guarantee the mining of all frequent closed patterns without producing candidate item-sets. Different from the traditional frequent closed pattern, MFPattern algorithm can mine resource combination patterns with all resources very effective during work, those with simultaneous failure of resources and combination patterns in which some resources are very effective while some other resources have failure. The experimental result shows that this algorithm has a higher mining efficiency than existing mining methods of frequent closed pattern.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Pecht M et al (2010) A prognostics and health management roadmap for information and electronics-rich systems. Microelectron Reliab 50:317–323CrossRef Pecht M et al (2010) A prognostics and health management roadmap for information and electronics-rich systems. Microelectron Reliab 50:317–323CrossRef
2.
go back to reference Han J, Pei j, Mortazavi-Asl B, Chen Q, Dayal U, Hsu M-C (2000) FreeSpan: frequent pattern-projected sequential pattern mining. In: Proceeding of 2000 ACM SIGKDD international conference knowledge discovery in databases (KDD’00), pp 355–359 Han J, Pei j, Mortazavi-Asl B, Chen Q, Dayal U, Hsu M-C (2000) FreeSpan: frequent pattern-projected sequential pattern mining. In: Proceeding of 2000 ACM SIGKDD international conference knowledge discovery in databases (KDD’00), pp 355–359
3.
go back to reference Pei J, Han J (2004) Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans Knowl Data Eng 6(10):1–17 Pei J, Han J (2004) Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans Knowl Data Eng 6(10):1–17
4.
go back to reference Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Beeri C et al (eds) Proceedings of the 7th international conference on database theory. Springer, Jerusalem, p 398–416 Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Beeri C et al (eds) Proceedings of the 7th international conference on database theory. Springer, Jerusalem, p 398–416
5.
go back to reference Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Gunopulos D et al (eds) Proceedings of the 2000 ACM SIGMOD international workshop on data mining and knowledge discovery. ACM Press, Dallas, p 21–30 Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Gunopulos D et al (eds) Proceedings of the 2000 ACM SIGMOD international workshop on data mining and knowledge discovery. ACM Press, Dallas, p 21–30
6.
go back to reference Wang, J, Han, J (2004) BIDE: efficient mining of frequent closed sequences. In: Proceedings of data engineering, 2004, p 79–90 Wang, J, Han, J (2004) BIDE: efficient mining of frequent closed sequences. In: Proceedings of data engineering, 2004, p 79–90
7.
go back to reference Wang M, Shang X, Diao J, Li Z (2010) WIBE: mining frequent closed patterns without candidate maintenance in microarray dataset. In: DMIN, pp 200–205 Wang M, Shang X, Diao J, Li Z (2010) WIBE: mining frequent closed patterns without candidate maintenance in microarray dataset. In: DMIN, pp 200–205
8.
go back to reference Cong G, Tan K, Tung A et al (2004) Mining frequent closed patterns in microarray data. In: ICDM’04. IEEE press, p 363–366 Cong G, Tan K, Tung A et al (2004) Mining frequent closed patterns in microarray data. In: ICDM’04. IEEE press, p 363–366
9.
go back to reference Pan F, Cong G, Tung K, Yang J, Zaki M (2003) Carpenter: finding closed patterns in long biological datasets. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 637–642 Pan F, Cong G, Tung K, Yang J, Zaki M (2003) Carpenter: finding closed patterns in long biological datasets. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 637–642
10.
go back to reference Zhao L, Zaki MJ (2005) MicroCluster: an efficient deterministic biclustering algorithm for microarray data. IEEE Intell Syst 20(6):40–49 (special issue on Data Mining for Bioinformatics)CrossRef Zhao L, Zaki MJ (2005) MicroCluster: an efficient deterministic biclustering algorithm for microarray data. IEEE Intell Syst 20(6):40–49 (special issue on Data Mining for Bioinformatics)CrossRef
11.
go back to reference Wang M, Shang X, Miao M, Li Z, Liu W (2011) FTCluster: efficient mining fault-tolerant biclusters in microarray dataset. In: Proceedings of ICDM 2011 workshop on biological data mining and its applications in healthcare, p 1075–1082 Wang M, Shang X, Miao M, Li Z, Liu W (2011) FTCluster: efficient mining fault-tolerant biclusters in microarray dataset. In: Proceedings of ICDM 2011 workshop on biological data mining and its applications in healthcare, p 1075–1082
12.
go back to reference Wang M, Shang X, Zhang S, Li Z (2010) FDCluster: mining frequent closed discriminative bicluster without candidate maintenance in multiple microarray datasets. In: ICDM 2010 workshop on biological data mining and its applications in healthcare, p 779–786 Wang M, Shang X, Zhang S, Li Z (2010) FDCluster: mining frequent closed discriminative bicluster without candidate maintenance in multiple microarray datasets. In: ICDM 2010 workshop on biological data mining and its applications in healthcare, p 779–786
Metadata
Title
Efficient Mining Frequent Closed Resource Patterns in Resource Effectiveness Data: The MFPattern Approach
Authors
Lihua Zhang
Miao Wang
Qingfan Gu
Zhengjun Zhai
Guoqing Wang
Copyright Year
2014
Publisher
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-54233-6_4