Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
A Deep Learning Approach for Valve Defect Recognition in Heart Acoustic Signal Kapitel lesen Erstes Kapitel lesen

2018 | Supplement | Buchkapitel

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

verfasst von : Thanh-Long Nguyen, Bay Vo, Bao Huynh, Vaclav Snasel, Loan T. T. Nguyen

Erschienen in: Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology – ISAT 2017

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Jetzt informieren

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!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Cost-Sensitive Feature Selection for Class Imbalance Problem
Nächstes Kapitel A Dynamic Packed Approach for Analytic Data Warehouse in Ad-Hoc Queries
Literatur
1.
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases, In: SIGMOD, pp. 207–216 (1993)
2.
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487–499 (1994)
3.
Ao, X., Luo, P., Li, C., Zhuang, F., He, Q.: Online frequent episode mining. In: ICDE 2015, pp. 891–902 (2015)
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)
5.
Baralis, E., Cagliero, L., Cerquitelli, T., Garza, P.: Generalized association rule mining with constraints. Inf. Sci. 194, 68–84 (2012)CrossRef
6.
Berkhin, P., Dhillon, I.: Knowledge discovery: clustering. In: Encyclopedia of Complexity and Systems Science, pp. 5051–5064 (2009)
7.
Cagliero, L., Garza, P.: Improving classification models with taxonomy information. Data Knowl. Eng. 86, 85–101 (2013)CrossRef
8.
Dabbiru, M., Shashi, M.: An efficient approach to colossal pattern mining. Int. J. Comput. Sci. Network Secur. 6, 304–312 (2010)
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)
10.
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD 2000, pp. 1–12 (2000)
11.
Hyeok, K., Cholyong, J., Unhyok, R.: Implementation of Association Rule Mining for Network Intrusion Detection. CoRR abs/1601.05335 (2016)
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)CrossRef
13.
Liu, H., Wu, X., Zhang, S.: A new supervised feature selection method for pattern classification. Comput. Intell. 30(2), 342–361 (2014)MathSciNetCrossRef
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)
15.
Mooney, C., Roddick, J.F.: Sequential pattern mining - approaches and algorithms. ACM Comput. Surv. 45(2), 1–19 (2013)CrossRefMATH
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)
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)CrossRef
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)
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)MathSciNetCrossRef
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)
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)
22.
Raza, K.: Application of data mining in bioinformatics. Indian J. Comput. Sci. Eng. 1(2), 114–118 (2013)
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)
24.
Slimani, T., Lazzez, A.: Sequential mining: patterns and algorithms analysis. Int. J. Comput. Electron. Res. 2(5), 639–647 (2013)
25.
Sohrabi, M.K., Barforoush, A.A.: Efficient colossal pattern mining in high dimensional datasets. Knowl. Based Syst. 33, 41–52 (2012)CrossRef
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)
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)
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)CrossRef
29.
Weichbroth, P., Owoc, M., Pleszkun, M.: Web user navigation patterns discovery from WWW server log files. In: FedCSIS 2012, pp. 1177–1176 (2012)
30.
Wojciechowski, M., Zakrzewicz, M.: Dataset filtering techniques in constraint-based frequent pattern mining. Pattern Detect. Discov. 2447, 77–91 (2002)CrossRefMATH
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)
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)CrossRef
33.
Zhang, C., Zhang, S.: Association Rule Mining: Models and Algorithms. LNCS, vol. 2307. Springer (2002). ISBN: 3-540-43533-6
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)MathSciNetCrossRef
35.
Zhou, W., Liu, H., Cheng, H.: Mining closed episodes from event sequences efficiently. PAKDD 1, 310–318 (2010)
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)
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)
Metadaten
Titel
Constraint-Based Method for Mining Colossal Patterns in High Dimensional Databases
verfasst von
Thanh-Long Nguyen
Bay Vo
Bao Huynh
Vaclav Snasel
Loan T. T. Nguyen
Copyright-Jahr
2018
Buch
Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology – ISAT 2017

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

Electronic ISBN: 978-3-319-67220-5

Copyright-Jahr: 2018

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