Pattern Recognition

Process mining is concerned with the extraction of knowledge about business processes from information system logs. Process discovery algorithms are process mining techniques focused on discovering process models starting from event logs. The applicability and effectiveness of process discovery algorithms rely on features of event logs and process characteristics. Selecting a suitable algorithm for an event log is a tough task due to the variety of variables involved in this process. The traditional approaches use empirical assessment in order to recommend a suitable discovery algorithm. This is a time consuming and computationally expensive approach. The present paper evaluates the usefulness of an approach based on classification to recommend discovery algorithms. A knowledge base was constructed, based on features of event logs and process characteristics, in order to train the classifiers. Experimental results obtained with the classifiers evidence the usefulness of the proposal for recommendation of discovery algorithms.

[1]  Gary R. Bradski,et al.  ORB: An efficient alternative to SIFT or SURF , 2011, 2011 International Conference on Computer Vision.

[2]  Stéphane Marchand-Maillet,et al.  Quantized Ranking for Permutation-Based Indexing , 2013, SISAP.

[3]  Bernd Girod,et al.  Fast Computation of Rotation-Invariant Image Features by an Approximate Radial Gradient Transform , 2013, IEEE Transactions on Image Processing.

[4]  Vitaly Kober,et al.  Multiple objects tracking with HOGs matching in circular windows , 2014, Optics & Photonics - Optical Engineering + Applications.

[5]  Van Nostrand,et al.  Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm , 1967 .

[6]  Gonzalo Navarro,et al.  Effective Proximity Retrieval by Ordering Permutations , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  David G. Lowe,et al.  Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[8]  Tieniu Tan,et al.  A survey on visual surveillance of object motion and behaviors , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[9]  Ricardo A. Baeza-Yates,et al.  Searching in metric spaces , 2001, CSUR.

[10]  Luc Van Gool,et al.  SURF: Speeded Up Robust Features , 2006, ECCV.

[11]  Ronald Fagin,et al.  Comparing top k lists , 2003, SODA '03.

[12]  Vitaly Kober,et al.  CWMA: Circular Window Matching Algorithm , 2013, CIARP.

[13]  Pasquale Savino,et al.  Approximate similarity search in metric spaces using inverted files , 2008, Infoscale.

[14]  Bill Triggs,et al.  Histograms of oriented gradients for human detection , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[15]  Karina Figueroa,et al.  Compact and Efficient Permutations for Proximity Searching , 2012, MCPR.

[16]  Karina Figueroa,et al.  Simple Space-Time Trade-Offs for AESA , 2007, WEA.

[17]  Patrick J. Flynn,et al.  Image understanding for iris biometrics: A survey , 2008, Comput. Vis. Image Underst..

[18]  Steve J. Young,et al.  Partially observable Markov decision processes for spoken dialog systems , 2007, Comput. Speech Lang..

[19]  Karina Figueroa,et al.  An Effective Permutant Selection Heuristic for Proximity Searching in Metric Spaces , 2014, MCPR.

[20]  Andrea Esuli,et al.  Pivot Selection Strategies for Permutation-Based Similarity Search , 2013, SISAP.