<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1665-6423</journal-id>
<journal-title><![CDATA[Journal of applied research and technology]]></journal-title>
<abbrev-journal-title><![CDATA[J. appl. res. technol]]></abbrev-journal-title>
<issn>1665-6423</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Instituto de Ciencias Aplicadas y Tecnología]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1665-64232025000100008</article-id>
<article-id pub-id-type="doi">10.22201/icat.24486736e.2025.23.1.2508</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Leveraging LSTM for precision inventory management by future demand forecasting]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Tiwari]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
<xref ref-type="aff" rid="Aaf"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Pillai]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Janghel]]></surname>
<given-names><![CDATA[R. R.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Bhilai Institute of Technology Department of Computer Science and Information technology Engineering ]]></institution>
<addr-line><![CDATA[Durg Chhattisgarh]]></addr-line>
<country>India</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Rungta College of Engineering and Technology Department of Computer Science Engineering ]]></institution>
<addr-line><![CDATA[Bhilai Chhattisgarh]]></addr-line>
<country>India</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Bhilai Institute of Technology Department of Computer Application ]]></institution>
<addr-line><![CDATA[Durg Chhattisgarh]]></addr-line>
<country>India</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,National Institute of Technology Department of Information technology ]]></institution>
<addr-line><![CDATA[Raipur Chhattisgarh]]></addr-line>
<country>India</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>00</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>00</month>
<year>2025</year>
</pub-date>
<volume>23</volume>
<numero>1</numero>
<fpage>8</fpage>
<lpage>21</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1665-64232025000100008&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1665-64232025000100008&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1665-64232025000100008&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract The extraction of high utility data from massive datasets is one of the most well-known areas of research in data mining. The goal of high utility itemset mining is to identify the inventory's most lucrative items that users tend to favor. An LSTM-based approach is suggested to determine what consumers buy most frequently. Based on these purchases, high utility items that are expected to be in demand in the future are then identified based on client buying patterns. The development of the design, which will be utilized to manage inventories going forward and identify each consumer's item set, is the focus rather than just the price or amount of the item purchased. Additionally, related consumer groups can be put together, and consumers of similar commodities can be located by expanding the use case of the model. Lastly, an empirical comparison of the algorithms examines the accuracy of the approach and the number of valuable item sets and consumers that have been discovered via the use of the algorithms. The LSTM-based approach is the most effective, as seen by its 98% accuracy rate. It is especially useful for predicting future consumer purchases, identifying the most lucrative items, and effectively managing inventories.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[High utility itemset mining]]></kwd>
<kwd lng="en"><![CDATA[LSTM]]></kwd>
<kwd lng="en"><![CDATA[machine learning]]></kwd>
<kwd lng="en"><![CDATA[deep learning]]></kwd>
<kwd lng="en"><![CDATA[neural networks]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Duong]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Truong]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Tran]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Le]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Fast generation of sequential patterns with item constraints from concise representations]]></article-title>
<source><![CDATA[Knowledge and Information Systems]]></source>
<year>2020</year>
<volume>62</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>2191-223</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Duong]]></surname>
<given-names><![CDATA[Q. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Fournier-Viger]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramampiaro]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Nørvåg]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Dam]]></surname>
<given-names><![CDATA[T. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient high utility itemset mining using buffered utility-lists]]></article-title>
<source><![CDATA[Applied Intelligence]]></source>
<year>2018</year>
<volume>48</volume>
<numero>7</numero>
<issue>7</issue>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dong]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An efficient method for pruning redundant negative and positive association rules]]></article-title>
<source><![CDATA[Neurocomputing]]></source>
<year>2020</year>
<volume>393</volume>
<page-range>245-58</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fournier-Viger]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[CW.]]></given-names>
</name>
<name>
<surname><![CDATA[Zida]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Tseng]]></surname>
<given-names><![CDATA[V.S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Andreasen]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Christiansen]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Cubero]]></surname>
<given-names><![CDATA[JC.]]></given-names>
</name>
<name>
<surname><![CDATA[Ra&#347;]]></surname>
<given-names><![CDATA[Z.W.]]></given-names>
</name>
</person-group>
<collab>Foundations of Intelligent Systems</collab>
<source><![CDATA[Lecture Notes in Computer Science]]></source>
<year>2014</year>
<volume>8502</volume>
<publisher-loc><![CDATA[Cham ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fournier-Viger]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J. C. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Fujita]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Koh]]></surname>
<given-names><![CDATA[Y. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mining local and peak high utility itemsets]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2019</year>
<volume>481</volume>
<page-range>344-67</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[García-Sánchez]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Valencia-García]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez-Béjar]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An integrated approach for developing e-commerce applications]]></article-title>
<source><![CDATA[Expert Systems with applications]]></source>
<year>2005</year>
<volume>28</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>223-35</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gan]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J. C. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Chao]]></surname>
<given-names><![CDATA[H. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Fujita]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Philip]]></surname>
<given-names><![CDATA[S. Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Correlated utility-based pattern mining]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2019</year>
<volume>504</volume>
<page-range>470-86</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gan]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J. C. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Fournier-Viger]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Chao]]></surname>
<given-names><![CDATA[H. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Philip]]></surname>
<given-names><![CDATA[S. Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Fast utility mining on sequence data]]></article-title>
<source><![CDATA[IEEE transactions on cybernetics]]></source>
<year>2021</year>
<volume>51</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>487-500</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ghadekar]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Dombe]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Image-Based Product Recommendations Using Market Basket Analysis]]></source>
<year>2019</year>
<conf-name><![CDATA[ 2019 5th International Conference On Computing, Communication, Control And Automation (ICCUBEA)]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gan]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J. C. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Yin]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Fournier-Viger]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Chao]]></surname>
<given-names><![CDATA[H. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[P. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Utility mining across multi-dimensional sequences]]></article-title>
<source><![CDATA[ACM Transactions on Knowledge Discovery from Data (TKDD)]]></source>
<year>2021</year>
<volume>15</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1-24</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[He]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Han]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient high-utility occupancy itemset mining algorithm on massive data]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2022</year>
<volume>210</volume>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hochreiter]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Schmidhuber]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Long Short-Term Memory]]></article-title>
<source><![CDATA[Neural Computation]]></source>
<year>1997</year>
<volume>9</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>1735-80</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kannimuthu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Premalatha]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Discovery of high utility itemsets using genetic algorithm with ranked mutation]]></article-title>
<source><![CDATA[Applied Artificial Intelligence]]></source>
<year>2014</year>
<volume>28</volume>
<numero>4</numero>
<issue>4</issue>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lai]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Gan]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mining periodic high-utility itemsets with both positive and negative utilities]]></article-title>
<source><![CDATA[Engineering Applications of Artificial Intelligence]]></source>
<year>2023</year>
<volume>123</volume>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Shang]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[List-based mining top-k average-utility itemsets with effective pruning and threshold raising strategies]]></article-title>
<source><![CDATA[Applied Intelligence]]></source>
<year>2023</year>
<volume>53</volume>
<numero>21</numero>
<issue>21</issue>
<page-range>25678-96</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J. C. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Gan]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Fournier-Viger]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Hong]]></surname>
<given-names><![CDATA[T. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Tseng]]></surname>
<given-names><![CDATA[V. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient algorithms for mining high-utility itemsets in uncertain databases]]></article-title>
<source><![CDATA[Knowledge-Based Systems]]></source>
<year>2016</year>
<volume>96</volume>
<page-range>171-87</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J. C. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Fournier-Viger]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[J. M. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Hong]]></surname>
<given-names><![CDATA[T. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[L. S. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhan]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mining high-utility itemsets based on particle swarm optimization]]></article-title>
<source><![CDATA[Engineering Applications of Artificial Intelligence]]></source>
<year>2016</year>
<volume>55</volume>
<page-range>320-30</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J. C. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Fournier-Viger]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Hong]]></surname>
<given-names><![CDATA[T. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Voznak]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A binary PSO approach to mine high-utility itemsets]]></article-title>
<source><![CDATA[Soft Computing]]></source>
<year>2017</year>
<volume>21</volume>
<page-range>5103-21</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J.CW.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Fournier-Viger]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[High-Utility Sequential Pattern Mining with Multiple Minimum Utility Thresholds]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Jensen]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Shahabi]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Lian]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<source><![CDATA[Web and Big Data. APWeb-WAIM 2017. Lecture Notes in Computer Science]]></source>
<year>2017</year>
<volume>10366</volume>
<publisher-loc><![CDATA[Cham ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J. C. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Fournier-Viger]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Hong]]></surname>
<given-names><![CDATA[T. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A two-phase approach to mine short-period high-utility itemsets in transactional databases]]></article-title>
<source><![CDATA[Advanced Engineering Informatics]]></source>
<year>2017</year>
<volume>33</volume>
<page-range>29-43</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Liao]]></surname>
<given-names><![CDATA[Wk.]]></given-names>
</name>
<name>
<surname><![CDATA[Choudhary]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Ho]]></surname>
<given-names><![CDATA[T.B.]]></given-names>
</name>
<name>
<surname><![CDATA[Cheung]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Knowledge Discovery and Data Mining. PAKDD 2005. Lecture Notes in Computer Science]]></source>
<year>2005</year>
<volume>3518</volume>
<publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Qu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mining high utility itemsets without candidate generation]]></article-title>
<source><![CDATA[Proceedings of the 21st ACM international conference on Information and knowledge management]]></source>
<year>2012</year>
<page-range>55-64</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Luna]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kiran]]></surname>
<given-names><![CDATA[R. U.]]></given-names>
</name>
<name>
<surname><![CDATA[Fournier-Viger]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Ventura]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient mining of top-k high utility itemsets through genetic algorithms]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2023</year>
<volume>624</volume>
<page-range>529-53</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Loukili]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Messaoudi]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[El Ghazi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Machine learning based recommender system for e-commerce]]></article-title>
<source><![CDATA[IAES International Journal of Artificial Intelligence]]></source>
<year>2023</year>
<volume>12</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1803-11</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nam]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Yun]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Yoon]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J. C. W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2020</year>
<volume>529</volume>
<page-range>1-27</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pazhaniraja]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Sountharrajan]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Suganya]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Karthiga]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Top &#8216;N&#8217;Variant Random Forest Model for High Utility Itemsets Recommendation]]></article-title>
<source><![CDATA[EAI Endorsed Transactions on Energy Web]]></source>
<year>2021</year>
<volume>8</volume>
<numero>35</numero>
<issue>35</issue>
<page-range>e7</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pillai]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Vyas]]></surname>
<given-names><![CDATA[O. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Exploration of Soft Computing Approaches in Itemset Mining]]></article-title>
<collab>I. Management Association</collab>
<source><![CDATA[Business Intelligence: Concepts, Methodologies, Tools, and Applications]]></source>
<year>2015</year>
<page-range>1830-56</page-range><publisher-name><![CDATA[IGI Global]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rahman]]></surname>
<given-names><![CDATA[M. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Arefin]]></surname>
<given-names><![CDATA[M. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Rahman]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Ahmed]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Islam]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Dhar]]></surname>
<given-names><![CDATA[P. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Kwon]]></surname>
<given-names><![CDATA[O. J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Comprehensive Survey on Affinity Analysis, Bibliomining, and Technology Mining: Past, Present, and Future Research]]></article-title>
<source><![CDATA[Applied Sciences]]></source>
<year>2022</year>
<volume>12</volume>
<numero>10</numero>
<issue>10</issue>
</nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sra]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Chand]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Reinduction-Based Approach for Efficient High Utility Itemset Mining from Incremental Datasets]]></article-title>
<source><![CDATA[Data Science and Engineering]]></source>
<year>2024</year>
<volume>9</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>73-87</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shankar]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Babu]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Purusothaman]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Jayanthi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[A fast algorithm for mining high utility itemsets]]></source>
<year>2009</year>
<conf-name><![CDATA[ 2009 IEEE International Advance Computing Conference]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sohrabi]]></surname>
<given-names><![CDATA[M. K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An efficient projection-based method for high utility itemset mining using a novel pruning approach on the utility matrix]]></article-title>
<source><![CDATA[Knowledge and Information Systems]]></source>
<year>2020</year>
<volume>62</volume>
<page-range>4141-67</page-range></nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Song]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mining high utility itemsets by dynamically pruning the tree structure]]></article-title>
<source><![CDATA[Applied intelligence]]></source>
<year>2014</year>
<volume>40</volume>
<page-range>29-43</page-range></nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tseng]]></surname>
<given-names><![CDATA[V. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[C. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Shie]]></surname>
<given-names><![CDATA[B. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[P. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[UP-Growth: an efficient algorithm for high utility itemset mining]]></article-title>
<source><![CDATA[Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining]]></source>
<year>2010</year>
<page-range>253-62</page-range></nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sukanya]]></surname>
<given-names><![CDATA[N. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Thangaiah]]></surname>
<given-names><![CDATA[P. R. J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Enhanced differential evolution and particle swarm optimization approaches for discovering high utility itemsets]]></article-title>
<source><![CDATA[International Journal of Computational Intelligence and Applications]]></source>
<year>2023</year>
<volume>22</volume>
<numero>01</numero>
<issue>01</issue>
</nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Siva]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Chaudhari]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Deep Learning Framework with Convolutional Sequential Semantic Embedding for Mining High-Utility Itemsets and Top-N Recommendations]]></source>
<year>2024</year>
<volume>22</volume>
<page-range>44-55</page-range></nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Umayaparvathi]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Iyakutti]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Automated feature selection and churn prediction using deep learning models]]></article-title>
<source><![CDATA[International Research Journal of Engineering and Technology (IRJET)]]></source>
<year>2017</year>
<volume>4</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>1846-54</page-range></nlm-citation>
</ref>
<ref id="B37">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[J. M. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Srivastava]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Wei]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Yun]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J. C. W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Fuzzy high-utility pattern mining in parallel and distributed Hadoop framework]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2021</year>
<volume>553</volume>
<page-range>31-48</page-range></nlm-citation>
</ref>
<ref id="B38">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xiong]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Tian]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Qin]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Frequent itemsets mining with differential privacy over large-scale data]]></article-title>
<source><![CDATA[IEEE access]]></source>
<year>2018</year>
<volume>6</volume>
<page-range>28877-89</page-range></nlm-citation>
</ref>
<ref id="B39">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xue]]></surname>
<given-names><![CDATA[H. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Dai]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Deep matrix factorization models for recommender systems]]></article-title>
<source><![CDATA[IJCAI]]></source>
<year>2017</year>
<volume>17</volume>
<page-range>3203-9</page-range></nlm-citation>
</ref>
<ref id="B40">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Fang]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Sun]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Improved genetic algorithm for high-utility itemset mining]]></article-title>
<source><![CDATA[IEEE Access]]></source>
<year>2019</year>
<volume>7</volume>
<page-range>176799-813</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
