<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CSSE</journal-id>
<journal-id journal-id-type="nlm-ta">CSSE</journal-id>
<journal-id journal-id-type="publisher-id">CSSE</journal-id>
<journal-title-group>
<journal-title>Computer Systems Science &#x0026; Engineering</journal-title>
</journal-title-group>
<issn pub-type="ppub">0267-6192</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">24265</article-id>
<article-id pub-id-type="doi">10.32604/csse.2022.024265</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Object Detection in Remote Sensing Images Using Picture Fuzzy Clustering and MapReduce</article-title><alt-title alt-title-type="left-running-head">Object Detection in Remote Sensing Images Using Picture Fuzzy Clustering and MapReduce</alt-title><alt-title alt-title-type="right-running-head">Object Detection in Remote Sensing Images Using Picture Fuzzy Clustering and MapReduce</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Tuan</surname><given-names>Tran Manh</given-names></name><email>tmtuan@tlu.edu.vn</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Ngan</surname><given-names>Tran Thi</given-names></name>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Trung</surname><given-names>Nguyen Tu</given-names></name>
</contrib><aff><institution>Faculty of Computer Science and Engineering, Thuyloi University</institution>, <addr-line>175 Tay Son, Dong Da, Hanoi, 010000</addr-line>, <country>Vietnam</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Tran Manh Tuan. Email: <email>tmtuan@tlu.edu.vn</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-05-06"><day>06</day>
<month>05</month>
<year>2022</year></pub-date>
<volume>43</volume>
<issue>3</issue>
<fpage>1241</fpage>
<lpage>1253</lpage>
<history>
<date date-type="received"><day>11</day><month>10</month><year>2021</year></date>
<date date-type="accepted"><day>07</day><month>12</month><year>2021</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Tuan, Ngan and Trung</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Tuan, Ngan and Trung</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CSSE_24265.pdf"></self-uri>
<abstract>
<p>In image processing, one of the most important steps is image segmentation. The objects in remote sensing images often have to be detected in order to perform next steps in image processing. Remote sensing images usually have large size and various spatial resolutions. Thus, detecting objects in remote sensing images is very complicated. In this paper, we develop a model to detect objects in remote sensing images based on the combination of picture fuzzy clustering and MapReduce method (denoted as MPFC). Firstly, picture fuzzy clustering is applied to segment the input images. Then, MapReduce is used to reduce the runtime with the guarantee of quality. To convert data for MapReduce processing, two new procedures are introduced, including Map_PFC and Reduce_PFC. The formal representation and details of two these procedures are presented in this paper. The experiments on satellite image and remote sensing image datasets are given to evaluate proposed model. Validity indices and time consuming are used to compare proposed model to picture fuzzy clustering model. The values of validity indices show that picture fuzzy clustering integrated to MapReduce gets better quality of segmentation than using picture fuzzy clustering only. Moreover, on two selected image datasets, the run time of MPFC model is much less than that of picture fuzzy clustering.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Remote sensing images</kwd>
<kwd>picture fuzzy clustering</kwd>
<kwd>image segmentation</kwd>
<kwd>object detection</kwd>
<kwd>MapReduce</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Object detection is an important step in image processing. Object detection systems are often integrated to another image processing models as the first step of the progress. Object detection in images has attracted the attentions of many researchers [<xref ref-type="bibr" rid="ref-1">1</xref>&#x2013;<xref ref-type="bibr" rid="ref-3">3</xref>]. There are different ways to detect objects from images such as using sparse label assignment [<xref ref-type="bibr" rid="ref-4">4</xref>], using convolutional neural network [<xref ref-type="bibr" rid="ref-5">5</xref>,<xref ref-type="bibr" rid="ref-6">6</xref>], multi-level fusion [<xref ref-type="bibr" rid="ref-7">7</xref>], context-based priors [<xref ref-type="bibr" rid="ref-8">8</xref>], implicit 3D orientation learning [<xref ref-type="bibr" rid="ref-9">9</xref>]. Besides, in these researches, the types of images are also different including RGB-D images, aerial images, large images, monocular images, etc.</p>
<p>Object detection in remote sensing images was performed mainly by artificial intelligent methods such as random forest [<xref ref-type="bibr" rid="ref-10">10</xref>], deep hashing neural networks [<xref ref-type="bibr" rid="ref-11">11</xref>], convolutional neural network (CNN) [<xref ref-type="bibr" rid="ref-12">12</xref>]. Currently, CNN network is gradually becoming popular in deep learning and has demonstrated its power in identifying objects from remote sensing images with much higher accuracy than other methods applied from remote sensing [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-13">13</xref>&#x2013;<xref ref-type="bibr" rid="ref-15">15</xref>]. Apart from CNN, fuzzy clustering algorithms are also used to detect objects in images. Recently, [<xref ref-type="bibr" rid="ref-16">16</xref>] introduced the application of fuzzy clustering in satellite image retrieval. In this research, fuzzy C-means (FCM) was applied as a step of image processing. The use of FCM aimed to map the changes in land use and land cover with productive results. In another research, [<xref ref-type="bibr" rid="ref-17">17</xref>], fuzzy multi-characteristic clustering was proposed in order to enhance precision and recall values in content based image retrieval. Fuzzy clustering techniques are also used in object detection from images [<xref ref-type="bibr" rid="ref-18">18</xref>&#x2013;<xref ref-type="bibr" rid="ref-20">20</xref>].</p>
<p>In 2014, [<xref ref-type="bibr" rid="ref-21">21</xref>] introduced picture fuzzy sets with four components, including positive, the neutral, the negative and the refusal degree. These components always appear whenever someone has to make a decision in the daily life. Based on the introduction, picture fuzzy set based algorithms are proposed [<xref ref-type="bibr" rid="ref-22">22</xref>,<xref ref-type="bibr" rid="ref-23">23</xref>] and applied in different applications such as segmentation [<xref ref-type="bibr" rid="ref-24">24</xref>,<xref ref-type="bibr" rid="ref-25">25</xref>], weather forecast [<xref ref-type="bibr" rid="ref-26">26</xref>], finance [<xref ref-type="bibr" rid="ref-27">27</xref>], autonomous driving [<xref ref-type="bibr" rid="ref-28">28</xref>], image processing [<xref ref-type="bibr" rid="ref-29">29</xref>], etc. In many applications, there are always the neutralizations which are not involved in fuzzy clustering algorithms. For example, there are quite similar regions in an image and it is hard to decide which segment those regions belong to. Then, neutralizations affect to the segmentation quality. Because remote sensing image datasets are always large, it is difficult to process and analyze these images.</p>
<p>By the development of cloud computing, data mining, Hadoop and MapReduce [<xref ref-type="bibr" rid="ref-30">30</xref>], the analysis results on big data are very important. Traditional techniques are applied only on structured data bases while big data includes raw data in general. Thus, processing big data effectively is one of the challenges in data processing. The new techniques for doing this are necessary as well.</p>
<p>This paper introduces a model used in remote sensing image segmentation by applying picture fuzzy clustering algorithm (PFC) to increase the accuracy of segmentation results. Moreover, MapReduce procedure is applied in Picture fuzzy clustering in order to reduce the time consuming of PFC in remote sensing image segmentation without decreasing segment quality. MapReduce Picture Fuzzy Clustering (MPFC) model is proposed. Lastly, the evaluations of PFC and MPFC models on two different sets of remote sensing images are also presented.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Background</title>
<sec id="s2_1">
<label>2.1</label>
<title>Picture Fuzzy Clustering (PFC)</title>
<p>Picture fuzzy clustering algorithm [<xref ref-type="bibr" rid="ref-23">23</xref>] was based on intuitionistic fuzzy clustering and applied on picture fuzzy sets. The idea of PFC is to design the objective function with two parts, including the sum of distances from all samples to their centers and entropy. The first element in objective function is an improvement of the objective function of FCM. As same as FCM, a sample belonging to a cluster means that the distance from that sample to cluster center is small. Thus, membership degree of sample to that cluster is high. PFC algorithms replace membership degree &#x03BC; in FCM by (&#x03BC;(2-&#x03BE;)) with refusal degree &#x03BE;. It is clear that a sample is closer to center, the higher membership degree is and the lower refusal degree is as well. In this research, the value (2-&#x03BE;) is chosen to guarantee that when (&#x03BC;(2-&#x03BE;)) &#x2264; 1, then &#x03BC; &#x2264; 1 satisfies. This is the condition of PFS. The second element of objective function is Entropy &#x03B7;(log&#x03B7;&#x002B;&#x03BE;). Thus, objective function of PFC is defined by:</p>
<p><disp-formula id="eqn-1"><label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mi>J</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>C</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03BE;</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">C</mml:mi></mml:mrow></mml:mrow></mml:munderover><mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mrow><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03BE;</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>M</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:math>
</disp-formula></p>
<p>By minimizing this function, the values of <inline-formula id="ieqn-1">
<mml:math id="mml-ieqn-1"><mml:mi>&#x03B7;</mml:mi></mml:math>
</inline-formula> and <inline-formula id="ieqn-2">
<mml:math id="mml-ieqn-2"><mml:mi>&#x03BE;</mml:mi></mml:math>
</inline-formula> of each sample are small. This will reduce the neutral and refusal values of model. The model will improve the accuracy then.</p>
<p>The constraints of this problem are</p>
<p><disp-formula id="eqn-2"><label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>+</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi>&#x03BE;</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:mrow><mml:mo>;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mi>&#x03BE;</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-3"><label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>C</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03BE;</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-4"><label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>C</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03BE;</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">C</mml:mi></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math>
</disp-formula></p>
<p>Using Lagarange multiplier method, based on the objective function <xref ref-type="disp-formula" rid="eqn-1">(1)</xref> and the contraints <xref ref-type="disp-formula" rid="eqn-2">(2)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-4">(4)</xref>, the formulas of V, <inline-formula id="ieqn-3">
<mml:math id="mml-ieqn-3"><mml:mi>&#x03BC;</mml:mi></mml:math>
</inline-formula>, <inline-formula id="ieqn-4">
<mml:math id="mml-ieqn-4"><mml:mi>&#x03B7;</mml:mi></mml:math>
</inline-formula>, <inline-formula id="ieqn-5">
<mml:math id="mml-ieqn-5"><mml:mi>&#x03BE;</mml:mi></mml:math>
</inline-formula> are stated as in <xref ref-type="disp-formula" rid="eqn-5">(5)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-8">(8)</xref>, respectively.</p>
<p><disp-formula id="eqn-5"><label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-6"><label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>C</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mfrac><mml:mn>2</mml:mn><mml:mrow><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mover><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mrow><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mo>;</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mover><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>C</mml:mi></mml:mrow><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-7"><label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>C</mml:mi></mml:mfrac></mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>C</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>C</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>.</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mover><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mrow><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mo>;</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mover><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>C</mml:mi></mml:mrow><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-8"><label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>&#x03B1;</mml:mi></mml:mfrac></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math>
</disp-formula></p>
<p>The main steps of PFC are presented in PFC algorithm as in <xref ref-type="table" rid="table-1">Tab. 1</xref> below.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>PFC algorithm</title></caption>
<table><colgroup>
<col/>
<col/>
</colgroup>
<tbody>
<tr>
<td><bold>Input</bold></td>
<td>Data set X including N samples with d attributes; The number of clusters (C); Threshold &#x03B5;; fuzzifier m; exponent &#x03B1; and the max number of iterations Maxstep &#x003E; 0</td>
</tr>
<tr>
<td><bold>Output</bold></td>
<td>The matrices, <inline-formula id="ieqn-6">
<mml:math id="mml-ieqn-6"><mml:mi>&#x03BC;</mml:mi></mml:math>
</inline-formula>, <inline-formula id="ieqn-7">
<mml:math id="mml-ieqn-7"><mml:mi>&#x03B7;</mml:mi></mml:math>
</inline-formula>, <inline-formula id="ieqn-8">
<mml:math id="mml-ieqn-8"><mml:mi>&#x03BE;</mml:mi></mml:math>
</inline-formula> and center of clusters <inline-formula id="ieqn-9">
<mml:math id="mml-ieqn-9"><mml:mi>V</mml:mi></mml:math>
</inline-formula>;</td>
</tr>
<tr>
<td colspan="2"><bold>FPC</bold></td>
</tr>
<tr>
<td>1</td>
<td>t &#x003D; 0</td>
</tr>
<tr>
<td>2</td>
<td>Init: <inline-formula id="ieqn-10">
<mml:math id="mml-ieqn-10"><mml:msup><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi>t</mml:mi></mml:msup><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mo>;</mml:mo><mml:msup><mml:mrow><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi>t</mml:mi></mml:msup><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mo>;</mml:mo></mml:math>
</inline-formula><break/><inline-formula id="ieqn-11">
<mml:math id="mml-ieqn-11"><mml:msup><mml:mrow><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi>t</mml:mi></mml:msup><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1..</mml:mn><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1..</mml:mn><mml:mi>C</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> satisfy <xref ref-type="disp-formula" rid="eqn-2">(2)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-4">(4)</xref></td>
</tr>
<tr>
<td>3</td>
<td>Repeat</td>
</tr>
<tr>
<td>3.1</td>
<td>t &#x003D; t &#x002B; 1</td>
</tr>
<tr>
<td>3.2</td>
<td>Calculate <inline-formula id="ieqn-12">
<mml:math id="mml-ieqn-12"><mml:msup><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math>
</inline-formula> (<inline-formula id="ieqn-13">
<mml:math id="mml-ieqn-13"><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>C</mml:mi></mml:math>
</inline-formula>) by using <xref ref-type="disp-formula" rid="eqn-5">(5)</xref></td>
</tr>
<tr>
<td>3.3</td>
<td>Calculate <inline-formula id="ieqn-14">
<mml:math id="mml-ieqn-14"><mml:msup><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math>
</inline-formula> (<inline-formula id="ieqn-15">
<mml:math id="mml-ieqn-15"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:math>
</inline-formula>;<inline-formula id="ieqn-16">
<mml:math id="mml-ieqn-16"><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>C</mml:mi></mml:math>
</inline-formula>) by using <xref ref-type="disp-formula" rid="eqn-6">(6)</xref></td>
</tr>
<tr>
<td>3.4</td>
<td>Calculate <inline-formula id="ieqn-17">
<mml:math id="mml-ieqn-17"><mml:msup><mml:mrow><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math>
</inline-formula> (<inline-formula id="ieqn-18">
<mml:math id="mml-ieqn-18"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:math>
</inline-formula>;<inline-formula id="ieqn-19">
<mml:math id="mml-ieqn-19"><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>C</mml:mi></mml:math>
</inline-formula>) by using <xref ref-type="disp-formula" rid="eqn-7">(7)</xref></td>
</tr>
<tr>
<td>3.5</td>
<td>Calculate <inline-formula id="ieqn-20">
<mml:math id="mml-ieqn-20"><mml:msup><mml:mrow><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:math>
</inline-formula> (<inline-formula id="ieqn-21">
<mml:math id="mml-ieqn-21"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:math>
</inline-formula>;<inline-formula id="ieqn-22">
<mml:math id="mml-ieqn-22"><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>C</mml:mi></mml:math>
</inline-formula>) by using <xref ref-type="disp-formula" rid="eqn-8">(8)</xref></td>
</tr>
<tr>
<td>3.6</td>
<td>Until <inline-formula id="ieqn-23">
<mml:math id="mml-ieqn-23"><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mi>&#x03B5;</mml:mi></mml:math>
</inline-formula> or <inline-formula id="ieqn-24">
<mml:math id="mml-ieqn-24"><mml:mi>t</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mi>S</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mi>s</mml:mi></mml:math>
</inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>MapReduce Model</title>
<p>Introduced by Google, MapReduce is a model used in parallel and distributional processing. This model consists of two procedures, including &#x201C;Map&#x201D; procedure and &#x201C;Reduce&#x201D; procedure. These two procedures are defined by user as in <xref ref-type="fig" rid="fig-1">Fig. 1</xref> [<xref ref-type="bibr" rid="ref-31">31</xref>].</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>The flowchart of MapReduce</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_24265-fig-1.png"/>
</fig>
<p>The detail of formal representation of MapReduce (<xref ref-type="fig" rid="fig-1">Fig. 1</xref>) is given as follows.</p>
<p>MapReduce formal representation:</p>
<p>As in [<xref ref-type="bibr" rid="ref-32">32</xref>], the formal representation of MapReduce model is presented as below:</p>
<p><disp-formula id="eqn-9"><label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow></mml:mrow><mml:mo>:</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow></mml:mrow><mml:mn>1</mml:mn><mml:mspace width="thinmathspace" /><mml:mrow><mml:mrow><mml:mi mathvariant="normal">p</mml:mi></mml:mrow></mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">C</mml:mi></mml:mrow></mml:mrow><mml:mn>1</mml:mn><mml:mspace width="thinmathspace" /><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi></mml:mrow></mml:mrow><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mn>2</mml:mn><mml:mspace width="thinmathspace" /><mml:mi mathvariant="normal">p</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mn>2</mml:mn><mml:mspace width="thinmathspace" /><mml:mi mathvariant="normal">c</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-10"><label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow></mml:mrow><mml:mo>:</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow></mml:mrow><mml:mn>2</mml:mn><mml:mspace width="thinmathspace" /><mml:mrow><mml:mrow><mml:mi mathvariant="normal">p</mml:mi></mml:mrow></mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mn>2</mml:mn><mml:mspace width="thinmathspace" /><mml:mi mathvariant="normal">c</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mn>3</mml:mn><mml:mspace width="thinmathspace" /><mml:mi mathvariant="normal">p</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mn>3</mml:mn><mml:mspace width="thinmathspace" /><mml:mi mathvariant="normal">c</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p>where:<list list-type="bullet"><list-item>
<p>P1, C1 are the types of key and input value of map function. p1, c1 is corresponding objects of types P1, C1</p></list-item><list-item>
<p>P2, V2 are the type key and input value of map function. They are aslo the type key and input value of map reduce function. p2, c2 is corresponding objects of types P2, C2</p></list-item><list-item>
<p>P3, C3 are the type key and input value reduce function. p3, c3 is corresponding objects of types P3, C3</p></list-item></list></p>
<p>We have:<list list-type="bullet"><list-item>
<p>If p1, c1, p2, c2 are defined, we get the input, output of map function. Ussually, for text data, p1 is the offset key of data flow and c1 is the content of data flow.</p></list-item><list-item>
<p>If p2, c2, p3, c3 are defined, we get the input, output of reduce function.</p></list-item></list></p>
<p>The formal representation can be rewritten with only p1, c1, p2, c2, p3, c3 as below:</p>
<p><disp-formula id="eqn-11"><label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow></mml:mrow><mml:mo>:</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">p</mml:mi></mml:mrow></mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi></mml:mrow></mml:mrow><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">p</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-12"><label>(12)</label>
<mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow></mml:mrow><mml:mo>:</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">p</mml:mi></mml:mrow></mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">p</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p><xref ref-type="fig" rid="fig-2">Fig. 2</xref> shows the diagram of job execution MapReduce and convert data type from (P1, C1) to (P2, C2) and from (P2, C2) to (P3, C3)</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Job execution in MapReduce</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_24265-fig-2.png"/>
</fig>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>The Proposed Method</title>
<p>In this part, a combination of MapReduce and picture fuzzy clustering is introduced and applied in image clustering problem.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Main Idea</title>
<p>The integration of picture fuzzy clustering and MapReduce method is performed as follow. Firstly, input image is converted to list type for MapReduce processing. Secondly, centers of clusters are generated randomly. Thirdly, the data is separated into many partitions. Each partition is parallel processed by MapTask. This step aims to calculate the membership degree of each sample in data partition corresponding to the centers of clusters using <xref ref-type="disp-formula" rid="eqn-6">Eqs. (6)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-8">(8)</xref> in order to obtain intermediary data. When Maptask is performed on all partitions, the intermediary data is sorted, merged and grouped in to clusters. Then, clustered data is proceeded by ReduceTask to re-calculate the centers of clusters by <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>. The stop condition in this model is the convergence of clusters&#x2019; centers. MapTask and ReduceTask is repeated if the clusters&#x2019; centers are not converged. The results of this model is clustered images.</p>
<p>Our novel model is named as MapReduce based picture fuzzy clustering (MPFC). The framework of MPFC is given in <xref ref-type="fig" rid="fig-3">Fig. 3</xref> below.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Framework of MapReduce based picture fuzzy clustering model</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CSSE_24265-fig-3.png"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Converting Data for MapReduce Processing</title>
<p>In this part, pixel data is converted to various rows formed as a list. These rows include the information of position and following by the values representing for a pixel. The information of position is used to restore clustered images and perform the other tasks such as analysing, evaluating the results. Thus, output of clustering process is the data elements with the information of intensity, median and position.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Formal Representation for Map_PFC and Reduce_PFC Procedures</title>
<p><bold>Input:</bold> Each data element xkj includes the information of position (indices of column and row) and intensity (k, j, <inline-formula id="ieqn-25">
<mml:math id="mml-ieqn-25"><mml:mrow><mml:mi mathvariant="normal">x</mml:mi><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:math>
</inline-formula>).</p>
<p><bold>Output:</bold> The cluster index c and the elements belongs to c cluster in form of (k, j, x<sub>kj</sub>).</p>
<p>Then, we define d1, v1 and d3, v3 as below:</p>
<p>d1 is the offset. v1 is the content of data stream (k, j, x<sub>kj</sub>)</p>
<p>d3 is the information of new clustering cnew, v3 is the list of sets (k, j, x<sub>kj</sub>) of all elements belonging to cluster in d3</p>
<p>Map function assigns data to the nearest cluster. Thus, d2 and v2 can be determined as:</p>
<p>d2 is the index of the nearest cluster to x<sub>kj</sub>. v2 is the set (k, j, x<sub>kj</sub>)</p>
<p>Then, the formal representation of Map and Reduce procedures is:</p>
<p><disp-formula id="eqn-13"><label>(13)</label>
<mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">M</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">C</mml:mi></mml:mrow></mml:mrow><mml:mo>:</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">f</mml:mi><mml:mi mathvariant="normal">f</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">x</mml:mi><mml:mrow><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03B7;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03BE;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-14"><label>(14)</label>
<mml:math id="mml-eqn-14" display="block"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">C</mml:mi></mml:mrow></mml:mrow><mml:mo>:</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mi>C</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mi>C</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mi>C</mml:mi></mml:msubsup><mml:mspace width="thickmathspace" /><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">c</mml:mi><mml:mrow><mml:mi mathvariant="normal">N</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msubsup><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Map_PFC Produre</title>

<p><xref ref-type="table" rid="table-2">Tab. 2</xref> describe the algorithm of Map_ PFC. The purpose of Map_ PFC algorithm is to define the list of membership degree for each cluster center (in the set of shared centers) of input data objects.</p>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Algorithm of Map_PFC</title></caption>
<table><colgroup>
<col/>
<col/>
</colgroup>
<tbody>
<tr>
<td><bold>Input:</bold></td>
<td>Shared centers lstCenter, d1, v1</td>
</tr>
<tr>
<td><bold>Output:</bold></td>
<td>lstD2V2 (the list of pairs (d2,v2))</td>
</tr>
<tr>
<td colspan="2"><bold>Map_PFC</bold></td>
</tr>
<tr>
<td>1</td>
<td>Extract the information of intensity and median xkj</td>
</tr>
<tr>
<td>2</td>
<td>For cen_ind &#x003D; 0 to lstCenter.length</td>
</tr>
<tr>
<td>3</td>
<td>Calculate <inline-formula id="ieqn-26">
<mml:math id="mml-ieqn-26"><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mi>c</mml:mi></mml:msubsup></mml:math>
</inline-formula></td>
</tr>
<tr>
<td>4</td>
<td>Init (d2,v2): d2 &#x003D; cen_ind; v2 &#x003D; v1</td>
</tr>
<tr>
<td>5</td>
<td>Add (d2,v2) to lstD2V2</td>
</tr>
<tr>
<td>6</td>
<td>return lstD2V2</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3_5">
<label>3.5</label>
<title>Reduce_PFC Procedure</title>
<p><xref ref-type="table" rid="table-3">Tab. 3</xref> presents the algorithm of Reduce_PFC. The purpose of Reduce_PFC is to re-calculate the centers of clusters from the list of objects and the corresponding membership degrees.</p>
<table-wrap id="table-3"><label>Table 3</label>
<caption>
<title>The algorithm of Reduce_PFC</title></caption>
<table><colgroup>
<col/>
<col/>
</colgroup>
<tbody>
<tr>
<td><bold>Input:</bold></td>
<td>cen_ind; list(info(k,j, <inline-formula id="ieqn-27">
<mml:math id="mml-ieqn-27"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup></mml:math>
</inline-formula>, <inline-formula id="ieqn-28">
<mml:math id="mml-ieqn-28"><mml:msubsup><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup></mml:math>
</inline-formula>, <inline-formula id="ieqn-29">
<mml:math id="mml-ieqn-29"><mml:msubsup><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup></mml:math>
</inline-formula>)))</td>
</tr>
<tr>
<td><bold>Output:</bold></td>
<td>Pair (d3,v3)</td>
</tr>
<tr>
<td colspan="2"><bold>Reduce_PFC</bold></td>
</tr>
<tr>
<td>1</td>
<td>Init <inline-formula id="ieqn-30">
<mml:math id="mml-ieqn-30"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula>. The number of elements of <inline-formula id="ieqn-31">
<mml:math id="mml-ieqn-31"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> equals to the dimension of objects xkj</td>
</tr>
<tr>
<td>2</td>
<td>totalM &#x003D; 0</td>
</tr>
<tr>
<td>3</td>
<td>For i, j, k in list((i,j, <inline-formula id="ieqn-33">
<mml:math id="mml-ieqn-33"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03BC;</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msubsup></mml:math>
</inline-formula>, <inline-formula id="ieqn-34">
<mml:math id="mml-ieqn-34"><mml:msubsup><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B7;</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msubsup></mml:math>
</inline-formula>, <inline-formula id="ieqn-35">
<mml:math id="mml-ieqn-35"><mml:msubsup><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03BE;</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msubsup></mml:math>
</inline-formula>)</td>
</tr>
<tr>
<td>3.1</td>
<td>Extract the information of intensity, the positive, the neutral and the negative degrees <inline-formula id="ieqn-36">
<mml:math id="mml-ieqn-36"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup></mml:math>
</inline-formula>, <inline-formula id="ieqn-37">
<mml:math id="mml-ieqn-37"><mml:msubsup><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup></mml:math>
</inline-formula>, <inline-formula id="ieqn-38">
<mml:math id="mml-ieqn-38"><mml:msubsup><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup></mml:math>
</inline-formula></td>
</tr>
<tr>
<td>3.2</td>
<td>Calculate<break/><inline-formula id="ieqn-39">
<mml:math id="mml-ieqn-39"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</inline-formula></td>
</tr>
<tr>
<td>3.3</td>
<td>Compute totalM &#x002B;&#x003D; <inline-formula id="ieqn-40">
<mml:math id="mml-ieqn-40"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:math>
</inline-formula></td>
</tr>
<tr>
<td>4</td>
<td>Divide <inline-formula id="ieqn-41">
<mml:math id="mml-ieqn-41"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> by totalM in order to new clusters centers</td>
</tr>
<tr>
<td>5</td>
<td>d3 &#x003D; <inline-formula id="ieqn-42">
<mml:math id="mml-ieqn-42"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula></td>
</tr>
<tr>
<td>9</td>
<td>v3 &#x003D; list((info(k,j, <inline-formula id="ieqn-44">
<mml:math id="mml-ieqn-44"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03BC;</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msubsup></mml:math>
</inline-formula>))</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3_6">
<label>3.6</label>
<title>Segmentation Result Generation</title>
<p>Based on the results of Reduce_PFC procedure, clustered images can be recovered using the information of position, intensity of cluster centers. Apart from that, the evaluation, analysis, recognition or classification can be performed based on the clustering results.</p>

</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental Results</title>
<sec id="s4_1">
<label>4.1</label>
<title>Data Preparation</title>
<p>In this research, there are two datasets used in experiments, including:<list list-type="bullet"><list-item>
<p>Satellite images extracted from weather image database of NASA [<xref ref-type="bibr" rid="ref-33">33</xref>] in the same place at different points of time. There are 03 datasets with 10 images in each. These images are collected once by 30 minutes in Hawaii, US Pacific Coast and Gulf of Mexico denoted as Data 1, Data 2 and Data 3, respectively. The size of images in this dataset is 500 x 500. Three last images are used to predict.</p></list-item><list-item>
<p>Remote sensing images in Hoa Binh province, Vietnam presented as in <xref ref-type="table" rid="table-4">Tab. 4</xref>.</p></list-item></list></p>
<table-wrap id="table-4"><label>Table 4</label>
<caption>
<title>The input images used in experiments</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th></th>
<th>Image</th>
<th>Type</th>
<th>Size</th>
</tr>
</thead>
<tbody>
<tr>
<td>Image 1</td>
<td><inline-graphic xlink:href="CSSE_24265-inline-1.png"/></td>
<td>Lansat</td>
<td>1596 x 1333</td>
</tr>
<tr>
<td>Image 2</td>
<td><inline-graphic xlink:href="CSSE_24265-inline-2.png"/></td>
<td>Quickbird</td>
<td>2056 x 2065</td>
</tr>
<tr>
<td>Image 3</td>
<td><inline-graphic xlink:href="CSSE_24265-inline-3.png"/></td>
<td>SPOT</td>
<td>2201 x 2101</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In this research, Spark tool is used to install MPFC algorithm by MapReduce model.</p>
<p>The run time of two proposed algorithms is evaluated and compared to that of PFC. Clustering quality is also calculated by using validity indices, including Silhouette Width Criterion (SWC) [<xref ref-type="bibr" rid="ref-33">33</xref>], PBM-index (PBM) [<xref ref-type="bibr" rid="ref-34">34</xref>]. Based on the values of these indices, clustering quality of MPFC is compared to that of MapReduce Fuzzy Clustering (MFC) [<xref ref-type="bibr" rid="ref-35">35</xref>] and PFC.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Evaluation Results</title>
<sec id="s4_2_1">
<label>4.2.1</label>
<title>On Weather Image Dataset</title>
<p>The experimental results of PFC, MFC and MPFC models on weather image dataset are shown in <xref ref-type="table" rid="table-5">Tab. 5</xref> below. In this table, the sign (&#x002B;) denotes that the value of the index higher is the better.</p>
<table-wrap id="table-5"><label>Table 5</label>
<caption>
<title>Values of validity indices of PFC, MFC and MPFC on weather image dataset</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th/>
<th colspan="2">Validity indices</th>
</tr>
<tr>
<th>Methods</th>
<th>PBM&#x002B;</th>
<th>SWC&#x002B;</th>
</tr>
</thead>
<tbody>
<tr>
<td>PFC</td>
<td>65,273,327</td>
<td><bold>0.592</bold></td>
</tr>
<tr>
<td>MFC</td>
<td>56,327,370</td>
<td>0.573</td>
</tr>
<tr>
<td>MPFC</td>
<td><bold>65,273,425</bold></td>
<td><bold>0.592</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As shown in <xref ref-type="table" rid="table-5">Tab. 5</xref>, the values of PBM and SWC obtained by PFC and MPFC are equals. It means that the quality of segmentation by using PFC and MPFC is the same. However, the run time of MPFC is much less than that of PFC.</p>
<p>For the detail, time consuming of two models on weather image dataset is given as in <xref ref-type="table" rid="table-6">Tab. 6</xref>.</p>
<table-wrap id="table-6"><label>Table 6</label>
<caption>
<title>Time consuming of PFC and MPFC on weather image dataset with different number of clusters (seconds)</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th/>
<th colspan="4" align="center">No. of clusters</th>
</tr>
<tr>
<th>Methods</th>
<th>5</th>
<th>7</th>
<th>9</th>
<th>11</th>
</tr>
</thead>
<tbody>
<tr>
<td>PFC</td>
<td>1,824,251</td>
<td>2,234,326</td>
<td>3,032,378</td>
<td>3,982,237</td>
</tr>
<tr>
<td>MPFC</td>
<td>226,326</td>
<td>378,253</td>
<td>463,329</td>
<td>532,377</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In fact, the run time will take longer when the number of clusters increases. From the results in <xref ref-type="table" rid="table-6">Tab. 6</xref>, by applying MapReduce procedure, MPFC is much faster than PFC in all four cases. On average, MPFC takes only 14.50% time consuming of PFC.</p>
</sec>
<sec id="s4_2_2">
<label>4.2.2</label>
<title>On Remote Sensing Images in Hoa Binh Province</title>
<p>The results on remote sensing images in Hoa Binh province are also presented. Fistly, validity indices obtained by applying PFC, MFC and MPFC are calculated and given in <xref ref-type="table" rid="table-7">Tab. 7</xref>. Then, time consuming of PFC and MPFC are compared in <xref ref-type="table" rid="table-8">Tab. 8</xref> below.</p>
<p>As same as on the weather image dataset, in the case of 5 clusters, validity indices of PFC and MPFC are similar. The values in <xref ref-type="table" rid="table-7">Tab. 7</xref> also show that PFC and MPFC are better than MFC on PBM and SWC indices. <xref ref-type="table" rid="table-8">Tab. 8</xref> below shows the run time of PFC and MPFC on this dataset.</p>
<table-wrap id="table-7"><label>Table 7</label>
<caption>
<title>The values of validity indices obtained by applying MFC, PFC and MPFC on images in Hoa Binh province</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th/>
<th/>
<th colspan="2">Validity indices</th>
</tr>
<tr>
<th></th>
<th>Methods</th>
<th>PBM&#x002B;</th>
<th>SWC&#x002B;</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="3">Image 1</td>
<td>PFC</td>
<td>44,657,721</td>
<td><bold>0.5736</bold></td>
</tr>
<tr>
<td>MFC</td>
<td>42,136,233</td>
<td>0.5621</td>
</tr>
<tr>
<td>MPFC</td>
<td><bold>44,657,753</bold></td>
<td>0.5735</td>
</tr>
<tr>
<td rowspan="3">Image 2</td>
<td>PFC</td>
<td><bold>23,273,233</bold></td>
<td><bold>0.6028</bold></td>
</tr>
<tr>
<td>MFC</td>
<td>19,826,388</td>
<td>0.5827</td>
</tr>
<tr>
<td>MPFC</td>
<td>23,273,232</td>
<td>0.6023</td>
</tr>
<tr>
<td rowspan="3">Image 3</td>
<td>PFC</td>
<td><bold>9,452,322</bold></td>
<td><bold>0.6725</bold></td>
</tr>
<tr>
<td>MFC</td>
<td>8,237,632</td>
<td>0.6124</td>
</tr>
<tr>
<td>MPFC</td>
<td>9,452,320</td>
<td><bold>0.6725</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="table-8"><label>Table 8</label>
<caption>
<title>Time consuming of PFC and MPFC on on images in Hoa Binh province using different number of clusters (seconds)</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th></th>
<th colspan="4"  align="center">No. of clusters Methods</th>
</tr>
<tr>
<th></th>
<th>Methods</th>
<th>5</th>
<th>7</th>
<th>9</th>
<th>11</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="2">Image 1</td>
<td>PFC</td>
<td>1,783,364</td>
<td>2,327,362</td>
<td>4,362,327</td>
<td>8,827,237</td>
</tr>
<tr>
<td>MPFC</td>
<td>102,363</td>
<td>373,801</td>
<td>546,327</td>
<td>632,377</td>
</tr>
<tr>
<td rowspan="2">Image 2</td>
<td>PFC</td>
<td>1,728,337</td>
<td>3,363,436</td>
<td>5,938,434</td>
<td>17,347,437</td>
</tr>
<tr>
<td>MPFC</td>
<td>234,327</td>
<td>433,433</td>
<td>843,437</td>
<td>1,272,327</td>
</tr>
<tr>
<td rowspan="2">Image 3</td>
<td>PFC</td>
<td>4,236,327</td>
<td>5,033,437</td>
<td>7,227,372</td>
<td>18,273,237</td>
</tr>
<tr>
<td>MPFC</td>
<td>543,273</td>
<td>921,237</td>
<td>1,392,377</td>
<td>2,387,237</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>By applying MapReduce procedure, the runtime of MPFC is much less than the runtime of PFC. It takes about only 12.74% (on average) of the runtime by using PFC.</p>
<p>Thus, the results of proposed model are better in term of segmentation quality comparing with MFC. Apart from that, time consuming of MPFC is less than that of PFC while the quality is the same.</p>
</sec>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusions and Future Works</title>
<p>In this paper, an improvement of picture fuzzy clustering applying in object detection on remote sensing images is proposed. In this model, picture fuzzy clustering is integrated to MapReduce method. Three main contributions are given in this paper. Firstly, PFC is applied into remote sensing image segmentation problem to increase the segmentation quality. Secondly, an algorithm named as MPFC is proposed. This algorithm uses MapReduce to shorten computation time of PFC while the clustering quality is guaranteed. Apart from that, the formal representation and details of Map_PFC and Reduce_PFC procedures are also given in this paper. Thirdly, the experiments on satellite image and remote sensing image datasets are performed. From the obtained results, the comparison among PFC, MFC and MPFC is given and analyzed using SWC and PBM indices. The experimental results show that the clustering quality of MPFC is higher than PFC and MFC. Moreover, the time consuming of MPFC is aslo much less than the time consuming of PFC.</p>
<p>In this approach, the image data is used to implement the models. Other kinds of data are not mentioned. In further researches, the proposed model will be applied on varouis kinds of data to evaluate the performance. Thus, the most suitable data for this model will be specified. Moreover, other problems on specific dataset will be solved using this model as well.</p>
</sec>
</body>
<back><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> This research is funded by Thuyloi University Foundation for Science and Technology under Grant Number TLU.STF.19-02.</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Ferrari</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Jurie</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Schmid</surname></string-name></person-group>, &#x201C;<article-title>From images to shape models for object detection</article-title>,&#x201D; <source>International Journal of Computer Vision</source>, vol. <volume>87</volume>, no. <issue>3</issue>, pp. <fpage>284</fpage>&#x2013;<lpage>303</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Mohan</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Papageorgiou</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Poggio</surname></string-name></person-group>, &#x201C;<article-title>Example-based object detection in images by components</article-title>,&#x201D; <source>IEEE Transactions on Pattern Analysis And Machine Intelligence</source>, vol. <volume>23</volume>, no. <issue>4</issue>, pp. <fpage>349</fpage>&#x2013;<lpage>361</lpage>, <year>2001</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Yao</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Feng</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Han</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Guo</surname></string-name></person-group>, &#x201C;<article-title>Rotation-invariant latent semantic representation learning for object detection in VHR optical remote sensing images</article-title>,&#x201D; in <conf-name>IGARSS 2019-2019 IEEE Int. Geoscience and Remote Sensing Symp.</conf-name>, <publisher-name>Yokohama, Japan</publisher-name>, pp. <fpage>1382</fpage>&#x2013;<lpage>1385</lpage>, <year>2019</year>. </mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Q.</given-names> <surname>Ming</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Miao</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Song</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Yang</surname></string-name></person-group>, &#x201C;<article-title>Sparse label assignment for oriented object detection in aerial images</article-title>,&#x201D; <source>Remote Sensing</source>, vol. <volume>13</volume>, no. <issue>14</issue>, pp. <fpage>2664</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>&#x0160;evo</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Avramovi&#x0107;</surname></string-name></person-group>, &#x201C;<article-title>Convolutional neural network based automatic object detection on aerial images</article-title>,&#x201D; <source>IEEE Geoscience and Remote Sensing Letters</source>, vol. <volume>13</volume>, no. <issue>5</issue>, pp. <fpage>740</fpage>&#x2013;<lpage>744</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Fu</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Chang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Zhang</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Rotation-aware and multi-scale convolutional neural network for object detection in remote sensing images</article-title>,&#x201D; <source>ISPRS Journal of Photogrammetry and Remote Sensing</source>, vol. <volume>161</volume>, no. <issue>1</issue>, pp. <fpage>294</fpage>&#x2013;<lpage>308</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Xu</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>Multi-level fusion based 3d object detection from monocular images</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, Salt Lake City, UT, USA, pp. <fpage>2345</fpage>&#x2013;<lpage>2353</lpage>, <year>2018</year>. </mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D. H. F.</given-names> <surname>Dijkman</surname></string-name>, <string-name><given-names>R. B.</given-names> <surname>Towal</surname></string-name> and <string-name><given-names>V. S. R.</given-names> <surname>Annapureddy</surname></string-name></person-group>, &#x201C;<article-title>Context-based priors for object detection in images,</article-title><comment>U.S. Patent 10,410,096, Issued September 10, </comment><year>2019</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Sundermeyer</surname></string-name>, <string-name><given-names>Z. C.</given-names> <surname>Marton</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Durner</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Brucker</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Triebel</surname></string-name></person-group>, &#x201C;<article-title>Implicit 3d orientation learning for 6d object detection from rgb images</article-title>,&#x201D; in <conf-name>Proc. of the European Conf. on Computer Vision (ECCV)</conf-name>, Munich, Germany, pp. <fpage>699</fpage>&#x2013;<lpage>715</lpage>, <year>2018</year>. </mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Mariana</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Dr&#x0103;gu&#x0163;</surname></string-name></person-group>, &#x201C;<article-title>Random forest in remote sensing: A review of applications and future directions</article-title>,&#x201D; <source>ISPRS Journal of Photogrammetry and Remote Sensing</source>, vol. <volume>114</volume>, pp. <fpage>24</fpage>&#x2013;<lpage>31</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhu</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Ma</surname></string-name></person-group>, &#x201C;<article-title>Large-scale remote sensing image retrieval by deep hashing neural networks</article-title>,&#x201D; <source>IEEE Transactions on Geoscience and Remote Sensing</source>, vol. <volume>56</volume>, no. <issue>2</issue>, pp. <fpage>950</fpage>&#x2013;<lpage>965</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Long</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Gong</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Xiao</surname></string-name> and <string-name><given-names>Q.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Accurate object localization in remote sensing images based on convolutional neural networks</article-title>,&#x201D; <source>IEEE Transactions on Geoscience and Remote Sensing</source>, vol. <volume>55</volume>, no. <issue>5</issue>, pp. <fpage>2486</fpage>&#x2013;<lpage>2498</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Wan</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Meng</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Han</surname></string-name></person-group>, &#x201C;<article-title>Object detection in optical remote sensing images: A survey and a new benchmark</article-title>,&#x201D; <source>ISPRS Journal of Photogrammetry and Remote Sensing</source>, vol. <volume>159</volume>, pp. <fpage>296</fpage>&#x2013;<lpage>307</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Ren</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Zhu</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Xiao</surname></string-name></person-group>, &#x201C;<article-title>Small object detection in optical remote sensing images via modified faster R-CNN</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>8</volume>, no. <issue>5</issue>, pp. <fpage>813</fpage>&#x2013;<lpage>824</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Bai</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Zhou</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Ren</surname></string-name></person-group>, &#x201C;<article-title>Multiscale visual attention networks for object detection in VHR remote sensing images</article-title>,&#x201D; <source>IEEE Geoscience and Remote Sensing Letters</source>, vol. <volume>16</volume>, no. <issue>2</issue>, pp. <fpage>310</fpage>&#x2013;<lpage>314</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Kavitha</surname></string-name> and <string-name><given-names>P. V.</given-names> <surname>Saraswathi</surname></string-name></person-group>, &#x201C;<article-title>Segmentation for content based satellite image retrieval using fuzzy clustering</article-title>,&#x201D; <source>International Journal of Advanced Science and Technology</source>, vol. <volume>29</volume>, no. <issue>9s</issue>, pp. <fpage>3042</fpage>&#x2013;<lpage>3049</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P. K.</given-names> <surname>Kavitha</surname></string-name> and <string-name><given-names>P. V.</given-names> <surname>Saraswathi</surname></string-name></person-group>, &#x201C;<article-title>Content based satellite image retrieval system using fuzzy clustering</article-title>,&#x201D; <source>Journal of Ambient Intelligence and Humanized Computing</source>, vol. <volume>12</volume>, no. <issue>5</issue>, pp. <fpage>5541</fpage>&#x2013;<lpage>5552</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P. A.</given-names> <surname>Flores-Vidal</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Olaso</surname></string-name>, <string-name><given-names>D.</given-names> <surname>G&#x00F3;mez</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Guada</surname></string-name></person-group>, &#x201C;<article-title>A new edge detection method based on global evaluation using fuzzy clustering</article-title>,&#x201D; <source>Soft Computing</source>, vol. <volume>23</volume>, no. <issue>6</issue>, pp. <fpage>1809</fpage>&#x2013;<lpage>1821</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V. &#x041E;.</given-names> <surname>Gorokhovatskyi</surname></string-name>, <string-name><given-names>I. S.</given-names> <surname>Tvoroshenko</surname></string-name> and <string-name><given-names>N. V.</given-names> <surname>Vlasenko</surname></string-name></person-group>, &#x201C;<article-title>Using fuzzy clustering in structural methods of image classification</article-title>,&#x201D; <source>Telecommunications and Radio Engineering</source>, vol. <volume>79</volume>, no. <issue>9</issue>, pp. <fpage>781</fpage>&#x2013;<lpage>791</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Militello</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Rundo</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Minafra</surname></string-name>, <string-name><given-names>F. P.</given-names> <surname>Cammarata</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Calvaruso</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>MF2C3: Multi-feature fuzzy clustering to enhance cell colony detection in automated clonogenic assay evaluation</article-title>,&#x201D; <source>Symmetry</source>, vol. <volume>12</volume>, no. <issue>5</issue>, pp. <fpage>773</fpage>&#x2013;<lpage>796</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B. C.</given-names> <surname>Cuong</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Kreinovich</surname></string-name></person-group>, &#x201C;<article-title>Picture fuzzy sets</article-title>,&#x201D; <source>Journal of Computer Science and Cybernetics</source>, vol. <volume>30</volume>, no. <issue>4</issue>, pp. <fpage>409</fpage>&#x2013;<lpage>420</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L. H.</given-names> <surname>Son</surname></string-name></person-group>, &#x201C;<article-title>Generalized picture distance measure and applications to picture fuzzy clustering</article-title>,&#x201D; <source>Applied Soft Computing</source>, vol. <volume>46</volume>, no. <issue>4</issue>, pp. <fpage>284</fpage>&#x2013;<lpage>295</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P. H.</given-names> <surname>Thong</surname></string-name></person-group>, &#x201C;<article-title>A novel automatic picture fuzzy clustering method based on particle swarm optimization and picture composite cardinality</article-title>,&#x201D; <source>Knowledge-Based Systems</source>, vol. <volume>109</volume>, no. <issue>3</issue>, pp. <fpage>48</fpage>&#x2013;<lpage>60</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S. A.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>B. S.</given-names> <surname>Harish</surname></string-name> and <string-name><given-names>V. M.</given-names> <surname>Aradhya</surname></string-name></person-group>, &#x201C;<article-title>A picture fuzzy clustering approach for brain tumor segmentation</article-title>,&#x201D; in <conf-name>2016 Second Int. Conf. on Cognitive Computing and Information Processing (CCIP)</conf-name>, <publisher-name>IEEE, Mysuru, India</publisher-name>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2016</year>. </mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Wu</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>Adaptive entropy weighted picture fuzzy clustering algorithm with spatial information for image segmentation</article-title>,&#x201D; <source>Applied Soft Computing</source>, vol. <volume>86</volume>, no. <issue>4</issue>, pp. <fpage>105888</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L. H.</given-names> <surname>Son</surname></string-name> and <string-name><given-names>P. H.</given-names> <surname>Thong</surname></string-name></person-group>, &#x201C;<article-title>Some novel hybrid forecast methods based on picture fuzzy clustering for weather nowcasting from satellite image sequences</article-title>,&#x201D; <source>Applied Intelligence</source>, vol. <volume>46</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Eren</surname></string-name>, <string-name><given-names>U.</given-names> <surname>Yolcu</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Egrioglu</surname></string-name></person-group>, &#x201C;<article-title>Picture fuzzy regression functions approach for financial time series based on ridge regression and genetic algorithm</article-title>,&#x201D; <source>Journal of Computational and Applied Mathematics</source>, vol. <volume>370</volume>, no. <issue>3</issue>, pp. <fpage>112656</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Dai</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Yuan</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Wei</surname></string-name></person-group>, &#x201C;<article-title>TIRNet: Object detection in thermal infrared images for autonomous driving</article-title>,&#x201D; <source>Applied Intelligence</source>, vol. <volume>51</volume>, no. <issue>3</issue>, pp. <fpage>1244</fpage>&#x2013;<lpage>1261</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z. Z.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>X. F.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Zou</surname></string-name>, <string-name><given-names>L. X.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>X. L.</given-names> <surname>Li</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Hierarchical object detection for very high-resolution satellite images</article-title>,&#x201D; <source>Applied Soft Computing</source>, vol. <volume>113</volume>, no. <issue>7</issue>, pp. <fpage>107885</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Nandhini</surname></string-name></person-group>, &#x201C;<article-title>A research on big data analytics security and privacy in cloud, data mining, hadoop and mapreduce</article-title>,&#x201D; <source>Shreyas Satardekar Int. Journal of Engineering Research and Application</source>, vol. <volume>8</volume>, no. <issue>Issue4 (Part -III)</issue>, pp. <fpage>65</fpage>&#x2013;<lpage>78</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Jeffrey</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Ghemawat</surname></string-name></person-group>, &#x201C;<article-title>MapReduce: Simplified data processing on large clusters</article-title>,&#x201D; <source>Communications of the ACM</source>, vol. <volume>51</volume>, no. <issue>1</issue>, pp. <fpage>107</fpage>&#x2013;<lpage>113</lpage>, <year>2008</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B. P.</given-names> <surname>Shukla</surname></string-name>, <string-name><given-names>C. M.</given-names> <surname>Kishtawal</surname></string-name> and <string-name><given-names>P. K.</given-names> <surname>Pal</surname></string-name></person-group>, &#x201C;<article-title>Prediction of satellite image sequence for weather nowcasting using cluster-based spatiotemporal regression</article-title>,&#x201D; <source>IEEE Transactions on Geoscience and Remote Sensing</source>, vol. <volume>52</volume>, no. <issue>7</issue>, pp. <fpage>4155</fpage>&#x2013;<lpage>4160</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Vendramin</surname></string-name>, <string-name><given-names>R. J.</given-names> <surname>Campello</surname></string-name> and <string-name><given-names>E. R.</given-names> <surname>Hruschka</surname></string-name></person-group>, &#x201C;<article-title>Relative clustering validity criteria: A comparative overview</article-title>,&#x201D; <source>Statistical Analysis and Data Mining: The ASA Data Science Journal</source>, vol. <volume>3</volume>, no. <issue>4</issue>, pp. <fpage>209</fpage>&#x2013;<lpage>235</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. K.</given-names> <surname>Pakhira</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Bandyopadhyay</surname></string-name> and <string-name><given-names>U.</given-names> <surname>Maulik</surname></string-name></person-group>, &#x201C;<article-title>Validity index for crisp and fuzzy clusters</article-title>,&#x201D; <source>Pattern Recognition</source>, vol. <volume>37</volume>, no. <issue>3</issue>, pp. <fpage>487</fpage>&#x2013;<lpage>501</lpage>, <year>2004</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. A.</given-names> <surname>Ludwig</surname></string-name></person-group>, &#x201C;<article-title>MapReduce-based fuzzy c-means clustering algorithm: Implementation and scalability</article-title>,&#x201D; <source>International Journal of Machine Learning and Cybernetics</source>, vol. <volume>6</volume>, no. <issue>6</issue>, pp. <fpage>923</fpage>&#x2013;<lpage>934</lpage>, <year>2015</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>