| Popis: |
From the earliest studies in graph theory, the phenomenon of transitivity has been used to design and analyze problems that can be mapped onto graphs. Some of the practical examples of this phenomenon are the “Transitive Closure”algorithm, the multiplication of Boolean matrices, the determination of communicating states in Markov chains, and so on. The use of transitivity, however, to catalyze the partitioning problems is, to our knowledge, unreported, and it is by no means trivial considering the pairwise occurrences of the queries in the query stream. This paper pioneers such a mechanism. In particular, we consider the object migrating automaton (OMA) that has been used for decades to solve the Equi-Partitioning Problem where W objects are placed in R partitions of equal sizes so that objects accessed together fall in to the same partition. The OMA, which encountered certain deadlock configurations, was enhanced by Gale et al. to yield the enhanced OMA (EOMA). Both the OMA and the EOMA were significantly improved by incorporating into them, the recently-introduced “Pursuit”phenomenon from the field of learning automata (LA). In this paper1, we shall show that the Pursuit matrix that consists of the estimates of the probabilities of the pairs presented to the LA, possesses the property of transitivity akin to the property found in graph-related problems. By making use of this observation, transitive-closure-like arguments can be made to invoke reward and penalty operations on the Pursuit OMA and the PEOMA. This implies that objects can be moved toward their correct partitions even when the system is dormant, i.e., when the environment does not present any queries or partitioning information to the learning algorithm. The results that we present demonstrate that the newly designed transitive-based algorithms are about 20% faster than their non-transitive versions. As far as we know, these are the fastest partitioning algorithms to-date. |
