• DocumentCode
    2147582
  • Title

    Priority based pheromone algorithm for image cluster

  • Author

    Karthikeyan, T. ; Balakrishnan, Ranjith ; Kumar, U.K.

  • Author_Institution
    Dept. of Comput. Sci., PSG Coll. of Arts & Sci., Coimbatore, India
  • fYear
    2012
  • fDate
    30-31 March 2012
  • Firstpage
    230
  • Lastpage
    239
  • Abstract
    Clustering task aims at the unsupervised classification of patterns in different groups. Clustering problem has been approached from different disciplines. Many Swarm Intelligence algorithms have been developed to solve numerical and combinatorial problems. Clustering with swarm-based algorithms especially Ant colony algorithm is have been shown better results in a variety of real world application. This paper introduces a new algorithm called Priority Based Pheromone Algorithm (PBPA) belongs to Ant colony System to give better optimal solution for clustering. Concept of this algorithm is to build clusters using three potential values priority value, pheromone and heuristic information. This algorithm is compared with normal Ant colony algorithm, Genetic Algorithm and basic K-means algorithm. Comparison is done by percentage of errors, best fitness (time efficiency) and maximum number of iterations. As compared with above said algorithms, proposed method shows better results.
  • Keywords
    ant colony optimisation; genetic algorithms; image processing; pattern clustering; K-means algorithm; PBPA; ant colony algorithm; clustering problem; genetic algorithm; image cluster; priority based pheromone algorithm; swarm Intelligence algorithms; unsupervised classification; Art; Clustering algorithms; Databases; Feature extraction; Organisms; Search problems; Software; Ant Colony Algorithm; Clustering; Data Mining; Image data set; Swarm Intelligence;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Emerging Trends and Applications in Computer Science (NCETACS), 2012 3rd National Conference on
  • Conference_Location
    Shillong
  • Print_ISBN
    978-1-4577-0749-0
  • Type

    conf

  • DOI
    10.1109/NCETACS.2012.6203331
  • Filename
    6203331