<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="5.3.1" xmlns="http://www.crossref.org/schema/5.3.1" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schema/deposit/crossref5.3.1.xsd">
 <head>
  <doi_batch_id>aspg-31-3163-1791687016</doi_batch_id>
  <timestamp>20261011025016</timestamp>
  <depositor>
   <depositor_name>American Scientific Publishing Group</depositor_name>
   <email_address>admin@americaspg.com</email_address>
  </depositor>
  <registrant>American Scientific Publishing Group</registrant>
 </head>
 <body>
  <journal>
   <journal_metadata language="en">
    <full_title>International Journal of Advances in Applied Computational Intelligence</full_title>
    <abbrev_title>IJAACI</abbrev_title>
    <issn media_type="electronic">2833-5600</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2024</year>
    </publication_date>
    <journal_volume>
     <volume>6</volume>
    </journal_volume>
    <issue>2</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>Enhancing Financial Fraud Detection using Temporal Patter Mining Technique</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>Ahmed</given_name>
      <surname>Aziz</surname>
      <affiliations>
       <institution>
        <institution_name>Tashkent State University of Economics, Tashkent, Uzbekistan</institution_name>
       </institution>
      </affiliations>
     </person_name>
     <person_name sequence="additional" contributor_role="author">
      <given_name>Sanjar</given_name>
      <surname>Mirzaliev</surname>
      <affiliations>
       <institution>
        <institution_name>Tashkent State University of Economics, Tashkent, Uzbekistan</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>Examining the temporal behavior of common patterns, obtaining appropriate clusters, and reducing the size of discovered patterns are three significant challenges in temporal data mining. Among the available methods, the constraint-based pattern mining approach has achieved remarkable progress in this domain. Apriori and Interleaved algorithms, which are both slow and outdated, are nonetheless used by present time-granularity pattern exploration approaches. To address these issues, we propose the Frequent Pattern Growth method with Special Constraints. The system incorporates a method for generating patterns on a regular basis. It mandates that transactional datasets adhere to complete and partial cyclic criteria. To locate all possible periodic patterns within the Spatio temporal database, we redefine the task as periodic pattern mining in this thesis. The proposed method makes use of a periodic pattern tree miner. To begin, the clustering method uses an innovative global pollination artificial fish swarm technique to create the most effective dense clusters.</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2024</year>
    </publication_date>
    <pages>
     <first_page>62</first_page>
     <last_page>72</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">3163</item_number>
    </publisher_item>
    <ai:program name="AccessIndicators">
     <ai:license_ref applies_to="vor">https://creativecommons.org/licenses/by/4.0/</ai:license_ref>
    </ai:program>
    <doi_data>
     <doi>10.54216/IJAACI.060206</doi>
     <resource>https://www.americaspg.com/journal/31/article/3163</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://www.americaspg.com/storage/61724158405.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
