Business Process Understanding: Mining Many Datasets

  • Jan M. Żytkow
  • Arun P. Sanjeev
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1424)


Institutional databases can be instrumental in understanding a business process, but additional data may broaden the empirical perspective on the investigated process. We present a few data mining principles by which a business process can be analyzed and the results represented. Sequential and parallel process decomposition can apply in a data driven way, guided by a combination of automated discovery and human judgment. Repeatedly, human operators formulate open questions, use queries to prepare the data, issue quests to invoke automated search, and interpret the discovered knowledge. As an example we use mining for knowledge about student enrollment, which is an essential part of the university educational process. The target of discovery has been the understanding of the university enrollment. Many discoveries have been made. The particularly surprising findings have been presented to the university administrators and affected the institutional policies.


Business Process Bayesian Network Graduation Rate Remedial Instruction Parallel Decomposition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Druzdzel, M. & Glymour, C. 1994. Application of the TETRAD II Program to the Study of Student Retention in U.S. Colleges. Proc. AAAI-94 KDD Workshop, 419–430.Google Scholar
  2. Heckerman, D. 1996. Bayesian Networks for Knowledge Discovery, in Fayyad, Piatetsky-Shapiro, Smyth & Uthurusamy eds. Advances in Knowledge Discovery and Data Mining, AAAI Press, pp. 59–82.Google Scholar
  3. Klösgen, W. 1992. Patterns for Knowledge Discovery in Databases. In Proc. of the ML-92 Workshop on Machine Discovery, 1–10. National Institute for Aviation Research, Wichita, KS: Zytkow, J. ed.Google Scholar
  4. Ohrn, A., Komorowski, J., Skowron, A. & Synak, P. 1998. The Design and Implementation of a Knowledge Discovery Toolkit Based on Rough Sets-The ROSETTA System, Rough Sets in Knowledge Discovery, L. Polkowski & A. Skowron eds. Physica Verlag.Google Scholar
  5. Piatetsky-Shapiro, G. & Matheus, C. 1991. Knowledge Discovery Workbench. In Proc. of AAAI-91 KDD Workshop, 11–24. Piatetsky-Shapiro, G. ed.Google Scholar
  6. Sanjeev, A., & Zytkow, J. 1996. A Study of Enrollment and Retention in a University Database, Journal of the Mid-America Association of Educational Opportunity Program Personnel, Volume VIII, pp. 24–41.Google Scholar
  7. Spirtes, P., Glymour, C. & Scheines, R. 1993. Causation, Prediction and Search, Springer-Verlag.Google Scholar
  8. Ziarko, W. & Shan, N. 1994. KDD-R: A Comprehensive System for Knowledge Discovery in Databases Using Rough Sets, in T.Y. Lin & A.M. Wildberger eds. Proc. of Intern. Workshop on Rough Sets and Soft Computing, pp. 164–73.Google Scholar
  9. Żytkow, J. & Zembowicz, R. 1993. Database Exploration in Search of Regularities. Journal of Intelligent Information Systems 2:39–81.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Jan M. Żytkow
    • 1
    • 3
  • Arun P. Sanjeev
    • 2
  1. 1.Computer Science DepartmentUNC CharlotteCharlotteUSA
  2. 2.Office of Institutional ResearchWichita State Univ.WichitaUSA
  3. 3.Institute of Computer SciencePolish Academy of SciencesPoland

Personalised recommendations