<?xml version="1.0" encoding="UTF-8"?>
<item xmlns="http://omeka.org/schemas/omeka-xml/v5" itemId="16384" public="1" featured="0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://omeka.org/schemas/omeka-xml/v5 http://omeka.org/schemas/omeka-xml/v5/omeka-xml-5-0.xsd" uri="https://archives.christuniversity.in/items/show/16384?output=omeka-xml" accessDate="2026-05-01T08:18:01+00:00">
  <collection collectionId="5">
    <elementSetContainer>
      <elementSet elementSetId="1">
        <name>Dublin Core</name>
        <description>The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/.</description>
        <elementContainer>
          <element elementId="50">
            <name>Title</name>
            <description>A name given to the resource</description>
            <elementTextContainer>
              <elementText elementTextId="64">
                <text>Articles</text>
              </elementText>
            </elementTextContainer>
          </element>
        </elementContainer>
      </elementSet>
    </elementSetContainer>
  </collection>
  <itemType itemTypeId="19">
    <name>Article</name>
    <description>Faculty Publications -Articles</description>
  </itemType>
  <elementSetContainer>
    <elementSet elementSetId="1">
      <name>Dublin Core</name>
      <description>The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/.</description>
      <elementContainer>
        <element elementId="50">
          <name>Title</name>
          <description>A name given to the resource</description>
          <elementTextContainer>
            <elementText elementTextId="126046">
              <text>Novel quantum inspired approaches for automatic clustering of gray level images using Particle Swarm Optimization, Spider Monkey Optimization and Ageist Spider Monkey Optimization algorithms</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="49">
          <name>Subject</name>
          <description>The topic of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="126047">
              <text>Ageist spider monkey; Automatic clustering; Cluster validity indices; Friedman test; Meta-heuristic algorithms; Particle swarm optimization; Quantum computing; Spider monkey; t-test</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="41">
          <name>Description</name>
          <description>An account of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="126048">
              <text>This paper is intended to identify the optimal number of clusters automatically from an image dataset using some quantum behaved nature inspired meta-heuristic algorithms. Due to the lack of sufficient information, it is difficult to identify the appropriate number of clusters from a dataset, which has enthused the researchers to solve the problem of automatic clustering and to open up a new era of cluster analysis with the help of several natures inspired meta-heuristic algorithms. In this paper, three quantum inspired meta-heuristic techniques, viz., Quantum Inspired Particle Swarm Optimization (QIPSO), Quantum Inspired Spider Monkey Optimization (QISMO) and Quantum Inspired Ageist Spider Monkey Optimization (QIASMO), have been proposed. A comparison has been outlined between the quantum inspired algorithms with their corresponding classical counterparts. The efficiency of the quantum inspired algorithms has been established over their corresponding classical counterparts with regards to fitness, mean, standard deviation, standard errors of fitness, convergence curves (for benchmarked mathematical functions) and computational time. Finally, the results of two statistical superiority tests, viz., t- test and Friedman test have been provided to prove the superiority of the proposed methods. The superiority of the proposed methods has been established on five publicly available real life image datasets, five Berkeley image datasets of different dimensions and four benchmark mathematical functions both visually and quantitatively.  2019 Elsevier B.V.</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="39">
          <name>Creator</name>
          <description>An entity primarily responsible for making the resource</description>
          <elementTextContainer>
            <elementText elementTextId="126049">
              <text>Dey A.; Dey S.; Bhattacharyya S.; Platos J.; Snasel V.</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="48">
          <name>Source</name>
          <description>A related resource from which the described resource is derived</description>
          <elementTextContainer>
            <elementText elementTextId="126050">
              <text>Applied Soft Computing Journal, Vol-88</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="45">
          <name>Publisher</name>
          <description>An entity responsible for making the resource available</description>
          <elementTextContainer>
            <elementText elementTextId="126051">
              <text>Elsevier Ltd</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="40">
          <name>Date</name>
          <description>A point or period of time associated with an event in the lifecycle of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="126052">
              <text>2020-01-01</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="43">
          <name>Identifier</name>
          <description>An unambiguous reference to the resource within a given context</description>
          <elementTextContainer>
            <elementText elementTextId="126053">
              <text>&lt;a href="https://doi.org/10.1016/j.asoc.2019.106040" target="_blank" rel="noreferrer noopener"&gt;https://doi.org/10.1016/j.asoc.2019.106040&lt;/a&gt;
&lt;br /&gt;&lt;br /&gt;&lt;a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85077094785&amp;amp;doi=10.1016%2Fj.asoc.2019.106040&amp;amp;partnerID=40&amp;amp;md5=a243213c57e94ab264a49c4107a9659c" target="_blank" rel="noreferrer noopener"&gt;https://www.scopus.com/inward/record.uri?eid=2-s2.0-85077094785&amp;amp;doi=10.1016%2fj.asoc.2019.106040&amp;amp;partnerID=40&amp;amp;md5=a243213c57e94ab264a49c4107a9659c&lt;/a&gt;</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="47">
          <name>Rights</name>
          <description>Information about rights held in and over the resource</description>
          <elementTextContainer>
            <elementText elementTextId="126054">
              <text>Restricted Access</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="46">
          <name>Relation</name>
          <description>A related resource</description>
          <elementTextContainer>
            <elementText elementTextId="126055">
              <text>ISSN: 15684946</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="42">
          <name>Format</name>
          <description>The file format, physical medium, or dimensions of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="126056">
              <text>Online</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="44">
          <name>Language</name>
          <description>A language of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="126057">
              <text>English</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="51">
          <name>Type</name>
          <description>The nature or genre of the resource</description>
          <elementTextContainer>
            <elementText elementTextId="126058">
              <text>Article</text>
            </elementText>
          </elementTextContainer>
        </element>
        <element elementId="38">
          <name>Coverage</name>
          <description>The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant</description>
          <elementTextContainer>
            <elementText elementTextId="126059">
              <text>Dey A., Department of Computer Science and Engineering, RCC Institute of Information Technology, Kolkata, India; Dey S., Department of Computer Science, Sukanta Mahavidyalaya, Dhupguri, Jalpaiguri, India; Bhattacharyya S., Department of Computer Science and Engineering, Christ University, Bangalore, India, Faculty of Electrical Engineering and Computer Science, VSB Technical University of Ostrava, Czech Republic; Platos J., Faculty of Electrical Engineering and Computer Science, VSB Technical University of Ostrava, Czech Republic; Snasel V., Faculty of Electrical Engineering and Computer Science, VSB Technical University of Ostrava, Czech Republic</text>
            </elementText>
          </elementTextContainer>
        </element>
      </elementContainer>
    </elementSet>
  </elementSetContainer>
</item>
