<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2d1 20170631//EN" "JATS-journalpublishing1.dtd">
<article xlink="http://www.w3.org/1999/xlink" dtd-version="1.0" article-type="technology" lang="en"><front><journal-meta><journal-id journal-id-type="publisher">IJCRR</journal-id><journal-id journal-id-type="nlm-ta">I Journ Cur Res Re</journal-id><journal-title-group><journal-title>International Journal of Current Research and Review</journal-title><abbrev-journal-title abbrev-type="pubmed">I Journ Cur Res Re</abbrev-journal-title></journal-title-group><issn pub-type="ppub">2231-2196</issn><issn pub-type="opub">0975-5241</issn><publisher><publisher-name>Radiance Research Academy</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">2079</article-id><article-id pub-id-type="doi"/><article-id pub-id-type="doi-url"/><article-categories><subj-group subj-group-type="heading"><subject>Technology</subject></subj-group></article-categories><title-group><article-title>COMPARISON OF PROCESS MINING ALGORITHMS WITH ASSOCIATION RULE MINING ALGORITHMS&#13;
</article-title></title-group><contrib-group><contrib contrib-type="author"><name><surname>.M.S</surname><given-names>Saravanan</given-names></name></contrib><contrib contrib-type="author"><name><surname>.R.J</surname><given-names>Rama Sree</given-names></name></contrib></contrib-group><volume>)</volume><issue/><fpage>83</fpage><lpage>89</lpage><permissions><copyright-statement>This article is copyright of Popeye Publishing, 2009</copyright-statement><copyright-year>2009</copyright-year><license license-type="open-access" href="http://creativecommons.org/licenses/by/4.0/"><license-p>This is an open-access article distributed under the terms of the Creative Commons Attribution (CC BY 4.0) Licence. You may share and adapt the material, but must give appropriate credit to the source, provide a link to the licence, and indicate if changes were made.</license-p></license></permissions><abstract><p>In the recent studies says that is the state of the art of process mining algorithms were used in different&#13;
applications such as healthcare, sales and inventory, etc. But in my previous research paper, first time we&#13;
have implemented the process mining algorithms in the domain of dyeing units. Normally, the dyeing&#13;
unit is complex in nature, because it involves dynamic features in the process. Moreover, it is also critical&#13;
to keep a check on the automated processes to produce the expected results in the form of quality and&#13;
timely dyeing processes. Delivering these processes is a complex, because colour shades are difficult to&#13;
identify the little difference and also various dyeing problems were identified after dye mix. The main&#13;
process of dyeing process is dye mix process; it involved various treatments, these treatments were very&#13;
difficult to maintain the shade matching. Therefore, the process mining algorithms were used to identify&#13;
the better process control against the difficulties of dyeing process. These process mining algorithms&#13;
produce a diagrammatic process model, which is very easy to understand by the dyers, but when the&#13;
process has more number of activities then the complex process models were produced. The outcome of&#13;
these process models were not easy to understand, so some clustering techniques were used but at the&#13;
same time the missing activities produce more noise, that is the process model after clustering misses the&#13;
originality. To overcome these limitations, the association rule mining algorithms were used in the&#13;
domain of dyeing unit and the related issues are also compared in this paper.&#13;
</p></abstract><kwd-group><kwd>Dyeing unit</kwd><kwd> process mining</kwd><kwd> association rule mining</kwd><kwd> clustering</kwd><kwd> dye mix</kwd><kwd> shade</kwd></kwd-group></article-meta></front></article>
