Agent mining approaches: an ontological view

Introduced as an interdisciplinary area that combines multi-agent systems, data mining and knowledge discovery, agent mining is currently in practice. To develop agent mining applications involves a combination of different approaches (model, architecture, technique and so on) from software agent and data mining (DM) areas. This paper presents an investigation of the approaches used in the agent mining systems by deeply analyzing 121 papers resulting from a systematic literature review. An ontology was defined to capitalize the knowledge collected from this study. The ontology is organized according to seven main facets: the problem addressed, the application domain, the agent-related and the mining-related elements, the models, processes and algorithms. This ontology is aimed at providing support to decisions about agent mining application design.

Efficient Mining Recurring Patterns of Inter-Transaction in Time Series

One type of the partial periodic pattern is known as recurring patterns, which exhibit cyclic repetitions only for particular time period within a series. A key property of the patterns is the event can start, stop, and restart at anytime within a series. Therefore, the extracted meaningful knowledge from the patterns is challenging because the information can vary across patterns. The mining technique in recurring patterns plays an important role for discovering knowledge pertaining to seasonal or temporal associations between events. Most existing researches focus on discovering the recurring patterns in transaction. However, these researches for mining recurring patterns cannot discover recurring events across multiple transactions (inter-transaction) which often appears in many real-world applications such as the stock exchange market, social network, etc. In this study, the proposed algorithm, namely, CP-growth can efficiently perform in discovering the recurring patterns within inter-transaction. Besides, an efficient pruning technique to reduce the computational cost of discovering recurring patterns is developed in CP-growth algorithm. Experimental results show that recurring patterns can be useful in multiple transactions and the proposed algorithm, namely, CP-growth is efficient.