<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2 20190208//EN" "https://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" article-type="research-article" dtd-version="1.2" xml:lang="en">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">IJECIS</journal-id>
<journal-title-group><journal-title>International Journal of E-Commerce and Information Systems</journal-title></journal-title-group>
<publisher><publisher-name>Thomson &amp; Ryberg Publications</publisher-name></publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.62715/ijecis.2026.v1.i1.pp21-26</article-id>
<article-id pub-id-type="publisher-id">05002a7542</article-id>
<article-categories><subj-group subj-group-type="heading"><subject>Methodology Article</subject></subj-group></article-categories>
<title-group><article-title>Measuring Checkout Friction With Session Replay Analytics and Sequential Pattern Models</article-title></title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes"><name><surname>Lee</surname><given-names>Rodrigo</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1">*</xref></contrib>
<contrib contrib-type="author"><name><surname>Desai</surname><given-names>Larissa</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib>
<contrib contrib-type="author"><name><surname>Zulu</surname><given-names>Chaeyoung</given-names></name><xref ref-type="aff" rid="aff3"><sup>3</sup></xref></contrib>
<aff id="aff1"><label>1</label>Department of Computer Science, Bharathapuzha Graduate Institute of Computer Science, Nigeria</aff>
<aff id="aff2"><label>2</label>Department of Computer Science, Rhone Academy of Computer Science, Argentina</aff>
<aff id="aff3"><label>3</label>Department of Computer Science, Achankovil Academy of Computer Science, Denmark</aff>
</contrib-group>
<author-notes><corresp id="cor1">* Correspondence: <email>rodrigo.lee@bharathapuzha.edu</email></corresp></author-notes>
<pub-date pub-type="epub" iso-8601-date="2026-09-19"><day>19</day><month>09</month><year>2026</year></pub-date>
<volume>1</volume>
<issue>1</issue>
<fpage>21</fpage>
<lpage>26</lpage>
<history>
<date date-type="received" iso-8601-date="2026-05-21"><day>21</day><month>05</month><year>2026</year></date>
<date date-type="accepted" iso-8601-date="2026-07-29"><day>29</day><month>07</month><year>2026</year></date>
</history>
<permissions><copyright-statement>© 2026 The Author(s)</copyright-statement><copyright-year>2026</copyright-year><license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by/4.0/"><license-p>This is an open access article distributed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).</license-p></license></permissions>
<self-uri xlink:href="https://trpub.org/article.php?id=05002a7542"/>
<abstract><p>Checkout is the stage of an online purchase at which a shopper who has already chosen what to buy can still be lost to the design of the process. Funnel reports show where shoppers leave but not what they were doing when they left. Session replay tools record the detailed sequence of interactions within a page, including clicks, field edits, validation errors and pauses, and so hold the missing information, though in a volume no analyst can watch. This article proposes a procedure for turning replay data into a measure of checkout friction using sequential pattern models. The procedure has seven steps: define the funnel and the outcome, capture events with privacy safeguards, encode them in a compact alphabet, assemble and label sessions, mine frequent sequences and contrast them between completed and abandoned checkouts, summarise the result in a state-transition model and a friction index, and confirm candidate patterns by targeted replay review and controlled experiment. Each step is described with its purpose and its main pitfalls. The procedure is proposed on the basis of published methods and has not been validated on storefront data here.</p></abstract>
<kwd-group kwd-group-type="author">
<kwd>Checkout friction</kwd>
<kwd>Session replay</kwd>
<kwd>Sequential pattern mining</kwd>
<kwd>Cart abandonment</kwd>
<kwd>Clickstream analysis</kwd>
<kwd>Usability measurement</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="sec1"><title>1. Introduction</title>
<p>A shopper who reaches the checkout has found a product, accepted a price and expressed an intention to buy. Losing that shopper to a confusing address form or a payment error is the most avoidable kind of lost sale. Online retailers have long monitored the checkout with funnel reports, which count how many sessions pass from cart to delivery details to payment to confirmation. A funnel report locates the leak by step. It says nothing about the cause, because it treats each step as a single event when it is in fact several dozen interactions.</p>
<p>Not all abandonment is the retailer&#x27;s doing. Shoppers use carts to store items, to compare totals and to wait for a better price, and many leave for reasons that no form design could change (Kukar-Kinney and Close, 2010). The task for measurement is to separate that background from abandonment that follows difficulty with the process itself. This article uses the word friction for the second kind: effort, error or delay that the interface imposes on a user who is trying to complete the purchase.</p>
<p>Session replay data and sequential pattern models suit this task, the first because it records what happens inside each step and the second because it finds regularities in ordered events. This article sets out a procedure that joins them. It is a methodological proposal. No dataset is analysed and no performance is claimed, and the closing sections state what would have to be shown before the procedure could be relied upon.</p>
</sec>
<sec id="sec2"><title>2. Background</title>
<p>Three matters need to be set out before the procedure: what friction means in usability terms, what a replay tool records, and which models find structure in ordered events.</p>
<sec id="sec2-2"><title>2.1. Friction as a usability concept</title>
<p>The standard definition of usability is the extent to which specified users can achieve specified goals with effectiveness, efficiency and satisfaction in a specified context of use (ISO, 2018). Friction, in these terms, is a shortfall in effectiveness or efficiency: the user fails, or succeeds at greater cost in time and actions than the task requires. Marketing research on clickstreams reached a similar view from another direction. Sismeiro and Bucklin (2004) modelled online purchase as a series of tasks that the visitor must complete in turn, and showed that what visitors do and encounter at each task helps to predict whether they complete the next.</p>
</sec>
<sec id="sec2-3"><title>2.2. What session replay records</title>
<p>Conventional clickstream data record page requests, and a substantial literature models them: typologies of visits by navigation pattern (Moe, 2003), path models that predict conversion from the sequence of pages viewed (Montgomery et al., 2004), and reviews of the field (Bucklin and Sismeiro, 2009). Session replay works at a finer grain. A script in the page logs changes to the document, pointer and touch events, scrolling, focus and input on form fields, and errors, each with a timestamp, so that the session can be reconstructed and viewed. Vendors derive from these logs signals such as repeated rapid clicks on one element or clicks on elements that do not respond. The raw record is rich, but it is used mostly by watching individual sessions, which does not scale and invites selective attention.</p>
</sec>
<sec id="sec2-4"><title>2.3. Sequential pattern models</title>
<p>Sequential pattern mining was introduced by Agrawal and Srikant (1995) to find subsequences that occur in at least a minimum share of customer sequences, a share called support. Their later GSP algorithm added time and gap constraints (Srikant and Agrawal, 1996). SPADE reorganised the search around a vertical data format (Zaki, 2001) and PrefixSpan avoided candidate generation by growing patterns from projected databases (Pei et al., 2004); a survey of the family is given by Fournier-Viger et al. (2017). Three neighbouring ideas are also used below. Emerging patterns are those whose support differs sharply between two datasets (Dong and Li, 1999). Hidden Markov models represent a sequence as the output of a small number of unobserved states (Rabiner, 1989). Process mining offers related tools for comparing recorded behaviour with an intended process model (van der Aalst, 2016).</p>
</sec>
</sec>
<sec id="sec3"><title>3. The Proposed Procedure</title>
<p>The procedure has seven steps. Figure 1 shows their order and Table 1 lists the output and the main pitfall of each.</p>
<table-wrap id="tbl1"><label>Table 1</label><caption><p>Output and main pitfall of each step of the proposed procedure</p></caption><table frame="hsides" rules="groups"><thead><tr><th>Step</th><th>Output</th><th>Main pitfall</th></tr></thead><tbody><tr><td>1. Define funnel and outcome</td><td>Written definitions of checkout start, completion and abandonment</td><td>Counting shoppers who return later as abandoners</td></tr><tr><td>2. Capture events</td><td>Event log with sensitive fields masked at source</td><td>Recording personal or payment data</td></tr><tr><td>3. Encode alphabet</td><td>Dictionary mapping raw events to a few dozen symbols</td><td>Alphabet so fine that every pattern is rare</td></tr><tr><td>4. Assemble and label</td><td>One labelled sequence per checkout attempt</td><td>Mixing devices and interface versions in one corpus</td></tr><tr><td>5. Mine and contrast</td><td>Ranked patterns over-represented among abandoned attempts</td><td>Spurious patterns from many comparisons</td></tr><tr><td>6. Model and index</td><td>Transition model and a friction index for each step</td><td>Reading the index as a causal effect</td></tr><tr><td>7. Confirm</td><td>Reviewed replays and experiment results for leading patterns</td><td>Changing the interface on unconfirmed patterns</td></tr></tbody></table></table-wrap>
<fig id="fig1"><label>Figure 1</label><caption><p>The seven steps of the proposed procedure for measuring checkout friction from session replay data</p></caption><graphic xlink:href="IJECIS_V1I1_2026_04_Figure1.png" mimetype="image" mime-subtype="png"/></fig>
<p>The first step fixes definitions. Checkout begins at a named event, usually the first view of the delivery or payment form, and ends in completion when the order confirmation is recorded. Abandonment needs a rule: a checkout attempt is treated as abandoned if no completion follows within the session, where a session is closed by an inactivity timeout of the kind long used in web usage mining (Cooley et al., 1999). Shoppers who leave and complete the purchase later, perhaps on another device, will be miscounted unless attempts can be linked by account or order, and the definition should state how such cases are handled.</p>
<p>The second step captures the events. Replay scripts can record everything typed into a form, and a checkout form contains names, addresses and card details. Capture must therefore be configured so that field contents are masked before they leave the browser and only the fact, timing and validity of an input are retained. The procedure needs no more than that. The section on privacy and governance returns to the conditions under which such recording is acceptable.</p>
<p>Raw replay events are too varied to mine directly. The third step maps them to a compact alphabet in which each symbol names an action on a class of element: focus on the postcode field, an edit, a validation error on the card number, a tap on the pay button, a tap with no response, a change of delivery option, a scroll back to an earlier section, a switch to another application. Durations are discretised into symbols for long pauses. The alphabet is the main modelling decision. If it is too fine, every pattern is rare; if it is too coarse, a field that causes trouble cannot be told from one that does not. A few dozen symbols is a reasonable starting size, to be revised after the first pass.</p>
<p>In the fourth step events are grouped into checkout attempts and each attempt becomes one sequence labelled completed or abandoned. Sequences should be kept in separate corpora by device class and by interface version, because the same symbol can mean different things on a phone and on a desktop, and because a pattern that reflects a layout since corrected is of no interest. Automated traffic is removed at this point as part of ordinary data cleaning (Cooley et al., 1999).</p>
<p>The fifth step mines the sequences. A pattern-growth algorithm such as PrefixSpan is run on the abandoned and the completed corpora with a modest minimum support and a maximum gap between consecutive symbols, so that patterns describe behaviour that is close together in time (Pei et al., 2004). For each frequent pattern the support in the two corpora is compared. Patterns much more common among abandoned attempts are the candidates of interest, in the sense of emerging patterns (Dong and Li, 1999). Because thousands of patterns are compared, the differences should be controlled for multiple testing, for which the false discovery rate is the natural criterion (Benjamini and Hochberg, 1995), and the surviving patterns should be checked for stability on a later period of data.</p>
<p>Pattern lists are hard to communicate, so the sixth step summarises them in two forms. One is a transition model: a first-order Markov chain over the symbols, or a hidden Markov model with a handful of states that can be read as progressing, correcting, hesitating and leaving (Rabiner, 1989). The time a session spends in the correcting and hesitating states, and the probability of leaving from them, describe friction step by step. The other form is a friction index, defined in the next section. Either summary can be tracked over time in the way that funnel conversion already is.</p>
<p>The final step tests the candidates. Analysts watch a small random sample of replays that contain each leading pattern and a sample that do not, to see whether the pattern corresponds to a recognisable difficulty and what in the interface produces it. Patterns that survive this review become hypotheses for change, and the change is evaluated by a controlled experiment with completion as the outcome (Kohavi et al., 2020). Only at this stage is a causal statement justified. A pattern associated with abandonment may mark shoppers who were never going to buy, and a design change is the way to find out.</p>
</sec>
<sec id="sec4"><title>4. A Friction Index</title>
<p>A single number per checkout step is useful for monitoring, provided its construction is transparent. One simple proposal is as follows. Let the confirmed friction patterns for a step be those that passed the review in step seven. The index for the step in a given period is the share of checkout attempts reaching that step in which at least one confirmed pattern occurs. It rises when more shoppers meet a known difficulty and falls when a fix takes effect. A weighted variant multiplies each pattern by its growth rate, the ratio of its support among abandoned attempts to its support among completed ones, so that patterns more strongly tied to leaving count for more.</p>
<p>The index is descriptive. It measures the prevalence of behaviours that have been judged to indicate difficulty, and it inherits every weakness of that judgement. It should be reported alongside the completion rate and never in place of it, and its pattern set should be derived afresh whenever the interface changes materially, since new designs produce new ways of going wrong. Comparing index values between different retailers, or between phone and desktop, is not meaningful unless the alphabets and pattern sets are the same.</p>
</sec>
<sec id="sec5"><title>5. Privacy and Governance</title>
<p>Session replay is among the more intrusive forms of web analytics, and the procedure is acceptable only within clear limits. Under the General Data Protection Regulation, personal data must be adequate, relevant and limited to what is necessary for the purpose, and controllers must build data protection into the design of their processing (European Union, 2016). For the present purpose the necessary data are event types, element classes and timings. Field contents, free-text entries and anything displayed on the payment form are not needed and should be masked in the browser. Retention can be short, because the sequences are aggregated into patterns soon after collection.</p>
<p>Three governance practices follow. The alphabet dictionary should be reviewed with the organisation&#x27;s data protection function, since it is the precise statement of what is kept. Access to viewable replays, as distinct from encoded sequences, should be restricted to the few analysts who perform the confirmation step. And shoppers should be informed that interaction recording takes place and offered whatever choice the applicable law requires. Requirements differ between jurisdictions, and this article does not offer legal advice.</p>
</sec>
<sec id="sec6"><title>6. Limitations and What Remains to Be Shown</title>
<p>The procedure is a proposal built from published components, and it has not been validated here. Its central assumption is that difficulty leaves a recognisable trace in interaction sequences, and that the trace differs from the behaviour of a shopper who is merely undecided. That is plausible for validation errors and unresponsive buttons. It is doubtful for hesitation, where a long pause may equally mean a search for a card, an interruption, or second thoughts about the purchase. Whether mined patterns identify interface problems more quickly or more completely than expert review and ordinary funnel analysis is an empirical question.</p>
<p>Several technical uncertainties also need study. Results may be sensitive to the alphabet, the support threshold and the gap constraint, and an honest application would report how the pattern list changes as these vary. Mobile checkouts that hand off to a wallet or banking application leave a gap in the record exactly where payment happens. Sampling of sessions by the replay tool, common for reasons of cost, may under-represent rare but severe failures. And the confirmation experiments require enough traffic to detect modest changes in completion, which smaller retailers may lack. Until such questions are examined on real storefront data, the friction index should be treated as an aid to investigation.</p>
</sec>
<sec id="sec7"><title>7. Conclusion</title>
<p>Funnel reports show where checkouts are abandoned and session replays show how, one session at a time. The procedure proposed in this article connects the two by encoding replay events as sequences, mining the patterns that distinguish abandoned from completed attempts, summarising them in a transition model and an index, and confirming candidates by review and experiment before any conclusion is drawn. Its ingredients are standard and their combination is untested. Applied with care for privacy and for the difference between association and cause, it offers a structured way to decide which parts of a checkout deserve a designer&#x27;s attention first.</p>
</sec>
<sec id="sec8"><title>Conflict of interest</title>
<p>To be declared by the author(s) before publication.</p>
</sec>
<sec id="sec9"><title>Funding</title>
<p>To be declared by the author(s) before publication.</p>
</sec>
</body>
<back>
<ref-list><title>References</title>
<ref id="ref1"><label>1</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Agrawal, R. and Srikant, R.</string-name></person-group> (<year>1995</year>). <article-title>Mining sequential patterns</article-title>. <source>Proceedings of the Eleventh International Conference on Data Engineering</source>, <fpage>3-14</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/ICDE.1995.380415">https://doi.org/10.1109/ICDE.1995.380415</ext-link></mixed-citation></ref>
<ref id="ref2"><label>2</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Benjamini, Y. and Hochberg, Y.</string-name></person-group> (<year>1995</year>). <article-title>Controlling the false discovery rate: A practical and powerful approach to multiple testing</article-title>. <source>Journal of the Royal Statistical Society: Series B (Methodological)</source>, <volume>57(1)</volume>, <fpage>289-300</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1111/j.2517-6161.1995.tb02031.x">https://doi.org/10.1111/j.2517-6161.1995.tb02031.x</ext-link></mixed-citation></ref>
<ref id="ref3"><label>3</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Bucklin, R.E. and Sismeiro, C.</string-name></person-group> (<year>2009</year>). <article-title>Click here for Internet insight: Advances in clickstream data analysis in marketing</article-title>. <source>Journal of Interactive Marketing</source>, <volume>23(1)</volume>, <fpage>35-48</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.intmar.2008.10.004">https://doi.org/10.1016/j.intmar.2008.10.004</ext-link></mixed-citation></ref>
<ref id="ref4"><label>4</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Cooley, R., Mobasher, B. and Srivastava, J.</string-name></person-group> (<year>1999</year>). <article-title>Data preparation for mining World Wide Web browsing patterns</article-title>. <source>Knowledge and Information Systems</source>, <volume>1(1)</volume>, <fpage>5-32</fpage></mixed-citation></ref>
<ref id="ref5"><label>5</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Dong, G. and Li, J.</string-name></person-group> (<year>1999</year>). <article-title>Efficient mining of emerging patterns: Discovering trends and differences</article-title>. <source>Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>, <fpage>43-52</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/312129.312191">https://doi.org/10.1145/312129.312191</ext-link></mixed-citation></ref>
<ref id="ref6"><label>6</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>European Union</string-name></person-group> (<year>2016</year>). <article-title>Regulation (EU) 2016/679 of the European Parliament and of the Council of 27 April 2016 on the protection of natural persons with regard to the processing of personal data and on the free movement of such data (General Data Protection Regulation)</article-title>. <source>Official Journal of the European Union, L 119: 1-88</source></mixed-citation></ref>
<ref id="ref7"><label>7</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Fournier-Viger, P., Lin, J.C.-W., Kiran, R.U., Koh, Y.S. and Thomas, R.</string-name></person-group> (<year>2017</year>). <article-title>A survey of sequential pattern mining</article-title>. <source>Data Science and Pattern Recognition</source>, <volume>1(1)</volume>, <fpage>54-77</fpage></mixed-citation></ref>
<ref id="ref8"><label>8</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>ISO</string-name></person-group> (<year>2018</year>). <article-title>ISO 9241-11:2018 Ergonomics of human-system interaction, Part 11: Usability: Definitions and concepts</article-title>. <source>International Organization for Standardization, Geneva</source></mixed-citation></ref>
<ref id="ref9"><label>9</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Kohavi, R., Tang, D. and Xu, Y.</string-name></person-group> (<year>2020</year>). <article-title>Trustworthy Online Controlled Experiments: A Practical Guide to A/B Testing</article-title>. <source>Cambridge University Press, Cambridge</source> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1017/9781108653985">https://doi.org/10.1017/9781108653985</ext-link></mixed-citation></ref>
<ref id="ref10"><label>10</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Kukar-Kinney, M. and Close, A.G.</string-name></person-group> (<year>2010</year>). <article-title>The determinants of consumers&#x27; online shopping cart abandonment</article-title>. <source>Journal of the Academy of Marketing Science</source>, <volume>38(2)</volume>, <fpage>240-250</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s11747-009-0141-5">https://doi.org/10.1007/s11747-009-0141-5</ext-link></mixed-citation></ref>
<ref id="ref11"><label>11</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Moe, W.W.</string-name></person-group> (<year>2003</year>). <article-title>Buying, searching, or browsing: Differentiating between online shoppers using in-store navigational clickstream</article-title>. <source>Journal of Consumer Psychology</source>, <volume>13(1-2)</volume>, <fpage>29-39</fpage></mixed-citation></ref>
<ref id="ref12"><label>12</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Montgomery, A.L., Li, S., Srinivasan, K. and Liechty, J.C.</string-name></person-group> (<year>2004</year>). <article-title>Modeling online browsing and path analysis using clickstream data</article-title>. <source>Marketing Science</source>, <volume>23(4)</volume>, <fpage>579-595</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1287/mksc.1040.0073">https://doi.org/10.1287/mksc.1040.0073</ext-link></mixed-citation></ref>
<ref id="ref13"><label>13</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U. and Hsu, M.-C.</string-name></person-group> (<year>2004</year>). <article-title>Mining sequential patterns by pattern-growth: The PrefixSpan approach</article-title>. <source>IEEE Transactions on Knowledge and Data Engineering</source>, <volume>16(11)</volume>, <fpage>1424-1440</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/TKDE.2004.77">https://doi.org/10.1109/TKDE.2004.77</ext-link></mixed-citation></ref>
<ref id="ref14"><label>14</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Rabiner, L.R.</string-name></person-group> (<year>1989</year>). <article-title>A tutorial on hidden Markov models and selected applications in speech recognition</article-title>. <source>Proceedings of the IEEE</source>, <volume>77(2)</volume>, <fpage>257-286</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/5.18626">https://doi.org/10.1109/5.18626</ext-link></mixed-citation></ref>
<ref id="ref15"><label>15</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Sismeiro, C. and Bucklin, R.E.</string-name></person-group> (<year>2004</year>). <article-title>Modeling purchase behavior at an e-commerce web site: A task-completion approach</article-title>. <source>Journal of Marketing Research</source>, <volume>41(3)</volume>, <fpage>306-323</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1509/jmkr.41.3.306.35985">https://doi.org/10.1509/jmkr.41.3.306.35985</ext-link></mixed-citation></ref>
<ref id="ref16"><label>16</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Srikant, R. and Agrawal, R.</string-name></person-group> (<year>1996</year>). <article-title>Mining sequential patterns: Generalizations and performance improvements</article-title>. <source>Advances in Database Technology: EDBT 96, Lecture Notes in Computer Science</source>, <volume>1057</volume>, <fpage>1-17</fpage></mixed-citation></ref>
<ref id="ref17"><label>17</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>van der Aalst, W.M.P.</string-name></person-group> (<year>2016</year>). <article-title>Process Mining: Data Science in Action (2nd ed.)</article-title>. <source>Springer, Berlin</source> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-662-49851-4">https://doi.org/10.1007/978-3-662-49851-4</ext-link></mixed-citation></ref>
<ref id="ref18"><label>18</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Zaki, M.J.</string-name></person-group> (<year>2001</year>). <article-title>SPADE: An efficient algorithm for mining frequent sequences</article-title>. <source>Machine Learning</source>, <volume>42(1-2)</volume>, <fpage>31-60</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1023/A:1007652502315">https://doi.org/10.1023/A:1007652502315</ext-link></mixed-citation></ref>
</ref-list>
</back>
</article>