Skip to main content
SpringerLink
Log in
Book cover

International Conference on Natural Computation

ICNC 2005: Advances in Natural Computation pp 1218–1228Cite as

A Novel Ant Clustering Algorithm with Digraph

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3611))

Abstract

A novel adaptive ant colony clustering algorithm based on digraph (A3CD) is presented. Inspired by the swarm intelligence shown through the social insects’ self-organizing behavior, in A3CD we assign acceptance weights on the directed edges of a pheromone digraph. The weights of the digraph is adaptively updated by the pheromone left by ants in the seeking process. Finally, strong connected components are extracted as clusters under a certain threshold. A3CD has been implemented and tested on several clustering benchmarks and real datasets to compare the performance with the classical K-means clustering algorithm and LF algorithm which is also based on ACO. Experimental results show that our algorithm is easier to implement, more efficient and performs faster and has better clustering quality than other methods.

Supported in part by the National Natural Science Foundation under grant No. 60473012, Science Foundation of Educational Commission Jiangsu Province.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kaufman, L., Pierreux, A., Rousseuw, P., Derde, M.P., Detaecernier, M.R., Massart, D.L., Platbrood, G.: Clustering on a Microcomputer with an Application to the Classification of Coals. Analytica Chimica Acta 153, 257–260 (1983)

    Article  Google Scholar 

  2. Lawson, R.G., Jurs, P.C.: Cluster Analysis of Acrylates to Guide Sampling for Toxicity Testing. Journal of Chemical Information and Computer Science 30(1), 137–144 (1990)

    Google Scholar 

  3. Beckers, M.L.M., Melssen, W.J., Buydens, L.M.C.: A self-organizing feature map for clustering nucleic acids. Application to a data matrix containing A-DNA and B-DNA di-nucleotides. Comput. Chem. 21, 377–390 (1997)

    Google Scholar 

  4. Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann Publishers, San Francisco CA (2001)

    Google Scholar 

  5. Bonabeau, E., Dorigo, M., Théraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Santa Fe Institute in the Sciences of the Complexity. Oxford University Press, Oxford New York (1999)

    Google Scholar 

  6. Dorigo, M., Maniezzo, V., Colomi, A.: Ant system:Optimization by a colony of coorperating agents. IEEE Transactions on Systems, Man and Cybernetics-Part B 26(1), 29–41 (1996)

    Article  Google Scholar 

  7. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. on Evolutionary Computation 1(1), 53–66 (1997)

    Article  Google Scholar 

  8. Stutzle, T., Hoos, H.: MAX-MIN Ant systems. Future Generation Computer Sytems 16, 889–914 (2000)

    Article  Google Scholar 

  9. Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. BioSystems 43(2), 73–81 (1997)

    Article  Google Scholar 

  10. Chang, C.S., Tian, L., Wen, F.S.: A new approach to fault section in power systems using Ant System. Electric Power Systems Research 49(1), 63–70 (1999)

    Article  Google Scholar 

  11. Gambardella, L.M., Dorigo, M.: HAS-SOP: An Hybrid Ant System for the Sequential Ordering Problem. Tech. Rep. No. IDSIA 97-11, IDSIA, Lugano Switzerland (1997)

    Google Scholar 

  12. Colorni, A., Dorigo, M., Maniezzo, V.: Ant colony system for job-shop scheduling. Belgian J. of Operations Research Statistics and Computer Science 34(1), 39–53 (1994)

    MATH  Google Scholar 

  13. Bonabeau, E., Sobkowski, A., Théraulaz, G., Denebourg, J.L.: Adaptive Task Allocation Inspired by a Model of Division of Labor in Social Insects. In: Lundh, D., et al. (eds.) Biocomputing and Emergent Computation: Proceedings of BCEC 1997, pp. 36–45 (1997)

    Google Scholar 

  14. Maniezzo, V.: Exact and approximate nonditerministic tree search procedures for the quaratic assignment problem. INFORMS J. Comput. 11, 358–369 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  15. Maniezzo, V., Carbonaro, A.: An ANTS heuristic for the frequency assignment problem. Future Generation Computer Systems 16, 927–935 (2000)

    Article  Google Scholar 

  16. Di Caro, G., Dorigo, M.: Distributed Reinforcement Agents for Adaptive Routing in Communication Networks. In: Third European Workshop on Reinforcement Learning, Rennes (F), October 13–14 (1997)

    Google Scholar 

  17. Schoonderwoerd, R., Holland, O., Bruten, J.: Ant-like agents for load balancing in telecommunications networks. In: Proc. of Agents 1997, pp. 209–216. ACM Press, Marina del Rey (1997)

    Google Scholar 

  18. Costa, D., Hertz, A.: Ants can colour graphs. J. of the Opnl. Res. Soc. 48(3), 295–305 (1997)

    MATH  Google Scholar 

  19. Holland, O.E., Melhuish, C.: Stigmergy, self-organization, and sorting in collective robotics. Artificial Life 5, 173–202 (1999)

    Article  Google Scholar 

  20. Kuntz, P., Layzell, P., Snyder, D.: A colony of ant-like agents for partitioning in VLSI technology. In: Husbands, P., Harvey, I. (eds.) Proceedings of the Fourth European Conference on Artificial Life, pp. 412–424. MIT Press, Cambridge (1997)

    Google Scholar 

  21. Kuntz, P., Snyder, D.: New results on ant-based heuristic for highlighting the organization of large graphs. In: Proceedings of the 1999 Congress or Evolutionary Computation, pp. 1451–1458. IEEE Press, Piscataway (1999)

    Google Scholar 

  22. Deneubourg, J.L., Goss, S., Franks, N., Sendova-Franks, A., Detrain, C., Chretien, L.: The Dynamic of Collective Sorting Robot-like Ants and Ant-like Robots. In: Meyer, J.A., Wilson, S.W. (eds.) SAB 1990-1st Conf. on Simulation of Adaptive Behavior: From Animals to Animats, pp. 356–365. MIT press, Cambridge (1991)

    Google Scholar 

  23. Lumer, E., Faieta, B.: Diversity and adaptation in populations of clustering ants. In: Meyer, J.A., Wilson, S.W. (eds.) Proceedings of the Third International Conference on Simulation of Adaptive Behavior: From Animates, vol. 3, pp. 501–508. MIT Press/ Bradford Books, Cambridge (1994)

    Google Scholar 

  24. Kuntz, P., Snyers, D., Layzell, P.: A stochastic heuristic for visualizing graph clusters in a bi-dimensional space prior to partitioning. Journal of Heuristics 5, 327–351 (1999)

    Article  MATH  Google Scholar 

  25. Kuntz, P., Layzell, P., Snyder, D.: A colony of ant-like agents for partitioning in VLSI technology. In: Husbands, P., Harvey, I. (eds.) Proceedings of the Fourth European Conference on Artificial Life, pp. 412–424. MIT Press, Cambridge (1997)

    Google Scholar 

  26. Kuntz, P., Snyder, D.: New results on ant-based heuristic for highlighting the organization of large graphs. In: Proceedings of the 1999 Congress or Evolutionary Computation, pp. 1451–1458. IEEE Press, Piscataway (1999)

    Google Scholar 

  27. Handl, J., Meyer, B.: Improved ant-based clustering and sorting in a document retrievalinterface. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, p. 913. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yangzhou University, Yangzhou, 225009, China

    Ling Chen, Li Tu & Hongjian Chen

  2. National Key Lab of Novel Software Tech, Nanjing University, Nanjing, 210093, China

    Ling Chen

Authors
  1. Ling Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Tu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hongjian Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electrical and Electronic Engineering, Nanyang Technological University, Block S1, Nanyang Avenue, 639798, Singapore

    Lipo Wang

  2. School of Software, Sun Yat-Sen University, 510275, Guangzhou, China

    Ke Chen

  3. School of Computer Engineering, Nanyang Technological University, BLK N4, 2b-39, Nanyang Avenue, 639798, Singapore

    Yew Soon Ong

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, L., Tu, L., Chen, H. (2005). A Novel Ant Clustering Algorithm with Digraph. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539117_163

Download citation

  • DOI: https://doi.org/10.1007/11539117_163

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28325-6

  • Online ISBN: 978-3-540-31858-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation