\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={A Novel Frequent Pattern Mining Algorithm for Evaluating Applicability of a Mobile Learning Framework},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{1970-01-01 (revised: 01 January 1970)}
\def\TheID{\makeatother }
\def\TheDate{1970-01-01}
\title{A Novel Frequent Pattern Mining Algorithm for Evaluating Applicability of a Mobile Learning Framework}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{D.D.M.  Dolawattha}

             \author[2]{H. K. Salinda  Premadasa}

\renewcommand\Authands{ and }

\date{\small \em Received: 1 January 1970 Accepted: 1 January 1970 Published: 1 January 1970}

\maketitle


\begin{abstract}
        


The applicability of a mobile learning system reflects how it works in an actual situation under diverse conditions. In previous studies, researches for evaluating applicability in learning systems using data mining approaches are challenging to find. The main objective of this study is to evaluate the applicability of the proposed mobile learning framework. This framework consists of seven independent variables and their influencing factors. Initially, 1000 students and teachers were allowed to use the mobile learning system developed based on the proposed mobile learning framework. The authors implemented the system using Moodle mobile learning environment and used its transaction log file for evaluation. Transactional records that were generated due to various user activities with the facilities integrated into the system were extracted. These activities were classified under eight different features, i.e., chat, forum, quiz, assignment, book, video, game, and app usage in thousand transactional rows. A novel pattern mining algorithm, namely Binary Total for Pattern Mining (BTPM), was developed using the above transactional dataset's binary incidence matrix format to test the system applicability. Similarly, Apriori frequent itemsets mining and Frequent Pattern (FP) Growth mining algorithms were applied to the same dataset to predict system applicability.

\end{abstract}


\keywords{system applicability, mobile learning, frequent pattern mining, apriori algorithm, fp growth algorithm}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\begin{textblock*}{10cm}(1.05cm,3cm)
{{\textit{CrossRef DOI of original article:}} \underline{}}
\end{textblock*}\let\tabcellsep& 	 	 		 
\section[{I. Introduction}]{I. Introduction}\par
obile learning (ML) emerged as an essential and successful learning method due to its flexibility of time and place for learning in the present globe. On the other hand, learners and teachers have an interactive and cost-effective learning environment for carrying out educational activities with cutting-edge technology advancements. However, at the same time, learners and teachers experience various limitations in this learning method, such as the quality of the learning applications. Therefore, it is vital to evaluate ML applications in various dimensions, such as their ML applicability \hyperref[b0]{[1]}. The Cambridge Oxford Dictionary defines applicability as "the fact of affecting or relating to a person or thing." Applicability definitions for domains related to computer systems are minimal. Hence we found a specific definition for the public health sector domain, and it defines applicability as "the extent to which an intervention process could be implemented in another" \hyperref[b1]{[2]}. On the other hand, transferability gives a meaning similar to applicability. It defines transferability as "the extent to which the measured effectiveness of an applicable intervention could be achieved in another setting". \hyperref[b2]{Rosemann and Vessey (2008)} proposed the significance and capability to check the applicability of a research framework with three factors, i.e., importance, accessibility, and suitability \hyperref[b2]{[3]}. Accordingly, we can recognize an applicable mobile learning system (MLS) as "the extent to which a MLS could be implemented effectively in a target environment as well as in another environment with a similar setting". This study's main objective is to evaluate the applicability of the proposed mobile learning framework (MLF). This framework consists of seven independent variables, and each variable has different influencing factors. Evaluating this MLF for applicability would help realize the proposed framework's applicability when it works in a real-world environment. Normally, pattern mining algorithms are used to describe patterns in usage behaviors \hyperref[b3]{[4]}. Hence, we use pattern mining to study users' usage of different learning tools in the system, such as chat, forum, quizzes, assignments, etc. Proper understanding of these usages would help calculate how many users apply these tools in their academic activities in the proposed system. Considering each tool's usage would support predicting the system's overall applicability (Fig. \hyperref[fig_2]{3}: motivating example). Because if a learning system has better applicability, its users should fully practice the tools integrated into it. In this study, the authors intend to analyze the transactional log of the MLS, developed using the proposed MLF for evaluating applicability. According to the previous studies, the FP-Growth \hyperref[b4]{[5]} efficient pattern mining and Apriori \hyperref[b5]{[6]} popular association rule mining algorithms have been utilized to evaluate many automated systems. FP-Growth algorithm was used to evaluate systems to identify important segments in learning materials \hyperref[b6]{[7]}, learning behaviors \hyperref[b7]{[8]}, best course modules \hyperref[b8]{[9]}, learners requirements \hyperref[b9]{[10]}, offensive activities, and illegal transactions \hyperref[b10]{[11]}. In these studies, the FP-Growth algorithm helps to improve the learning process, course selection \hyperref[b8]{[9]}, course recommendation \hyperref[b9]{[10]}, security enhancement, and legal judgments \hyperref[b10]{[11]} in learning systems and portals. On the other hand, the Apriori algorithm was used to evaluate systems to identify, information for decision making \hyperref[b11]{[12]}, tourists attractive places \hyperref[b12]{[13]}, course administration history \hyperref[b8]{[9]}, study preferences, archived cyber-attacks, and network hackings \hyperref[b13]{[14]}, requirements in software \hyperref[b14]{[15]}, health clinical information in clinical \hyperref[b15]{[16]}, and deformation states of landslides \hyperref[b16]{[17]}. In these studies, the Apriori algorithm help in different activities such as better administrative decisions \hyperref[b11]{[12]}, improving tourist attraction \hyperref[b12]{[13]}, enhancing course facilities, offering productive subjects \hyperref[b8]{[9]}, preventing networks attacks \hyperref[b13]{[14]}, recommend software requirements \hyperref[b14]{[15]}, enhanced health decision and treatments \hyperref[b15]{[16]}, and predict landslides accurately \hyperref[b16]{[17]}. But it is a very shortage of using FP Growth or Apriori algorithms in the evaluation applicability of learning systems. Also, difficult to find such applicability evaluation using any statistical approach too in previous studies. Moreover, these two well-established algorithms have no direct provisions for evaluating the applicability of the system. Nevertheless, using the rules and frequent patterns generated by Apriori and FP Growth algorithms can predict applicability. In this study, the authors proposed a novel frequent pattern mining algorithm for applicability evaluation directly in the proposed learning system to address this research gap. Also, FP Growth and Apriori algorithm are used to predict the applicability of the same system. 
\section[{II. Related Work}]{II. Related Work}\par
Pattern mining is a popular data mining tactic to emerge secret knowledge in data stores, and it is applied for solving issues arising in various scenarios. A Pattern mining approach was proposed to identify the most critical or complex learning segments in video tutorials. The proposed method integrates a learning model that learns the above-considered components of the analysed video transaction log. \hyperref[b6]{[7]}. A pattern mining framework was proposed to identify learners' different learning behaviors and improve their learning process with the institutional learning system. This study's output reveals that the learners obtained significant study performance in different learning modes via various tools integrated into the system \hyperref[b7]{[8]}. Another pattern mining framework was proposed to analyse huge databases by addressing existing pattern mining algorithms such as a large number of searching iterations, excessive space for processing, and too much time requirements. Results reveal that this approach can solve different kinds of pattern mining problems \hyperref[b17]{[18]}. An online course recommender system was proposed using the FP-Growth algorithm to guide learners to select learning courses according to their preferences. The investigation displays that the system has better efficiency in instructing learners for selecting appropriate learning materials in their learning process \hyperref[b8]{[9]}. FP-Growth-based data mining technique was used to promote educational services in educational institutes. Various variables related to learners and educational institutes were employed on FP-Tree to determine regular data items. Research reveals that the best selection of attributes in the data for the algorithm gives better results \hyperref[b18]{[19]}. FP-Growth algorithm was used to elaborate users' access patterns in learning portals. The study revealed, such as learners' favorite courses, less and high navigation areas of the learning site, and recommendations for advancing both learner's gain and user-friendliness of the site \hyperref[b9]{[10]}. \hyperref[b10]{Wu and Zhang (2019)} researched to extract support information to prove offensive actions. An improved FP-Growth algorithm analysed data associated with illegal transactions and supported legal judgment with better efficiency and accuracy \hyperref[b10]{[11]}.\par
Another method for hidden information recovery from large databases is associate rule mining, and its applications are spread in various researches in the past. The E-learning system was evaluated by combining the association rule mining method and the fuzzy analytic hierarchy process \hyperref[b19]{[20]}. Apriori algorithmbased association rule mining was used to analyse the Wi-Fi data in attractive tourist places. The study results give the association rules of travel patterns of tourists' movements and enable further enhancements of tourist's magnetism of travel destinations \hyperref[b12]{[13]}. Learner assisting study guides approval mechanism was proposed using association rule mining with archived course administration data. This approach queries useful relationships in learners' learning subject preferences \hyperref[b8]{[9]}. An improved Apriori algorithm is offered to find fresh network attacks using the data that was produced by previous episodes. This method has optimal accuracy with superior efficiency for discovering cyber strikes \hyperref[b13]{[14]}. A customized Apriori algorithm was used to improve the audit system's security building association rules using fewer scanning cycles in logs with shorter processing time \hyperref[b20]{[21]}. Apriori algorithmbased recommender system was proposed to enhance the accuracy of requirements in software development \hyperref[b14]{[15]}. Apriori algorithm was coustomized to excavate intelligence information from virtual reality applications for effective decision making \hyperref[b21]{[22]}. Apriori algorithm was executed successfully in analyzing the deformation states of landslides \hyperref[b16]{[17]}. A heart disease prediction model was proposed by applying the Apriori algorithm in clinical datasets \hyperref[b22]{[23]}. Here, we used the Apriori associate rule mining and FP-Growth frequent pattern mining algorithm-based approaches as comparable methods to the novel proposed pattern mining algorithm for evaluation applicability of the proposed MLS. 
\section[{III. Preliminaries}]{III. Preliminaries}\par
In this section, the authors discuss the proposed MLF and its implemented MLS, which will be evaluated for applicability. Also, the critical theories undergo related to the proposed solution for evaluating the system's applicability, such as associate rule mining, Apriori, and FP-Growth algorithms. 
\section[{a) Mobile Learning Framework for Higher Education}]{a) Mobile Learning Framework for Higher Education}\par
We can refer to many frameworks that were implemented in the Moodle environment successfully in previous studies. \hyperref[b23]{Halvoník and Kapusta (2020)} implemented an e-Learning material composing framework through Moodle LMS with the teachers' highest inclination \hyperref[b23]{[24]}. A framework for evaluating student learning was performed through the Moodle platform to create useful tests for learners \hyperref[b24]{[25]}. \hyperref[b25]{Karagiannis and Satratzemi (2017)} proposed a Moodle implemented framework for e-learning content adaptation according to learner wishes and better usability with decent learning outcomes \hyperref[b25]{[26]}. Hence, according to the literature, several conceptual frameworks have been implemented via the Moodle mobile learning environment (MMLE). So in our study, we implemented the proposed conceptual MLFrame through the MMLE.\par
In this study, we require to measure the applicability of the MLS implemented based on the proposed MLF for higher education (MLFrame). This framework consists of seven independent variables: learner, teacher, mobile ML devices, ML tools, ML contents, higher education institutes, and communication technology (Fig.  {\ref 1}). Each independent variable has several influencing factors: motivation, usefulness, interactivity, ease of use, etc. These factors were realized through various resources and facilities embedded in the MLS such as chat, forum, games, quizzes, assignments, etc. \hyperref[b26]{[27]}, \hyperref[b27]{[28]}. This MLFrame was implemented in the MMLE by integrating new facilities and modifying the existing Moodle mobile application. Therefore, existing Moodle plugins were enhanced to develop these new ML facilities for the Moodle mobile environment \hyperref[b27]{[28]}. Because most of the facilities available in the Moodle learning environment are not implemented in the Moodle mobile environment. Hence, when implementing the MLFrame in the Moodle mobile environment, we customized the Moodle ML application by upgrading relevant plugins to serve the facilities introduced in the MLFrame.  \hyperref[fig_2]{3} depicts the concept associated with predicting the system applicability. Consider a MLS with facilities chatting, forum, quiz, assignment, book, video, game, and app\textunderscore usage. If this app was allowed to use 100 particular users, then assume transaction log analysis as follows. 8,7,6,5 features out of all 8 features used by 60,10,15,5 users, respectively. Therefore, 70 users out of 100 users used at least 7 features out of all 8 features (or 88\% features). Hence system applicability was 70\% for 88\% feature usage. Further, 85 users out of 100 users used at least 6 features out of 8 features (or 75\% features). Hence system applicability is 85\% for 75\% features usage. Similarly, it can be realized that the system applicability is 90\% for 63\% features usage. 
\section[{Fig. 3: Example for Predicting Applicability using Pattern Mining Algorithm c) Associate Rule Mining}]{Fig. 3: Example for Predicting Applicability using Pattern Mining Algorithm c) Associate Rule Mining}\par
Association rule mining is used to find essential associations among stored data in large databases. 'Antecedent' and 'Consequent' are significant two fractions in association rules. These are data items finding in databases, and 'Antecedent' combines with the 'Consequent'. Moreover, finding frequent itemsets is a crucial requirement to mine association rules from databases. Additionally, two important factors, such as support and confidence, must be defined when finding association rules using these frequent itemsets \hyperref[b28]{[29]}. 
\section[{d) Apriori Algorithm}]{d) Apriori Algorithm}\par
Apriori is a Latin term which denotes "from what comes before". Bottom-up and breadth-first search strategies are taken into account. Agarwal and Srikant (1994) developed the Apriori algorithm for generating associate rules by frequent pattern mining. The main terminologies used in the Apriori algorithm are Min\textunderscore supp, Min\textunderscore conf, Frequent itemsets, Apriori Property, Join Operation, Join Step, and Prune Step \hyperref[b29]{[30]}. 
\section[{e) Frequent Pattern (FP) Growth Algorithm}]{e) Frequent Pattern (FP) Growth Algorithm}\par
FP-Growth is a widespread pattern mining algorithm used in data mining. In this algorithm, frequent patterns are stored in a tree-like data structure called FP-tree. The algorithm's main steps are calculating each database item's support count by scanning, deleting irregular patterns, and order remains. Then FP-tree is constructed and frequent patterns are generated using FP-tree \hyperref[b4]{[5]}. This improves the frequent pattern mining technique because it scans the database only twice. There is no candidate set generation, though it is not suitable for mining patterns in databases that are updated frequently \hyperref[b30]{[31]}.\par
© 2023 Global Journals  
\section[{a) Process of the Proposed Algorithm}]{a) Process of the Proposed Algorithm}\par
The processing steps of the proposed algorithm implementation are described below.\par
Procedure 1: Purpose is generating a features list (extracting unique features, used in this evaluation, stored in the transaction log of the system)\par
Step 01 \& 09: For loop iterates from 1 st row to last row of the transactional database.\par
Step 02 \& 08: For loop iterates from 1 st item to the last item of a transactional database row.\par
Step 03 \& 07: For loop iterates from 1 st item to the last item of the array call Array Features. Array Features is an array that contains unique features of the transactional database.\par
Step 04: Check whether each item does not exist in the array Array Features (f m ).\par
Step 05: If the new item is not in the array, the item is saved in Array Features as the last item (f s+1 Step 14: Check each item in the transaction database (a ij ) with feature items in Array Features (f m )\par
Step 15: If a similar item is found, replace the value in the Array Dataset BIMF with 1. The position of the item (i.e. d im ) substituting in the Array Dataset BIMF is found by taking the associate item's row number of the transactional database (i th row ) and column number of the Array Features (m th column).\par
Likewise, replace 0 with 1 in Array Dataset BIMF to denote similar features in the same column in Array Dataset BIMF for all items in the transactional database. The second last element (n+1) of each row of the array is the Total Decimal Value of binary digit positions in entire Transactions (tdvt i ).tdvt i =? ?? ???? ??-1 ?? =0\par
2 ?? ; where d ij is the digit value of j th position in i th transaction i.e., d ij =\{0,1\}\par
The last element (n+2) of each row of the array is the Count of the Non-zero Binary digits in each transaction row (cnb i ).cnb i = ? ?? ???? ??-1 ?? =0\par
; where d ij is the digit value of j th position in i th transaction i.e., d ij =\{0,1\}\par
Step 26: At the end of each row, check whether the percentage of features used in a transaction is greater than or equal to minFUT. The minFUT is the given threshold value for the percentage of minimum features usage in a transaction. For instance, if minFUT = 70\% for a 10 features transaction means, at least 7 features are used out of 10 features by a user.\par
(If j = n and cnb i (100/n) >= minFUT then)\par
If the above condition is satisfied, then save the transaction pattern to another array (i.e., ArrayPatterns).\par
In each row of ArrayPatterns[tdvt k , pattern Count k ], tdvt k denotes total decimal values of binary digit positions in entire transactions. Feature usage transaction patterns can be derived by taking the binary conversion of the tdvt i . And patternCount k gives the count of the number of occurrences of the pattern.\par
Step 27: For loop iterates from 1 st row to last row of the ArrayPatterns[] Step 39: Percentage of each distinct usage transaction pattern can be calculated by using the equation, Percentage of k th pattern = (patternCount k /t) * 100\par
Step 41: Finally, the overall percentage of transactions whose FUT is greater than or equal to minFUT can becalculated by taking the percentage of summation of the element ArrayPatterns[patternCount k ]. i.e.  \hyperref[b21]{(22)} For j = 1 to s+2 (s = no of columns in ArrayDatasetBIMF[]) \hyperref[b22]{(23)} insert item d ij to ArrayTDVT[] on the position i th row and j th column (24) Next j \hyperref[b24]{(25)} Insert tdvt i =? ?? ???? ð??"ð??" ??=?? ?? (??-??) , cnb i = ? ?? ???? ð??"ð??" ??=??\par
to ArrayTDVT as columns s+1 and s+2 in the i th row \hyperref[b25]{(26)} If j = s and cnb i *(100/s) >= minFUT then \hyperref[b26]{(27)} For k = 1 to no of rows in ArrayPatterns \hyperref[b27]{(28)} Read  
\section[{b) Algorithm Implementation with a Sample}]{b) Algorithm Implementation with a Sample}\par
Fig. \hyperref[fig_4]{4} depicts the generation of the required dataset by implementing the proposed algorithm to evaluate the applicability of MLFrame. In this example, five features were considered for the transaction database. Moodle tools usage and users tables of the log database of the system were used to create the transaction dataset.\par
Step 01: 'Transaction' table is created by copying user ids from the main user table and updating each user id from the tools usage log table in the database of the MLS.\par
Step 02: 'ArrayFeatures' table is created by inserting distinct features in the 'Transaction' table. As we use only 5 features, this ArrayFeature table consists of a row with five values.\par
Step 03: 'ArrayDatasetBIMF' consists 5 rows (transactions of 5 users) and 6 columns (the first column is for TID-transaction ids and the rest of the rows for features). The array consists of user ids and 5 tools (features) same order with the 'ArrayFeatures' in a particular row.\par
Step 04: The table 'ArrayTDVT' is created by adding two columns at the end to the 'ArrayDatasetBIMF'. New columns are 'TDVT,' and 'CNB' represents the decimal value of the binary values in the same row and the count of non-zero binary digits in the same column, respectively.\par
Step 05: Different feature usage patterns with frequency are stored in the array called 'ArrayPatterns'. Unique feature usage patterns are selected by satisfying the condition, each pattern's minimum number of features are greater than or equal to the minimum feature usage percentage (minFUT) supplied. Existing Pattern Mining Algorithms Popular algorithms for pattern mining such as Apriori and FP-Growth generate itemsets or candidate itemsets to find frequent itemsets. These itemsets are a group of transactional items that reside in the transaction database. Then, they use a minimum threshold value to minimize or prune itemsets to reduce data considered in mining. On the contrary, the BTPM algorithm uses an entirely mathematical technique, i.e., binary incidence matrix format of the transactional database with mathematical calculations. This reason minimizes memory usage and time for searching or traversals. Furthermore, in this method, the minimum  
\section[{V. Methodology}]{V. Methodology}\par
The proposed MLS was given to precisely 1000 users, who are learners and teachers in the University of Kelaniya's four faculties. Among them, 220 students from each faculty of Science and Commerce \& Management, and 200 students from each Faculties of Social Sciences and Humanities. Also, 160 teachers participated, and they consisted of 40 teachers in each faculty mentioned above. They were asked to use the system for around 50 days. This study was conducted according to the research framework illustrated in Fig. \hyperref[fig_6]{5}. The standard log file was extracted, and approximately half a million records were identified as different transactions related to the above user group on the given spell. Transactions were categorized into eight transactions with facilities integrated into the proposed ML application, i.e., chat, forum, quiz, assignment, book, video, game, and app\textunderscore usage. The app\textunderscore usage represents general user activities associated with the mobile application, such as page viewing, information modifying and deleting, etc. These activities were classified according to each user (Table \hyperref[tab_4]{4}). Finally, the transaction dataset was generated using the above eight features for all 1000 users. This dataset completed preprocessing steps to be perfect for applying algorithms such as filling in missing data and removing unusual data. This dataset consists of 1000 records, and each record represents different transactions done using the proposed ML app.\par
The proposed data mining-based novel frequently pattern mining algorithm was primarily implemented using Python programming language to describe the proposed MLS's applicability (Table \hyperref[tab_1]{1}: BTPM Algorithm), and it was applied to the dataset. This algorithm caters to finding patterns of feature usage in transactions and calculating percentages of each different transaction pattern. For instance, what is the percentage of different patterns including all the features considered above (i.e., chat, forum, quiz, assignment, book, video, game, and app\textunderscore usage), or what are the percentages of different patterns including seven features out of the eight features considered above? Then overall applicability of the system can be predicted by considering these transaction patterns and taking the summation of their percentage values. Next, the Apriori algorithm for associate rule mining and the FP-Growth algorithm for frequent pattern mining were applied on the same dataset and generated the best possible rules which can describe the overall systems' applicability.\par
Finally, the proposed BTPM algorithm's performance was compared with Apriori and FP-Growth algorithms. For that, a data set with 15000 records were used. The dataset was created by using the original data set multiple times with changing the order of records randomly. Each algorithm's execution times were recorded by changing number of execution records (i.e. 2500, 5000, 7500, 10000, 12500, 15000) and percentage of minimum feature usage (supports) (20\%, 40\%, 60\%, 80\%).  
\section[{C}]{C}\par
Various activities in the MLS are used as eight features in the transaction dataset. Feature descriptions are mentioned in Table \hyperref[tab_3]{2}.  
\section[{VI. Results and Discussions a) Dataset}]{VI. Results and Discussions a) Dataset}\par
In this study, we use a data set including 1000 transactional rows of 1000 users. Each transaction row consists of 8 features denoting activity usage in the MLS. The second subprocedure in the proposed algorithm converts the transactional dataset to the BIMF dataset, and part of the BIMF dataset is shown below (Table  {\ref 3}).  
\section[{C}]{C}\par
The proposed algorithm gives 16 different patterns of features used in transaction rows. We considered 75\% as the minimum threshold value for minimum feature usage in a transaction (6 features out of 8 features) (Table \hyperref[tab_4]{4}). Thus, we ask the proposed algorithm to give different patterns in the dataset, consisting of at least six features out of the eight total features in a single transaction. Results reveal that 43\%, 24\%, 15\% of transactions have used 8, 7,and 6 features consecutively. Therefore 82\% of transactions have used at least six features(75\% of features). Hence, we can predict that the system's applicability is 82\% when the minimum threshold feature usage in a transaction is 75\%. Year 2023 The authors use values 40\%, 40\%, and 1.0 for Apriori parameters, i.e., support, confidence, and lift, respectively to build the Apriori model Using these parameters 267 rules were generated. We chose these values to get 8-itemset combinations. Therefore, according to the 15th rule mentioned in table 05, support, confidence, and lift of 8-itemset are matched with the above minimum parameter values. Otherwise, we were unable to obtain 8-itemset combinations. Fifteen specific rules were selected whose antecedent is the app\textunderscore used feature. Since all the users use the app\textunderscore used feature, the support of the app\textunderscore used feature is 100\%. Therefore, we can assume that the maximum feature usage in transactions comes for an itemset whose antecedent is App\textunderscore usage. According to the Apriori algorithm results (Table \hyperref[tab_5]{5}), rule 15 reveals that its confidence is 43. Rule 15 denotes that 43\% of users use the app with seven other features. This indicates that 43\% of users used all the considered features in the proposed system. Hence, both the proposed novel algorithm and the Apriori algorithm gave the same output percentage value for eight feature usage in transactions. Similarly, according to the confidence value of rule 14 and rule 13, we can assume that the maximum percentage for the usage of 7 features in transactions is 51\%, and the maximum percentage for six features usage in transactions is 61\%. Finally, using the Apriori algorithm results, we can assume that the proposed system's overall applicability should be greater than 61\% when at least 6 features are used in a transaction. 
\section[{d) Results of the FP-Growth algorithm}]{d) Results of the FP-Growth algorithm}\par
FP-Growth algorithm gives the following patterns as frequent patterns for the above dataset with 40\% as both minimum threshold values for support and confidence parameters. These results denote that 40\% of users use at least seven features among the eight features. Also, 60\% of users use at least six features among the eight features. These results secure the 75\% usage of the features by 60\% of users. Therefore, we can assume that the applicability of the system is not less than 60\% when minimum feature usage in a transaction is equal to 75\% for the FP-Growth algorithm. 
\section[{e) Evaluating the Algorithm}]{e) Evaluating the Algorithm}\par
The performance of the proposed algorithm for pattern mining was compared with Apriori and FP-Growth algorithms. The results clearly show the better efficiency of the proposed algorithm. According to the graphs in Fig. 6, the proposed algorithm (BTPM) takes less execution time than the Apriori and FP-Growth algorithm for different support thresholds in each size of transactions.   Reasons for these performances in the proposed algorithm are, it scans the database only once to develop an array of features. Also, the BIMF dataset and mathematical process have quicker processing power in the proposed algorithm. On the contrary, other algorithms considered in this study use techniques to mine frequent patterns such as scans database iteratively, creating candidate itemsets, and a frequent pattern tree. However, if our proposed algorithm uses the BIMF dataset directly, these execution times reduce further. 
\section[{Global}]{Global} 
\section[{f) Time complexity of the proposed algorithm}]{f) Time complexity of the proposed algorithm}\par
The time complexity of an algorithm is the time estimation to execute the programming code inside the algorithm. It depends on the building blocks or control structures used in the algorithm, such as sequence, selections, and iterations. Further, the situation differs when the input is increasing.  According to table 8, the total time complexity is equal to the summation of time complexity of procedure 1, procedure 2, procedure 3, and procedure 4. It is close to O(N 2 ).\par
Therefore the time complexity of the proposed BTPM algorithm is realized approximately as O(N 2 ). According to the previous studies, the Apriori algorithm's time complexity was calculated as O(N 2 ) for a larger dataset \hyperref[b32]{[33]}. But Tahyudin and colleagues (2019) show the time complexity of the Apriori algorithm as O(2 N ) \hyperref[b33]{[34]}. Also, the FP-Growth algorithm's time complexity is O(N log N) for higher data volumes, while in lower datasets, it shows O(N) better performance \hyperref[b34]{[35]}. According to Fig. 7, the proposed BTPM algorithm's time complexity has similar or a little better to the Apriori algorithm for more extensive data volumes. The purpose of creating the BTPM algorithm is to evaluate the proposed algorithm for applicability. BTPM algorithm provides the applicability of the MLS directly. But when Apriori and FP Growth algorithms are used to evaluate applicability, it requires certain assumptions, as mentioned in 6.3 and 6.4. 
\section[{VII. Conclusion and Implication}]{VII. Conclusion and Implication}\par
This study's primary purpose is to check whether the proposed MLF for higher education is applicable for higher education learners and teachers. The framework was implemented via a modified MMLE. This study was carried out using generated MySQL standard system log files integrated with a Moodle learning management system. In this study, the authors \begin{figure}[htbp]
\noindent\textbf{12}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Fig. 1 :Fig. 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{42023}\includegraphics[]{image-3.png}
\caption{\label{fig_1}4 2023 A}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Procedure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{28438}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Step 28 :Procedure 4 :Step 38 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Fig. 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{82023}\includegraphics[]{image-7.png}
\caption{\label{fig_5}© 2023 Global Journals 8 2023 A}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Fig. 5 :}\end{figure}
      \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.7632653061224489\textwidth}P{0.08673469387755102\textwidth}}
Array Features consists of an array of distinct features in\tabcellsep \\
the transactional database.\tabcellsep \\
Procedure 2: Step 10: Creating an array calls Array Data Set BIMF[]\tabcellsep \\
for saving the transactional database in binary incidence\tabcellsep \\
format array size is:\tabcellsep \\
t x s; t means the number of transactions in the\tabcellsep \\
transactional database;s means the number of features\tabcellsep \\
in the array Features[]. Assign 0 for all the array\tabcellsep \\
elements.\tabcellsep \\
Step 11 \& 19: For loop iterates from 1 st row to last row of\tabcellsep \\
the transactional database\tabcellsep \\
Step 12 \& 18: For loop iterates from 1 st item to the last\tabcellsep \\
item of a transactional row\tabcellsep \\
Step 13 \& 17: For loop iterates from 1st item to the last item of the array called Array Features[]. (Note: Array Features[] contains distinct features of the transactional database)\tabcellsep Volume XXIII Issue II Version I\\
\tabcellsep ( ) C\\
\tabcellsep Global Journal of Computer Science and Technology\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.765702479338843\textwidth}P{0.021074380165289255\textwidth}P{0.02809917355371901\textwidth}P{0.03512396694214876\textwidth}}
?? ??=1\tabcellsep ? ×\tabcellsep 1 ??\tabcellsep × 100\\
\multicolumn{4}{l}{Where L = No. of patterns = Number of rows in the}\\
\multicolumn{4}{l}{ArrayPatterns, t = no. of transactions in the dataset}\end{longtable} \par
 
\caption{\label{tab_1}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.11886973180076627\textwidth}P{0.16446360153256703\textwidth}P{0.5666666666666667\textwidth}}
Feature\tabcellsep Type\tabcellsep Description\\
ID No.\tabcellsep Identification\tabcellsep Student identification number\\
Chat\tabcellsep Activity\tabcellsep Chat facility for discussions\\
Forum\tabcellsep Activity\tabcellsep Forum facility for knowledge sharing\\
Quiz\tabcellsep Activity\tabcellsep Quiz facility to test learners' knowledge\\
Assignment\tabcellsep Activity\tabcellsep Assignment for extra academic tasks\\
Book\tabcellsep Activity\tabcellsep Book-facility for further reading\\
Video\tabcellsep Activity\tabcellsep Video facility for academic activities\\
Game\tabcellsep Activity\tabcellsep Game facility for academic activities\\
App\textunderscore usage\tabcellsep Activities (View/Modify/..)\tabcellsep General activities in the mobile app such as view, modify..\end{longtable} \par
 
\caption{\label{tab_3}Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4} \par 
\begin{longtable}{P{0.02108355091383812\textwidth}P{0.10985639686684073\textwidth}P{0.11873368146214099\textwidth}P{0.3950391644908616\textwidth}P{0.008877284595300261\textwidth}P{0.035509138381201046\textwidth}P{0.0022193211488250653\textwidth}P{0.0022193211488250653\textwidth}P{0.036618798955613575\textwidth}P{0.04327676240208877\textwidth}P{0.0410574412532637\textwidth}P{0.035509138381201046\textwidth}}
PNo\tabcellsep F1\tabcellsep F2\tabcellsep \multicolumn{2}{l}{Features (F 1 to 8 ) F3 F4 F5}\tabcellsep F6\tabcellsep F7\tabcellsep F8\tabcellsep No. of Features used\tabcellsep Each rule percentage (\%)\tabcellsep Each rule group percentage (\%)\tabcellsep FUT Percentage (\%)\\
1\tabcellsep App used\tabcellsep Assign ment\tabcellsep \multicolumn{5}{l}{Book Chat Forum Quiz Video Game}\tabcellsep 8\tabcellsep 43\tabcellsep 43\\
2\tabcellsep App used\tabcellsep Assign ment\tabcellsep \multicolumn{5}{l}{Book Chat Forum Quiz Video Null}\tabcellsep 7\tabcellsep 2\tabcellsep \\
3 4\tabcellsep App used App used\tabcellsep Assign ment Assign ment\tabcellsep \multicolumn{5}{l}{Book Chat Forum Quiz Null Game Book Chat Forum Null Video Game}\tabcellsep 7 7\tabcellsep 1 6\tabcellsep \tabcellsep Year 2023\\
5\tabcellsep App used\tabcellsep Assign ment\tabcellsep Book Chat\tabcellsep Null\tabcellsep \multicolumn{3}{l}{Quiz Video Game}\tabcellsep 7\tabcellsep 2\tabcellsep 24\tabcellsep 11\\
6\tabcellsep App used\tabcellsep Assign ment\tabcellsep \multicolumn{5}{l}{Book Null Forum Quiz Video Game}\tabcellsep 7\tabcellsep 2\tabcellsep \tabcellsep 82\\
7\tabcellsep App used\tabcellsep Assign ment\tabcellsep \multicolumn{5}{l}{Null Chat Forum Quiz Video Game}\tabcellsep 7\tabcellsep 3\tabcellsep \\
8\tabcellsep App used\tabcellsep Null\tabcellsep \multicolumn{5}{l}{Book Chat Forum Quiz Video Game}\tabcellsep 7\tabcellsep 8\tabcellsep \\
9\tabcellsep App used\tabcellsep Null\tabcellsep \multicolumn{5}{l}{Book Chat Forum Null Video Game}\tabcellsep 6\tabcellsep 4\tabcellsep \\
10\tabcellsep App used\tabcellsep Null\tabcellsep \multicolumn{5}{l}{Book Chat Forum Quiz Null Game}\tabcellsep 6\tabcellsep 1\tabcellsep 15\\
11\tabcellsep App used\tabcellsep Null\tabcellsep \multicolumn{5}{l}{Null Chat Forum Quiz Video Game}\tabcellsep 6\tabcellsep 3\tabcellsep \\
12\tabcellsep App used\tabcellsep Assign ment\tabcellsep Null Chat\tabcellsep Null\tabcellsep \multicolumn{3}{l}{Quiz Video Game}\tabcellsep 6\tabcellsep 1\tabcellsep \end{longtable} \par
 
\caption{\label{tab_4}Table 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5} \par 
\begin{longtable}{P{0.06741379310344828\textwidth}P{0.2696551724137931\textwidth}P{0.09672413793103449\textwidth}P{0.05862068965517241\textwidth}P{0.06741379310344828\textwidth}P{0.29017241379310343\textwidth}}
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep Volume XXIII Issue II Version I\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep ( )\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep Global Journal of Computer Science and Technology\\
\multicolumn{2}{l}{Rule No. Antecedent}\tabcellsep Consequent\tabcellsep Support (\%)\tabcellsep Confidence (\%)\tabcellsep Lift\\
1\tabcellsep App\textunderscore used\tabcellsep Assignment\tabcellsep 71\tabcellsep 71\tabcellsep 1.0\\
2\tabcellsep App\textunderscore used\tabcellsep Quiz\tabcellsep 72\tabcellsep 72\tabcellsep 1.0\\
3\tabcellsep App\textunderscore used\tabcellsep Forum\tabcellsep 92\tabcellsep 92\tabcellsep 1.0\\
4\tabcellsep App\textunderscore used\tabcellsep Game\tabcellsep 85\tabcellsep 85\tabcellsep 1.0\end{longtable} \par
 
\caption{\label{tab_5}Table 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.024616695059625215\textwidth}P{0.36635434412265755\textwidth}P{0.3475298126064736\textwidth}P{0.03185689948892675\textwidth}P{0.03185689948892675\textwidth}P{0.04778534923339012\textwidth}}
5\tabcellsep App\textunderscore used\tabcellsep Book, Forum\tabcellsep 73\tabcellsep 73\tabcellsep 1.0\\
6\tabcellsep App\textunderscore used\tabcellsep Game, Chat\tabcellsep 82\tabcellsep 82\tabcellsep 1.0\\
7\tabcellsep App\textunderscore used\tabcellsep Chat, Video\tabcellsep 82\tabcellsep 82\tabcellsep 1.0\\
8\tabcellsep App\textunderscore used\tabcellsep Forum, Chat, Video\tabcellsep 79\tabcellsep 79\tabcellsep 1.0\\
9\tabcellsep App\textunderscore used\tabcellsep Game, Chat, Video\tabcellsep 74\tabcellsep 74\tabcellsep 1.0\\
10\tabcellsep App\textunderscore used\tabcellsep Game, Chat, Forum\tabcellsep 76\tabcellsep 76\tabcellsep 1.0\\
11\tabcellsep App\textunderscore used\tabcellsep Game, Forum, Video\tabcellsep 73\tabcellsep 73\tabcellsep 1.0\\
12\tabcellsep App\textunderscore used\tabcellsep Video, Game, Chat, Forum\tabcellsep 71\tabcellsep 71\tabcellsep 1.0\\
13\tabcellsep App\textunderscore used\tabcellsep Video, Game, Book, Chat, Forum\tabcellsep 61\tabcellsep 61\tabcellsep 1.0\\
14\tabcellsep App\textunderscore used\tabcellsep Video, Game, Forum, Quiz, Chat, Book\tabcellsep 51\tabcellsep 51\tabcellsep 1.0\\
15\tabcellsep App\textunderscore used\tabcellsep Game, Assignment, Book, Forum, Chat, Quiz, Video\tabcellsep 43\tabcellsep 43\tabcellsep 1.0\end{longtable} \par
 
\caption{\label{tab_6}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6} \par 
\begin{longtable}{P{0.5632113821138212\textwidth}P{0.09674796747967479\textwidth}P{0.10711382113821137\textwidth}P{0.08292682926829269\textwidth}}
Pattern description\tabcellsep Min. support\tabcellsep Min. confidence\tabcellsep Number of patterns\\
7-itemset (7 feature items patterns)\tabcellsep 40\%\tabcellsep 40\%\tabcellsep 8\\
6-itemset (6 feature items patterns)\tabcellsep 40\%\tabcellsep 40\%\tabcellsep 28\\
6-itemset (6 feature items patterns)\tabcellsep 50\%\tabcellsep 40\%\tabcellsep 28\\
6-itemset (6 feature items patterns)\tabcellsep 60\%\tabcellsep 40\%\tabcellsep 8\end{longtable} \par
 
\caption{\label{tab_7}Table 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7} \par 
\begin{longtable}{P{0.08723684210526315\textwidth}P{0.12973684210526315\textwidth}P{0.017894736842105262\textwidth}P{0.049210526315789475\textwidth}P{0.085\textwidth}P{0.07381578947368421\textwidth}P{0.04026315789473684\textwidth}P{0.10960526315789475\textwidth}P{0.04697368421052631\textwidth}P{0.04026315789473684\textwidth}P{0.07157894736842105\textwidth}P{0.06039473684210526\textwidth}P{0.038026315789473686\textwidth}}
Exec.\tabcellsep \multicolumn{3}{l}{20\% Support}\tabcellsep \multicolumn{3}{l}{40\% Support}\tabcellsep \multicolumn{3}{l}{60\% Support}\tabcellsep \multicolumn{3}{l}{80\% Support}\\
Records\tabcellsep Apri\tabcellsep FP\tabcellsep BTPM\tabcellsep Apri\tabcellsep \multicolumn{3}{l}{FP BTPM Apri}\tabcellsep \multicolumn{3}{l}{FP BTPM Apri}\tabcellsep \multicolumn{2}{l}{FP BTPM}\\
2500\tabcellsep 387\tabcellsep 195\tabcellsep 161\tabcellsep 141\tabcellsep 121\tabcellsep 110\tabcellsep 118\tabcellsep 113\tabcellsep 101\tabcellsep 117\tabcellsep 103\tabcellsep 92\\
5000\tabcellsep 961\tabcellsep 202\tabcellsep 189\tabcellsep 617\tabcellsep 176\tabcellsep 171\tabcellsep 450\tabcellsep 161\tabcellsep 155\tabcellsep 345\tabcellsep 148\tabcellsep 137\\
7500\tabcellsep \multicolumn{2}{l}{1969 1255}\tabcellsep 349\tabcellsep 1417\tabcellsep 899\tabcellsep 320\tabcellsep 1117\tabcellsep 750\tabcellsep 305\tabcellsep 917\tabcellsep 559\tabcellsep 291\\
10000\tabcellsep \multicolumn{2}{l}{2946 1846}\tabcellsep 431\tabcellsep 2014\tabcellsep 1532\tabcellsep 420\tabcellsep \multicolumn{2}{l}{1403 1316}\tabcellsep 413\tabcellsep 994\tabcellsep 869\tabcellsep 407\\
12500\tabcellsep \multicolumn{2}{l}{3255 1850}\tabcellsep 454\tabcellsep 2314\tabcellsep 1714\tabcellsep 445\tabcellsep \multicolumn{2}{l}{1706 1505}\tabcellsep 431\tabcellsep 1393\tabcellsep 1110\tabcellsep 410\\
15000\tabcellsep \multicolumn{2}{l}{3779 2107}\tabcellsep 618\tabcellsep 3513\tabcellsep 1849\tabcellsep 600\tabcellsep \multicolumn{2}{l}{2889 1556}\tabcellsep 574\tabcellsep 2419\tabcellsep 1399\tabcellsep 564\end{longtable} \par
 
\caption{\label{tab_8}Table 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8} \par 
\begin{longtable}{P{0.05873533246414602\textwidth}P{0.47985658409387216\textwidth}P{0.31140808344198173\textwidth}}
Component\tabcellsep Description\tabcellsep Complexity\\
\tabcellsep Three nested iterations and an inner if statement with an\tabcellsep O(N*N*M+1+1), M is very close to 1\\
Procedure 1\tabcellsep assignment statement. But innermost iteration considers\tabcellsep and very low to N\\
\tabcellsep a low number of transactions well below N.\tabcellsep \textasciitilde  O(N 2 )\\
Procedure 2\tabcellsep Array create a statement, three nested iterations, inner if statement, and inner assignment statement. But innermost iteration considers a very low number of transactions well below to N.\tabcellsep O(1+N*N*M+1+1) \textasciitilde  O(N 2 ) ), M is very close to 1 and very low to N \textasciitilde  O(N 2 )\\
\tabcellsep \tabcellsep O(1+1+(N*(N+1)(1+1+1+M+1+1),\\
Procedure 3\tabcellsep \tabcellsep M is very close to 1 and very low to N\\
\tabcellsep \tabcellsep \textasciitilde  O(N 2 )\\
Procedure 4\tabcellsep two assignment statements within a for loop and one outside assignment statement.\tabcellsep \end{longtable} \par
 
\begin{quote}
O(N*(1+1)+1) \textasciitilde  O(N)\end{quote}

\caption{\label{tab_9}Table 8 :}\end{figure}
 			\label{foot_0}\footnote{\label{foot_0} Year 2023 © 2023 Global Journals} 		 		\backmatter  			 \par
A Novel Frequent Pattern Mining Algorithm for Evaluating Applicability of a Mobile Learning Framework  
\subsection[{b) Results of the Proposed Novel Frequently Pattern Mining Algorithm}]{b) Results of the Proposed Novel Frequently Pattern Mining Algorithm}\par
The proposed algorithm was implemented using the Python programming language. The following results were obtained after running the proposed algorithm on the dataset. Year 2023 © 2023 Global Journals A Novel Frequent Pattern Mining Algorithm for Evaluating Applicability of a Mobile Learning Framework used Python programming language implementations of the proposed novel frequent pattern mining algorithm, the Apriori associated rule mining algorithm, and the FP-Growth frequent pattern mining algorithm. Results reveal that the system's applicability is not less than 60\% by the FP-Growth algorithm while it should be greater than 61\% by the Apriori algorithm.\par
Meanwhile, our proposed algorithm gives 82\% of the system applicability for a 75\% threshold as the transaction's minimum features. Finally, we can conclude that the proposed pattern mining algorithm provides accurate and more precise results for evaluating the proposed ML system's applicability compared to the Apriori and FP-Growth algorithms. Meanwhile, in the applicability evaluation of the learning system, the proposed algorithm shows better efficiency than the Apriori and the FP-Growth for different support thresholds in various sizes of transactions. The proposed algorithm also shows the competitive value for the time complexity with the other two algorithms used in this study for larger datasets. However, the proposed novel pattern mining algorithm's efficiency can be improved further by the direct use of the binary incidence matrix format dataset.			 			  				\begin{bibitemlist}{1}
\bibitem[Belhadi et al. ()]{b17}\label{b17} 	 		‘A general-purpose distributed pattern mining system’.  		 			A Belhadi 		,  		 			Y Djenouri 		,  		 			J C W Lin 		,  		 			A Cano 		.  	 	 		\textit{Applied Intelligence}  		2020. p. .  	 
\bibitem[Alzu'bi et al. ()]{b14}\label{b14} 	 		‘A Novel Recommender System Based on Apriori Algorithm for Requirements Engineering’.  		 			S Alzu'bi 		,  		 			B Hawashin 		,  		 			M Elbes 		,  		 			M Al-Ayyoub 		.  	 	 		\textit{2018 fifth international conference on social networks analysis, management and security (snams)},  		2018.  	 
\bibitem[Ikhwan et al. ()]{b18}\label{b18} 	 		‘A Novelty of Data Mining for Promoting Education based on FP-Growth Algorithm’.  		 			A Ikhwan 		,  		 			M Yetri 		,  		 			Y Syahra 		,  		 			J Halim 		,  		 			A P U Siahaan 		,  		 			S Aryza 		,  		 			Y M Yacob 		.  	 	 		\textit{International Journal of Civil Engineering and Technology (IJCIET)}  		2018. 9  (7)  p. .  	 
\bibitem[Arreeras et al. ()]{b12}\label{b12} 	 		‘An Association Rule Mining-Based Exploration of Travel Patterns in Wide Tourism Areas using A Wi-Fi Package Sensing Survey’.  		 			T Arreeras 		,  		 			M Endo 		,  		 			H Takahashi 		,  		 			T Asada 		,  		 			M Arimura 		.  	 	 		\textit{Journal of the Eastern Asia Society for Transportation Studies}  		2019. 13 p. .  	 
\bibitem[Zhang and Zu ()]{b38}\label{b38} 	 		‘An Efficient Parallel High Utility Sequential Pattern Mining Algorithm’.  		 			C Zhang 		,  		 			Y Zu 		.  	 	 		\textit{2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems},  		 (Zhangjiajie)  		2019. HPCC/SmartCity/DSS.  	 
\bibitem[Yuan ()]{b39}\label{b39} 	 		‘An Improved Apriori Algorithm for Mining Association Rules’.  		 			X Yuan 		.  	 	 		\textit{AIP Conference Proceedings},  		2017.  	 
\bibitem[Dharshinni et al. ()]{b15}\label{b15} 	 		‘Analysis of Accuracy K-Means and Apriori Algorithms for Patient Data Clusters’.  		 			N P Dharshinni 		,  		 			F Azmi 		,  		 			I Fawwaz 		,  		 			A M Husein 		,  		 			S D Siregar 		.  	 	 		\textit{In Journal of Physics: Conference Series}  		2019. 1230  (1)  p. 12020.  	 
\bibitem[Cantabella et al. ()]{b7}\label{b7} 	 		‘Analysis of student behavior in learning management systems through a Big Data framework’.  		 			M Cantabella 		,  		 			R Martínez-España 		,  		 			B Ayuso 		,  		 			J Y Antonio 		,  		 			A Muñoz 		.  	 	 		\textit{Future Generation Computer Systems}  		2019. 90 p. .  	 
\bibitem[Wang et al. ()]{b1}\label{b1} 	 		‘Applicability and transferability of interventions in evidencebased public health’.  		 			S Wang 		,  		 			J R Moss 		,  		 			J E Hiller 		.  	 	 		\textit{Health Promotion International}  		2005. p. .  	 
\bibitem[Wu et al. ()]{b16}\label{b16} 	 		‘Application of a two-step cluster analysis and the Apriori algorithm to classify the deformation states of two typical colluvial landslides in the Three Gorges, China’.  		 			X Wu 		,  		 			F B Zhan 		,  		 			K Zhang 		,  		 			Q Deng 		.  	 	 		\textit{Environmental Earth Sciences}  		2016. 75  (2)  p. 146.  	 
\bibitem[Anand and Vinodchandra ()]{b34}\label{b34} 	 		‘Association rule mining using treap’.  		 			H S Anand 		,  		 			S S Vinodchandra 		.  	 	 		\textit{International Journal of Machine Learning and Cybernetics}  		2016. 9  (4)  p. .  	 
\bibitem[Balakrishnan and Sridharan ()]{b31}\label{b31} 	 		 			R Balakrishnan 		,  		 			S Sridharan 		.  		\textit{Discrete mathematics, boca raton},  		2020. CRC Press.  	 
\bibitem[Dahdouh et al. ()]{b8}\label{b8} 	 		‘Building an e-learning Recommender System Using Association Rules Techniques and R Environment’.  		 			K Dahdouh 		,  		 			L Oughdir 		,  		 			A Dakkak 		,  		 			A Ibriz 		.  	 	 		\textit{International Journal of Information Science \& Technology -iJIST}  		2019. 3  (2)  p. .  	 
\bibitem[Wu and Zhang ()]{b10}\label{b10} 	 		‘Building the electronic evidence analysis model based on association rule mining and FP-growth algorithm’.  		 			Y Wu 		,  		 			J Zhang 		.  	 	 		\textit{Soft Computing},  		2019. p. .  	 
\bibitem[Heaton ()]{b32}\label{b32} 	 		\textit{Comparing dataset characteristics that favor the Apriori, Eclat or FP-Growth frequent itemset mining algorithms},  		 			J Heaton 		.  		2016. 2016.  	 
\bibitem[Popova and Yurzhenko ()]{b24}\label{b24} 	 		‘Competency Framework as an Instrument to Assess Professional Competency of Future Seafarers’.  		 			H Popova 		,  		 			A Yurzhenko 		.  	 	 		\textit{ICTERI}  		2019. Kherson, Ukraine.  	 
\bibitem[Mirmozaffari et al. ()]{b22}\label{b22} 	 		‘Data Mining Apriori Algorithm for Heart Disease Prediction’.  		 			M Mirmozaffari 		,  		 			A Alinezhad 		,  		 			A Gilanpour 		.  	 	 		\textit{Communications \& Instrumentation Engg}  		2017. 4  (1)  p. .  	 	 (International Journal of Computing) 
\bibitem[Dunham ()]{b35}\label{b35} 	 		\textit{Data mining: Introductory and advanced topics},  		 			M H Dunham 		.  		2006. Pearson Education India.  	 
\bibitem[Rojanavasu ()]{b11}\label{b11} 	 		‘Educational Data Analytics using Association Rule Mining and Classification’.  		 			P Rojanavasu 		.  	 	 		\textit{2019 Joint International Conference on Digital Arts, Media and Technology with ECTI Northern Section Conference on Electrical, Electronics, Computer and Telecommunications Engineering},  		2019. ECTI DAMT-NCON.  	 
\bibitem[Hussain et al. ()]{b37}\label{b37} 	 		‘Educational Data Mining and Analysis of Students' Academic Performance Using WEKA’.  		 			S Hussain 		,  		 			N A Dahan 		,  		 			F M Ba-Alwib 		,  		 			N Ribata 		.  	 	 		\textit{Indonesian Journal of Electrical Engineering and Computer Science}  		2018. 9  (2)  p. .  	 
\bibitem[Karagiannis and Satratzemi ()]{b25}\label{b25} 	 		‘Enhancing Adaptivity in Moodle: Framework and Evaluation Study’.  		 			I Karagiannis 		,  		 			M Satratzemi 		.  	 	 		\textit{International Conference on Interactive Collaborative Learning},  		 (Budapest, Hungary)  		2017.  	 
\bibitem[Gaikwad et al. ()]{b40}\label{b40} 	 		‘Evaluation of Apriori Algorithm on Retail Market Transactional Database to get Frequent Itemsets’.  		 			P R Gaikwad 		,  		 			S D Kamble 		,  		 			N V Thakur 		,  		 			A S Patharkar 		.  	 	 		\textit{Proceedings of the Second International Conference on Research in Intelligent and Computing in Engineering},  		 (the Second International Conference on Research in Intelligent and Computing in Engineering)  		2017.  	 
\bibitem[Agrawal and Srikant ()]{b5}\label{b5} 	 		‘Fast algorithms for mining association rules’.  		 			R Agrawal 		,  		 			R Srikant 		.  	 	 		\textit{Proc. 20th int. conf. very large data bases, VLDB},  		 (20th int. conf. very large data bases, VLDB)  		1994.  	 
\bibitem[Halvoník and Kapusta ()]{b23}\label{b23} 	 		‘Framework for E-Learning Materials Optimization’.  		 			D Halvoník 		,  		 			J Kapusta 		.  	 	 		\textit{International Journal of Emerging Technologies in Learning (iJET)}  		2020. 15  (11)  p. .  	 
\bibitem[Nasreen et al. ()]{b30}\label{b30} 	 		‘Frequent Pattern Mining Algorithms for Finding Associated Frequent Patterns for Data Streams: A Survey’.  		 			S Nasreen 		,  		 			M A Azam 		,  		 			K Shehzad 		,  		 			U Naeem 		,  		 			M A Ghazanfar 		.  	 	 		\textit{The 5th International Conference on Emerging Ubiquitous Systems and Pervasive Networks},  		2014.  	 	 (EUSPN-2014) 
\bibitem[Wang and Lin ()]{b19}\label{b19} 	 		‘How Instructors Evaluate an e-Learning System? An Evaluation Model Combining Fuzzy AHP with Association Rule Mining’.  		 			C.-S Wang 		,  		 			S.-L Lin 		.  	 	 		\textit{Journal of Internet Technology}  		2019. p. .  	 
\bibitem[Jie and Gang ()]{b21}\label{b21} 	 		‘Intelligence Data Mining Based on Improved Apriori Algorithm’.  		 			Z Jie 		,  		 			W Gang 		.  	 	 		\textit{Journal of Computers}  		2019. p. .  	 
\bibitem[Suresh and Ramanjaneyulu ()]{b29}\label{b29} 	 		‘Mining Frequent Itemsets Using Apriori Algorithm’.  		 			J Suresh 		,  		 			T Ramanjaneyulu 		.  	 	 		\textit{Int. J. Comput. Trends Technol}  		2013. 4 p. .  	 
\bibitem[Pei and Han ()]{b4}\label{b4} 	 		‘Mining Frequent patterns without candidate generation’.  		 			J Pei 		,  		 			J Han 		.  	 	 		\textit{SIGMOD' 00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data},  		 (New York, NY, USA)  		2000.  	 
\bibitem[Han et al. ()]{b28}\label{b28} 	 		‘Mining frequent patterns without candidate generation’.  		 			J Han 		,  		 			J Pei 		,  		 			Y Yin 		.  	 	 		\textit{ACM sigmod record}  		2000. 29  (2)  p. .  	 
\bibitem[Dolawattha et al. ()]{b26}\label{b26} 	 		‘Modelling the learner's perspectives on mobile learning in higher education’.  		 			D Dolawattha 		,  		 			S Premadasa 		,  		 			P Jayaweera 		.  	 	 		\textit{2018 18th International Conference on Advances in ICT for Emerging Regions},  		2018.  	 
\bibitem[Budak and Erol ()]{b9}\label{b9} 	 		‘Navigation Behavior Analysis of Users on A Distance Education Website: KLUDEC Sample’.  		 			V Ö Budak 		,  		 			Ç S Erol 		.  	 	 		\textit{7th International Conference on "Innovations in Learning for the Future": Digital Transformation in},  		 (?stanbul)  		2018.  	 
\bibitem[Azeez et al. ()]{b13}\label{b13} 	 		‘Network Intrusion Detection with a Hashing Based Apriori Algorithm Using Hadoop MapReduce’.  		 			N A Azeez 		,  		 			T J Ayemobola 		,  		 			S Misra 		,  		 			R Maskeliunas 		,  		 			R Dama?evicius 		.  	 	 		\textit{Computers}  		2019. p. 86.  	 
\bibitem[Buehrer et al. ()]{b36}\label{b36} 	 		‘Outof-Core Frequent Pattern Mi ni ng on a C ommodi ty PC’.  		 			G Buehrer 		,  		 			S Parthasarathy 		,  		 			A Ghoting 		.  	 	 		\textit{Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining},  		 (the 12th ACM SIGKDD international conference on Knowledge discovery and data miningPhiladelphia, Pennsylvania, USA.)  		2006.  	 
\bibitem[Soad et al. ()]{b0}\label{b0} 	 		‘Quality evaluation of mobile learning applications’.  		 			G W Soad 		,  		 			N F D Filho 		,  		 			E F Barbosa 		.  	 	 		\textit{2016 IEEE Frontiers in Education Conference (FIE)},  		 (Erie, PA, USA, USA)  		2016.  	 
\bibitem[Cheng et al. ()]{b20}\label{b20} 	 		‘Research on audit log association rule mining based on improved Apriori algorithm’.  		 			M Cheng 		,  		 			K Xu 		,  		 			X Gong 		.  	 	 		\textit{2016 IEEE International Conference on Big Data Analysis (ICBDA)},  		2016.  	 
\bibitem[Doko et al. ()]{b6}\label{b6} 	 		\textit{Sequential Pattern Mining Model to Identify the Most Important or Difficult Learning Topics via Mobile Technologies},  		 			E Doko 		,  		 			L A Bexheti 		,  		 			M Hamiti 		,  		 			B P Etemi 		.  		2018. p. .  	 	 (iJIM) 
\bibitem[Dolawattha et al. ()]{b27}\label{b27} 	 		‘The Impact Model: Teachers' Mobile Learning Adoption in Higher Education’.  		 			D Dolawattha 		,  		 			S Premadasa 		,  		 			P Jayaweera 		.  	 	 		\textit{International Journal of Education and Development using Information and Communication Technology}  		2019. 15  (4)  p. .  	 
\bibitem[Tahyudin et al. ()]{b33}\label{b33} 	 		‘Time complexity of Apriori and evolutionary algorithm For numerical association rule mining optimization’.  		 			I Tahyudin 		,  		 			H Haviluddin 		,  		 			H Nanbo 		.  	 	 		\textit{International journal of scientific \& technology research}  		2019. 8  (11)  p. .  	 
\bibitem[Rosemann and Vessey ()]{b2}\label{b2} 	 		‘Toward Improving the Relevance of Information Systems Research to Practice: The Role of Applicability Checks’.  		 			M Rosemann 		,  		 			I Vessey 		.  	 	 		\textit{MIS Quarterly}  		2008. 32  (1)  p. .  	 
\bibitem[Ventura and Luna ()]{b3}\label{b3} 	 		 			S Ventura 		,  		 			J M Luna 		.  		\textit{Pattern mining with evolutionary algorithms},  		 (Cordoba, Spain)  		2016. Springer.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
