{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T04:24:51Z","timestamp":1741839891170,"version":"3.38.0"},"reference-count":25,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4,1]]},"abstract":"<p>In this paper, the authors propose a new approach for topological hierarchical tree clustering inspired from the self-assembly behavior of artificial ants. The method, called SoTree (Self-organizing Tree), builds, autonomously and simultaneously, a topological and hierarchical partitioning of data. Each \u2019\u2019cluster\u2019\u2019 associated to one cell of a 2D grid is modeled by a tree. The artificial ants similarly build a tree where each ant represents a node\/data. The benefit of this approach is the intuitive representation of hierarchical relations in the data. This is especially appealing in explorative data mining applications, allowing the inherent structure of the data to unfold in a highly intuitive fashion.<\/p>","DOI":"10.4018\/jitr.2011040101","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T15:24:13Z","timestamp":1319037853000},"page":"1-16","source":"Crossref","is-referenced-by-count":2,"title":["Self-Organizing Tree Using Artificial Ants"],"prefix":"10.4018","volume":"4","author":[{"given":"Hanene","family":"Azzag","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris 13, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustapha","family":"Lebbah","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris 13, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2432","reference":[{"key":"jitr.2011040101-0","doi-asserted-by":"crossref","unstructured":"Abraham, A., & Ramos, V. (2003, December 8-12). Web usage mining using artificial ant colony clustering and linear genetic programming. In Proceedings of the IEEE Conference on Evolutionary Computation, Canberra, Australia (pp. 1384-1391). Washington, DC: IEEE Computer Society.","DOI":"10.1109\/CEC.2003.1299832"},{"key":"jitr.2011040101-1","doi-asserted-by":"publisher","DOI":"10.1007\/s00040-002-8286-y"},{"key":"jitr.2011040101-2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.03.062"},{"key":"jitr.2011040101-3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-34956-3_7"},{"key":"jitr.2011040101-4","unstructured":"Azzag, H., Monmarch\u00e9, H., Slimane, M., Venturini, G., & Guinot, C. (2003, December 8-12). Anttree: a new model for clustering with artificial ants. In Proceedings of the IEEE Conference on Evolutionary Computation, Canberra, Australia. Washington, DC: IEEE Computer Society."},{"key":"jitr.2011040101-5","unstructured":"Blake, C. L., & Merz, C. L. (1998). Uci repository of machine learning databases. Irvine, CA: Department of Information and Computer Science, University of California. Retrieved from ftp:\/\/ftp.ics.uci.edu\/pub\/machine-learning-databases"},{"key":"jitr.2011040101-6","unstructured":"Carey, M., Heesch, D., & Roger, S. (2003) Info navigator: A visualization tool for document searching and browsing. In Proceedings of the 9th International Conference on Distributed Multimedia Systems (DMS\u20192003)."},{"key":"jitr.2011040101-7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1979.4766909"},{"key":"jitr.2011040101-8","unstructured":"Deneubourg, J.-L., Goss, S., Franks, N. R., Sendova-Franks, A., Detrain, C., & Chretien, L. (1990). The dynamics of collective sorting: robot-like ant and ant-like robots. In Proceedings of the First International Conference on Simulation of Adaptive Behavior (pp. 356-365)."},{"key":"jitr.2011040101-9","unstructured":"Goss, S., & Deneubourg, J.-L. (1991). Harvesting by a group of robots. In F. Varela & P. Bourgine (Eds.), Proceedings of the First European Conference on Artificial Life, Paris, France (pp. 195-204). Amsterdam, The Netherlands: Elsevier Publishing."},{"key":"jitr.2011040101-10","unstructured":"Handl, J., Knowles, J., & Dorigo, M. (2003). On the performance of ant-based clustering. In Proceedings of the 3rd International Conference on Hybrid Intelligent Systems (pp. 204-213)."},{"journal-title":"Algorithms for Clustering Data","year":"1988","author":"A. K.Jain","key":"jitr.2011040101-11"},{"key":"jitr.2011040101-12","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"jitr.2011040101-13","doi-asserted-by":"crossref","unstructured":"Johnson, B., & Shneiderman, B. (1991). Tree-maps: A space-filling approach to the visualization of hierarchical information structures. In Proceedings of the Visualization 1991 Conference, San Diego, CA (pp. 284-291).","DOI":"10.1109\/VISUAL.1991.175815"},{"key":"jitr.2011040101-14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56927-2","author":"T.Kohonen","year":"2001","journal-title":"Self-organizing Maps"},{"key":"jitr.2011040101-15","unstructured":"Kuntz, P., Layzell, P., & Snyers, D. (1997). A colony of ant-like agents for partitioning in VLSI technology. In P. Husbands & I. Harvey (Eds.), Proceedings of the Fourth European Conference on Artificial Life (pp. 417-424)."},{"key":"jitr.2011040101-16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009665701840"},{"key":"jitr.2011040101-17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012283403138"},{"key":"jitr.2011040101-18","unstructured":"Lumer, E. D., & Faieta, B. (1994). Diversity and adaptation in populations of clustering ants. In D. Cliff, P. Husbands, J. A. Meyer, &n W. Stewart (Eds.), Proceedings of the Third International Conference on Simulation of Adaptive Behavior (pp. 501-508). Cambridge, MA: MIT Press."},{"key":"jitr.2011040101-19","doi-asserted-by":"crossref","unstructured":"Robertson, G. G., Mackinlay, J. D., & Card, S. K. (1991). Cone trees: animated 3d visualizations of hierarchical information. In CHI \u201991: Proceedings of the SIGCHI Conference on Human factors in computing systems (pp. 189-194). New York, NY: ACM Press.","DOI":"10.1145\/108844.108883"},{"key":"jitr.2011040101-20","unstructured":"Saporta, G., & Youness, G. (2001). Concordance e-ntre deux partitions: quelques propositions et exp\u00e9riences. In Proceedings of the Actes des 8es rencontres de la SFC, Pointe-\u00e0-Pitre, Guadeloupe."},{"key":"jitr.2011040101-21","doi-asserted-by":"publisher","DOI":"10.1145\/102377.115768"},{"key":"jitr.2011040101-22","doi-asserted-by":"publisher","DOI":"10.1006\/bulm.2001.0260"},{"key":"jitr.2011040101-23","doi-asserted-by":"crossref","unstructured":"Venturini, G., Labroche, N., & Guinot, C. (2004). Fast unsupervised clustering with artificial ants. In Proceedings of the Parallel Problem Solving from Nature (PPSN VIII) Conference, Birmingham, UK (pp. 1143-1152).","DOI":"10.1007\/978-3-540-30217-9_115"},{"key":"jitr.2011040101-24","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., & Livny, M. (1996). BIRCH: an efficient data clustering method for very large databases. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data (pp. 103-114). New York, NY: ACM.","DOI":"10.1145\/235968.233324"}],"container-title":["Journal of Information Technology Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=52814","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T02:39:40Z","timestamp":1741833580000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jitr.2011040101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,4,1]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jitr.2011040101","relation":{},"ISSN":["1938-7857","1938-7865"],"issn-type":[{"type":"print","value":"1938-7857"},{"type":"electronic","value":"1938-7865"}],"subject":[],"published":{"date-parts":[[2011,4,1]]}}}