Mobile agent-based frequent pattern mining for distributed databases

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In today’s world of globalization, business organizations produce information from many branch offices of their business while operating across the globe and hence lead to large chunk of distributed databases. There is an innate need to look at this distributed information that leverages the past, monitors the present, and predicts the future with accuracy. Mining large distributed databases using client–server model is time-consuming and sometimes impractical because it requires huge databases to be transferred over very long distances. Mobile agent technology is a promising alternative that addresses the issues of client–server computing model. In this paper, we have proposed an algorithm called MADFPM for frequent pattern mining of distributed databases that use mobile agents. We have shown that the performance of MADFPM is better compared to the conventional client–server approach.

Cite

CITATION STYLE

APA

Joshi, Y., Totad, S. G., Geeta, R. B., & Prasad Reddy, P. V. G. D. (2018). Mobile agent-based frequent pattern mining for distributed databases. In Advances in Intelligent Systems and Computing (Vol. 673, pp. 77–85). Springer Verlag. https://doi.org/10.1007/978-981-10-7245-1_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free