{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:24:05Z","timestamp":1777645445975,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2009,10]]},"abstract":"<jats:p>The problem considered in this article is how to detect and measure\n\t\t\t resemblances between swarm behaviours. The solution to this problem stems from\n\t\t\t an extension of recent work on tolerance near sets and image correspondence.\n\t\t\t Instead of considering feature extraction from subimages in digital images, we\n\t\t\t compare swarm behaviours by considering feature extraction from subsets of\n\t\t\t tuples of feature-values representing the behaviour of observed swarms of\n\t\t\t organisms. Thanks to recent work on the foundations of near sets, it is\n\t\t\t possible to formulate a rigorous approach to measuring the extent that swarm\n\t\t\t behaviours resemble each other. Fundamental to this approach is what is known\n\t\t\t as a recent description-based set intersection, a set containing objects with\n\t\t\t matching or almost the same descriptions extracted from objects contained in\n\t\t\t pairs of disjoint sets. Implicit in this work is a new approach to comparing\n\t\t\t information tables representing N. Tinbergen's ethology (study of\n\t\t\t animal behaviour) and direct result of recent work on what is known as rough\n\t\t\t ethology. Included in this article is a comparison of recent nearness measures \n\t\t\t that includes a new form of F. Hausdorff's distance measure. The\n\t\t\t contribution of this article is a tolerance near set approach to measuring the\n\t\t\t degree of resemblance between swarm behaviours.<\/jats:p>","DOI":"10.3233\/fi-2009-163","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T22:57:46Z","timestamp":1575327466000},"page":"533-552","source":"Crossref","is-referenced-by-count":5,"title":["Measuring Resemblances Between Swarm Behaviours: A Perceptual\t\t\t Tolerance Near Set Approach"],"prefix":"10.1177","volume":"95","author":[{"given":"Sheela","family":"Ramanna","sequence":"first","affiliation":[{"name":"Department of Applied Computer Science, University of\r\t\t\t Winnipeg Winnipeg, Manitoba R3B 2E9 Canada. E-mail: s.ramanna@uwinnipeg.ca"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir H.","family":"Meghdadi","sequence":"additional","affiliation":[{"name":"Computational Intelligence Laboratory Department of\r\t\t\t Electrical and Computer Engineering, University of Manitoba Winnipeg, Manitoba\r\t\t\t R3T 5V6 Canada. E-mail: meghdadi@ee.umanitoba.ca"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2009,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-163","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-163","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:15Z","timestamp":1777444335000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2009-163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["10.3233\/FI-2009-163"],"URL":"https:\/\/doi.org\/10.3233\/fi-2009-163","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}