Search

In this paper, we systematically explore an itemset-based extension approach for generating candidate sequence which contributes to a better and more straightforward search space traversal performance than traditional item-based extension approach. Based on this candidate generation approach, we present FINDER, a novel algorithm for discovering the set of all frequent sequences. FINDER is composed of two separated steps. In the first step, all frequent itemsets are discovered and we can get great benefit from existing efficient itemset mining algorithms. In the second step, all frequent sequences with at least two frequent itemsets are detected by combining depth-first search and itemset-based extension candidate generation together. A vertical bitmap data representation is adopted for rapidly support counting reason. Several pruning strategies are used to reduce the search space and minimize cost of computation. An extensive set of experiments demonstrate the effectiveness and the linear scalability of proposed algorithm. [ABSTRACT FROM AUTHOR]

The communication between agents has some special requirements. One of them is asynchronous communication. Used communication sequence process (CSP) to descript a model of agents communication with shared buffer channel. The essence of this model is very suitable for the multi-agents communication, so it is a base for our next step job. Based on the communication model, explored the distributed tasks dealing method among joint intention agents and with description of relation between tasks we give a figure of agents' organization. Agents communicate with each other in this kind of organization. The semantics of agent communication is another emphasis in this paper. With the detailed description of agents' communication process, given a general agent automated negotiation protocol based on speech act theory in MAS, then we use CSP to verify this protocol has properties of safety and liveness, so prove it is logic right. At last a frame of this protocol's realization was given. [ABSTRACT FROM AUTHOR]