Learning to design complex systems using frequent graph patterns

  1. José Ignacio Estévez 1
  2. Pedro Toledo 1
  3. José Sigut 1
  4. Silvia Alayón 1
  1. 1 Universidad de La Laguna
    info

    Universidad de La Laguna

    San Cristobal de La Laguna, España

    ROR https://ror.org/01r9z8p25

Actas:
International Conference on Machine Learning ICML (2008. Finland)
  1. Pavel Brazdil (ed. lit.)
  2. Abraham Bernstein (ed. lit.)
  3. Larry Hunter (ed. lit.)

Editorial: International Machine Learning Society (IMLS)

ISBN: 978-1-60558-205-4

Año de publicación: 2008

Tipo: Aportación congreso

GOOGLE SCHOLAR

Resumen

The problem of learning to design complexsystems building networks of simpler components is tackled. A framework for the objective comparison of different learning strategies is proposed. The Workflow Schema is thedata structure proposed for the problem formalization. Moreover, the use of graph mining results to define the learning process isanalyzed and the advantages and limitationsemphasized. Finally, an empirical analysis ofthe strategies and heuristics proposed in thedefined benchmark framework is made, andthe results shown.

Referencias bibliográficas

  • Agrawal, R., & Srikant, R. (1995). Mining sequential patterns. Eleventh International Conference on Data Engineering (pp. 3–14). Taipei, Taiwan: IEEE Computer Society Press.
  • Friedler, F., Tarjan, K., Huang, Y. W., & Fan, L. T. Graph-theoretic approach to process synthesis: Axioms and theorems. Chemical Engineering.
  • Greco, G., Guzzo, A., & Manco, G. (2005). Mining and reasoning on workflows. IEEE Transactions on Knowledge and Data Engineering, 17, 519–534. Senior Member-Domenico Sacca.
  • Gyapay, S., & Pataricza, A. (2003). A combination of petri nets and process network synthesis. IEEE International Conference on Systems, Man and Cybernetics, Invited Sessions/Track on ‘Petri Nets and Discrete Event Systems’, 1167–1174.
  • Resende, M., & Ribeiro, C. (2005). Grasp with pathrelinking: Recent advances and applications. Rosen, K., Michaels, J., Gross, J., Grossman, J., & Shier, D. (2000). Handbook of discrete and combinatorial mathematics. CRC Press.
  • Rozinat, A., Alves de Medeiros, A., Gunther, C., Weijters, A., & van der Aalst, W. (2007). Towards an evaluation framework for process mining algorithms. BPM Center Report, BPM-07-06.