Skip to main content

2014 | OriginalPaper | Buchkapitel

17. Supervised Pattern Mining and Applications to Classification

verfasst von : Albrecht Zimmermann, Siegfried Nijssen

Erschienen in: Frequent Pattern Mining

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

In this chapter we describe the use of patterns in the analysis of supervised data. We survey the different settings for finding patterns as well as sets of patterns. The pattern mining settings are categorized according to whether they include class labels as attributes in the data or whether they partition the data based on these labels. The pattern set mining settings are categorized along several dimensions, including whether they perform iterative mining or post-processing, operate globally or locally, and whether they use patterns directly or indirectly for prediction.

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!

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!

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!

Literatur
1.
Zurück zum Zitat C. C. Aggarwal. On effective classification of strings with wavelets. In KDD, pages 163–172. ACM, 2002. C. C. Aggarwal. On effective classification of strings with wavelets. In KDD, pages 163–172. ACM, 2002.
2.
Zurück zum Zitat R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307–328. AAAI/MIT Press, 1996. ISBN 0-262-56097-6. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307–328. AAAI/MIT Press, 1996. ISBN 0-262-56097-6.
3.
Zurück zum Zitat M.-L. Antonie and O. R. Zaïane. Text document categorization by term association. In ICDM, pages 19–26. IEEE Computer Society, 2002. M.-L. Antonie and O. R. Zaïane. Text document categorization by term association. In ICDM, pages 19–26. IEEE Computer Society, 2002.
4.
Zurück zum Zitat B. Arunasalam and S. Chawla. CCCS: a top-down associative classifier for imbalanced class distributions. In T. Eliassi-Rad, L. H. Ungar, M. Craven, and D. Gunopulos, editors, KDD, pages 517–522. ACM, 2006. B. Arunasalam and S. Chawla. CCCS: a top-down associative classifier for imbalanced class distributions. In T. Eliassi-Rad, L. H. Ungar, M. Craven, and D. Gunopulos, editors, KDD, pages 517–522. ACM, 2006.
5.
Zurück zum Zitat M. Atzmüller and F. Puppe. SD-Map-a fast algorithm for exhaustive subgroup discovery. In [16], pages 6–17. ISBN 3-540-45374-1. M. Atzmüller and F. Puppe. SD-Map-a fast algorithm for exhaustive subgroup discovery. In [16], pages 6–17. ISBN 3-540-45374-1.
6.
Zurück zum Zitat S. D. Bay and M. J. Pazzani. Detecting group differences: Mining constrast sets. Data Mining and Knowledge Discovery, 5 (3): 213–246, 2001.CrossRefMATH S. D. Bay and M. J. Pazzani. Detecting group differences: Mining constrast sets. Data Mining and Knowledge Discovery, 5 (3): 213–246, 2001.CrossRefMATH
7.
Zurück zum Zitat B. Bringmann and A. Zimmermann. Tree2-Decision trees for tree structured data. In A. Jorge, L. Torgo, P. Brazdil, R. Camacho, and J. Gama, editors, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, pages 46–58. Springer, 2005. B. Bringmann and A. Zimmermann. Tree2-Decision trees for tree structured data. In A. Jorge, L. Torgo, P. Brazdil, R. Camacho, and J. Gama, editors, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, pages 46–58. Springer, 2005.
8.
Zurück zum Zitat B. Bringmann and A. Zimmermann. One in a million: picking the right patterns. Knowledge and Information Systems, 18 (1): 61–81, 2009.CrossRef B. Bringmann and A. Zimmermann. One in a million: picking the right patterns. Knowledge and Information Systems, 18 (1): 61–81, 2009.CrossRef
9.
Zurück zum Zitat B. Bringmann, S. Nijssen, and A. Zimmermann. Pattern-based classification: A unifying perspective. In A. Knobbe and J. Fürnkranz, editors, From Local Patterns to Global Models: Proceedings of the ECML/PKDD-09 Workshop (LeGo-09), pages 36–50, 2009. B. Bringmann, S. Nijssen, and A. Zimmermann. Pattern-based classification: A unifying perspective. In A. Knobbe and J. Fürnkranz, editors, From Local Patterns to Global Models: Proceedings of the ECML/PKDD-09 Workshop (LeGo-09), pages 36–50, 2009.
10.
Zurück zum Zitat L. Cerf, D. Gay, N. Selmaoui-Folcher, B. Crémilleux, and J.-F. Boulicaut. Parameter-free classification in multi-class imbalanced data sets. Data Knowl. Eng., 87: 109–129, 2013.CrossRef L. Cerf, D. Gay, N. Selmaoui-Folcher, B. Crémilleux, and J.-F. Boulicaut. Parameter-free classification in multi-class imbalanced data sets. Data Knowl. Eng., 87: 109–129, 2013.CrossRef
11.
Zurück zum Zitat H. Cheng, X. Yan, J. Han, and C.-W. Hsu. Discriminative frequent pattern analysis for effective classification. In Proceedings of the 23rd International Conference on Data Engineering, pages 716–725. IEEE, 2007. H. Cheng, X. Yan, J. Han, and C.-W. Hsu. Discriminative frequent pattern analysis for effective classification. In Proceedings of the 23rd International Conference on Data Engineering, pages 716–725. IEEE, 2007.
12.
Zurück zum Zitat H. Cheng, X. Yan, J. Han, and P. S. Yu. Direct discriminative pattern mining for effective classification. In Proceedings of the 24th International Conference on Data Engineering, pages 169–178. IEEE, 2008. H. Cheng, X. Yan, J. Han, and P. S. Yu. Direct discriminative pattern mining for effective classification. In Proceedings of the 24th International Conference on Data Engineering, pages 169–178. IEEE, 2008.
13.
Zurück zum Zitat S. Chiappa, H. Saigo, and K. Tsuda. A Bayesian approach to graphy regression with relevant subgraph selection. In SDM, pages 295–304. SIAM, 2009. S. Chiappa, H. Saigo, and K. Tsuda. A Bayesian approach to graphy regression with relevant subgraph selection. In SDM, pages 295–304. SIAM, 2009.
14.
Zurück zum Zitat G. Dong, X. Zhang, L. Wong, and J. Li. Caep: Classification by aggregating emerging patterns. In S. Arikawa and K. Furukawa, editors, Discovery Science, volume 1721 of Lecture Notes in Computer Science, pages 30–42. Springer, 1999. ISBN 3-540-66713-X. G. Dong, X. Zhang, L. Wong, and J. Li. Caep: Classification by aggregating emerging patterns. In S. Arikawa and K. Furukawa, editors, Discovery Science, volume 1721 of Lecture Notes in Computer Science, pages 30–42. Springer, 1999. ISBN 3-540-66713-X.
15.
Zurück zum Zitat W. Fan, K. Zhang, H. Cheng, J. Gao, X. Yan, J. Han, P. S. Yu, and O. Verscheure. Direct mining of discriminative and essential frequent patterns via model-based search tree. In Y. Li, B. Liu, and S. Sarawagi, editors, Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 230–238. ACM, 2008. ISBN 978-1-60558-193-4. W. Fan, K. Zhang, H. Cheng, J. Gao, X. Yan, J. Han, P. S. Yu, and O. Verscheure. Direct mining of discriminative and essential frequent patterns via model-based search tree. In Y. Li, B. Liu, and S. Sarawagi, editors, Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 230–238. ACM, 2008. ISBN 978-1-60558-193-4.
16.
Zurück zum Zitat J. Fürnkranz, T. Scheffer, and M. Spiliopoulou, editors. Knowledge Discovery in Databases: PKDD 2006,10th European Conference on Principles and Practice of Knowledge Discovery in Databases, Berlin, Germany, September 18–22, 2006, Proceedings, 2006. Springer. ISBN 3-540-45374-1. J. Fürnkranz, T. Scheffer, and M. Spiliopoulou, editors. Knowledge Discovery in Databases: PKDD 2006,10th European Conference on Principles and Practice of Knowledge Discovery in Databases, Berlin, Germany, September 18–22, 2006, Proceedings, 2006. Springer. ISBN 3-540-45374-1.
17.
Zurück zum Zitat F. B. Galiano, J. C. Cubero, D. Sánchez, and J.-M. Serrano. Art: A hybrid classification model. Machine Learning, 54 (1): 67–92, 2004.CrossRef F. B. Galiano, J. C. Cubero, D. Sánchez, and J.-M. Serrano. Art: A hybrid classification model. Machine Learning, 54 (1): 67–92, 2004.CrossRef
18.
Zurück zum Zitat D. Gay, N. Selmaoui, and J.-F. Boulicaut. Pattern-based decision tree construction. In ICDIM, pages 291–296. IEEE, 2007. D. Gay, N. Selmaoui, and J.-F. Boulicaut. Pattern-based decision tree construction. In ICDIM, pages 291–296. IEEE, 2007.
19.
Zurück zum Zitat H. Grosskreutz, S. Rüping, and S. Wrobel. Tight optimistic estimates for fast subgroup discovery. In W. Daelemans, B. Goethals, and K. Morik, editors, ECML/PKDD (1), volume 5211 of Lecture Notes in Computer Science, pages 440–456. Springer, 2008. ISBN 978-3-540-87478-2. H. Grosskreutz, S. Rüping, and S. Wrobel. Tight optimistic estimates for fast subgroup discovery. In W. Daelemans, B. Goethals, and K. Morik, editors, ECML/PKDD (1), volume 5211 of Lecture Notes in Computer Science, pages 440–456. Springer, 2008. ISBN 978-3-540-87478-2.
20.
Zurück zum Zitat J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In W. Chen, J. F. Naughton, and P. A. Bernstein, editors, SIGMOD Conference, pages 1–12. ACM, 2000. ISBN 1-58113-218-2. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In W. Chen, J. F. Naughton, and P. A. Bernstein, editors, SIGMOD Conference, pages 1–12. ACM, 2000. ISBN 1-58113-218-2.
21.
Zurück zum Zitat B. Kavsek and N. Lavrac. Apriori-SD: Adapting association rule learning to subgroup discovery. Applied Artificial Intelligence, 20 (7): 543–583, 2006.CrossRef B. Kavsek and N. Lavrac. Apriori-SD: Adapting association rule learning to subgroup discovery. Applied Artificial Intelligence, 20 (7): 543–583, 2006.CrossRef
22.
Zurück zum Zitat S. Kramer and L. De Raedt. Feature construction with version spaces for biochemical applications. In C. E. Brodley and A. P. Danyluk, editors, ICML, pages 258–265. Morgan Kaufmann, 2001. ISBN 1-55860-778-1. S. Kramer and L. De Raedt. Feature construction with version spaces for biochemical applications. In C. E. Brodley and A. P. Danyluk, editors, ICML, pages 258–265. Morgan Kaufmann, 2001. ISBN 1-55860-778-1.
23.
Zurück zum Zitat N. Lavrač, B. Kavsek, P. A. Flach, and L. Todorovski. Subgroup discovery with CN2-SD. Journal of Machine Learning Research, 5: 153–188, 2004.MathSciNet N. Lavrač, B. Kavsek, P. A. Flach, and L. Todorovski. Subgroup discovery with CN2-SD. Journal of Machine Learning Research, 5: 153–188, 2004.MathSciNet
24.
Zurück zum Zitat D. Leman, A. Feelders, and A. J. Knobbe. Exceptional model mining. In ECML/PKDD (2), pages 1–16, 2008. D. Leman, A. Feelders, and A. J. Knobbe. Exceptional model mining. In ECML/PKDD (2), pages 1–16, 2008.
25.
Zurück zum Zitat W. Li, J. Han, and J. Pei. CMAR: Accurate and efficient classification based on multiple class-association rules. In N. Cercone, T. Y. Lin, and X. Wu, editors, Proceedings of the 2001 IEEE International Conference on Data Mining, pages 369–376, San José, California, USA, Nov. 2001. IEEE Computer Society. W. Li, J. Han, and J. Pei. CMAR: Accurate and efficient classification based on multiple class-association rules. In N. Cercone, T. Y. Lin, and X. Wu, editors, Proceedings of the 2001 IEEE International Conference on Data Mining, pages 369–376, San José, California, USA, Nov. 2001. IEEE Computer Society.
26.
Zurück zum Zitat J. Li, G. Dong, K. Ramamohanarao, and L. Wong. A new instance-based lazy discovery and classification system. Machine Learning, 54 (2): 99–124, 2004.CrossRefMATH J. Li, G. Dong, K. Ramamohanarao, and L. Wong. A new instance-based lazy discovery and classification system. Machine Learning, 54 (2): 99–124, 2004.CrossRefMATH
27.
Zurück zum Zitat B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. In R. Agrawal, P. E. Stolorz, and G. Piatetsky-Shapiro, editors, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pages 80–86, New York City, New York, USA, Aug. 1998. AAAI Press. B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. In R. Agrawal, P. E. Stolorz, and G. Piatetsky-Shapiro, editors, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pages 80–86, New York City, New York, USA, Aug. 1998. AAAI Press.
28.
Zurück zum Zitat D. Meretakis and B. Wüthrich. Extending naïve bayes classifiers using long itemsets. In U. M. Fayyad, S. Chaudhuri, and D. Madigan, editors, KDD, pages 165–174. ACM, 1999. ISBN 1-58113-143-7. D. Meretakis and B. Wüthrich. Extending naïve bayes classifiers using long itemsets. In U. M. Fayyad, S. Chaudhuri, and D. Madigan, editors, KDD, pages 165–174. ACM, 1999. ISBN 1-58113-143-7.
29.
Zurück zum Zitat S. Morishita and J. Sese. Traversing itemset lattices with statistical metric pruning. In Proceedings of the Nineteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 226–236, Dallas, Texas, USA, May 2000. ACM. S. Morishita and J. Sese. Traversing itemset lattices with statistical metric pruning. In Proceedings of the Nineteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 226–236, Dallas, Texas, USA, May 2000. ACM.
30.
Zurück zum Zitat S. Nijssen and É. Fromont. Optimal constraint-based decision tree induction from itemset lattices. Data Min. Knowl. Discov., 21 (1): 9–51, 2010.CrossRefMathSciNet S. Nijssen and É. Fromont. Optimal constraint-based decision tree induction from itemset lattices. Data Min. Knowl. Discov., 21 (1): 9–51, 2010.CrossRefMathSciNet
31.
Zurück zum Zitat S. Nijssen and J. N. Kok. Multi-class correlated pattern mining. In F. Bonchi and J.-F. Boulicaut, editors, KDID, volume 3933 of Lecture Notes in Computer Science, pages 165–187. Springer, 2005. ISBN 3-540-33292-8. S. Nijssen and J. N. Kok. Multi-class correlated pattern mining. In F. Bonchi and J.-F. Boulicaut, editors, KDID, volume 3933 of Lecture Notes in Computer Science, pages 165–187. Springer, 2005. ISBN 3-540-33292-8.
32.
Zurück zum Zitat P. K. Novak, N. Lavrac, and G. I. Webb. Supervised descriptive rule discovery: A unifying survey of contrast set, emerging pattern and subgroup mining. Journal of Machine Learning Research, 10: 377–403, 2009.MATH P. K. Novak, N. Lavrac, and G. I. Webb. Supervised descriptive rule discovery: A unifying survey of contrast set, emerging pattern and subgroup mining. Journal of Machine Learning Research, 10: 377–403, 2009.MATH
33.
Zurück zum Zitat H. Saigo, N. Krämer, and K. Tsuda. Partial least squares regression for graph mining. In Y. Li, B. Liu, and S. Sarawagi, editors, Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 230–238. ACM, 2008., pages 578–586. ISBN 978-1-60558-193-4. H. Saigo, N. Krämer, and K. Tsuda. Partial least squares regression for graph mining. In Y. Li, B. Liu, and S. Sarawagi, editors, Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 230–238. ACM, 2008., pages 578–586. ISBN 978-1-60558-193-4.
34.
Zurück zum Zitat H. Saigo, S. Nowozin, T. Kadowaki, T. Kudo, and K. Tsuda. gboost:a mathematical programming approach to graph classification and regression. Machine Learning, 75 (1): 69–89, 2009. H. Saigo, S. Nowozin, T. Kadowaki, T. Kudo, and K. Tsuda. gboost:a mathematical programming approach to graph classification and regression. Machine Learning, 75 (1): 69–89, 2009.
35.
Zurück zum Zitat M. Thoma, H. Cheng, A. Gretton, J. Han, H.-P. Kriegel, A. J. Smola, L. Song, P. S. Yu, X. Yan, and K. M. Borgwardt. Discriminative frequent subgraph mining with optimality guarantees. Statistical Analysis and Data Mining, 3 (5): 302–318, 2010.CrossRefMathSciNet M. Thoma, H. Cheng, A. Gretton, J. Han, H.-P. Kriegel, A. J. Smola, L. Song, P. S. Yu, X. Yan, and K. M. Borgwardt. Discriminative frequent subgraph mining with optimality guarantees. Statistical Analysis and Data Mining, 3 (5): 302–318, 2010.CrossRefMathSciNet
36.
Zurück zum Zitat M. van Leeuwen, J. Vreeken, and A. Siebes. Compression picks item sets that matter. In [16], pages 585–592. ISBN 3-540-45374–1. M. van Leeuwen, J. Vreeken, and A. Siebes. Compression picks item sets that matter. In [16], pages 585–592. ISBN 3-540-45374–1.
37.
Zurück zum Zitat A. Veloso, W. M. Jr., and M. J. Zaki. Lazy associative classification. In ICDM, pages 645–654. IEEE Computer Society, 2006. A. Veloso, W. M. Jr., and M. J. Zaki. Lazy associative classification. In ICDM, pages 645–654. IEEE Computer Society, 2006.
38.
Zurück zum Zitat J. Wang and G. Karypis. Harmony: Efficiently mining the best rules for classification. In SDM, 2005. J. Wang and G. Karypis. Harmony: Efficiently mining the best rules for classification. In SDM, 2005.
39.
Zurück zum Zitat G. I. Webb. Opus: An efficient admissible algorithm for unordered search. J. Artif. Intell. Res. (JAIR), 3: 431–465, 1995. G. I. Webb. Opus: An efficient admissible algorithm for unordered search. J. Artif. Intell. Res. (JAIR), 3: 431–465, 1995.
40.
Zurück zum Zitat M. J. Zaki. Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng., 12 (3): 372–390, 2000.CrossRefMathSciNet M. J. Zaki. Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng., 12 (3): 372–390, 2000.CrossRefMathSciNet
41.
Zurück zum Zitat M. J. Zaki and C. C. Aggarwal. XRules: an effective structural classifier for XML data. In L. Getoor, T. E. Senator, P. Domingos, and C. Faloutsos, editors, Proceedings http://www.nakedcapitalism.com/of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 316–325, Washington, DC, USA, Aug. 2003. ACM. M. J. Zaki and C. C. Aggarwal. XRules: an effective structural classifier for XML data. In L. Getoor, T. E. Senator, P. Domingos, and C. Faloutsos, editors, Proceedings http://www.nakedcapitalism.com/of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 316–325, Washington, DC, USA, Aug. 2003. ACM.
42.
Zurück zum Zitat A. Zimmermann and B. Bringmann. Ctc-correlating tree patterns for classification. In J. Han, B. W. Wah, V. Raghavan, X. Wu, and R. Rastogi, editors, Proceedings of the Fifth IEEE International Conference on Data Mining, pages 833–836, Houston, Texas, USA, Nov. 2005. IEEE. A. Zimmermann and B. Bringmann. Ctc-correlating tree patterns for classification. In J. Han, B. W. Wah, V. Raghavan, X. Wu, and R. Rastogi, editors, Proceedings of the Fifth IEEE International Conference on Data Mining, pages 833–836, Houston, Texas, USA, Nov. 2005. IEEE.
43.
Zurück zum Zitat A. Zimmermann and L. De Raedt. Corclass: Correlated association rule mining for classification. In E. Suzuki and S. Arikawa, editors, Proceedings of the 7th International Conference on Discovery Science, pages 60–72, Padova, Italy, Oct. 2004. Springer. A. Zimmermann and L. De Raedt. Corclass: Correlated association rule mining for classification. In E. Suzuki and S. Arikawa, editors, Proceedings of the 7th International Conference on Discovery Science, pages 60–72, Padova, Italy, Oct. 2004. Springer.
44.
Zurück zum Zitat A. Zimmermann and L. De Raedt. Cluster-grouping: from subgroup discovery to clustering. Machine Learning, 77 (1): 125–159, 2009.CrossRef A. Zimmermann and L. De Raedt. Cluster-grouping: from subgroup discovery to clustering. Machine Learning, 77 (1): 125–159, 2009.CrossRef
45.
Zurück zum Zitat A. Zimmermann, B. Bringmann, and U. Rückert. Fast, effective molecular feature mining by local optimization. In J. L. Balcázar, F. Bonchi, A. Gionis, and M. Sebag, editors, ECML/PKDD (3), volume 6323 of Lecture Notes in Computer Science, pages 563–578. Springer, 2010. ISBN 978-3-642-15938-1. A. Zimmermann, B. Bringmann, and U. Rückert. Fast, effective molecular feature mining by local optimization. In J. L. Balcázar, F. Bonchi, A. Gionis, and M. Sebag, editors, ECML/PKDD (3), volume 6323 of Lecture Notes in Computer Science, pages 563–578. Springer, 2010. ISBN 978-3-642-15938-1.
Metadaten
Titel
Supervised Pattern Mining and Applications to Classification
verfasst von
Albrecht Zimmermann
Siegfried Nijssen
Copyright-Jahr
2014
DOI
https://doi.org/10.1007/978-3-319-07821-2_17