Fast Memory Access in Data Streams Using Pagerank Algorithm

Authors

  • R. Ramya  Computer Science Department, IFET College of Engineering, Villupuram, Tamil Nadu , India

Keywords:

MiLOF, LOF, pageRank, DSMS

Abstract

The memory efficient incremental local outlier (MiLOF) detection algorithm is used in data streams, and it is more flexible algorithm ,and Incremental LOF is used within a static reminiscence bound its similar to(MiLOF).By using the pageRank algorithm the content is reduced in data stream according to the sentence or word. The proposed algorithm have better memory and time complexity than memory efficient incremental local outlier (MiLOF).In addition, we show that PageRank algorithm is dynamic to changes in the number of data points, the number of essential clusters and the number of dimensions in the data stream.

References

  1. S. Sadik and L. Gruenwald, "Research issues in outlier detection for data streams," ACM SIGKDD Explorations Newsletter, vol. 15, no. 1, pp. 33–40, 2014.
  2. D. Pokrajac, A. Lazarevic, and L. J. Latecki, "Incremental local outlier detection for data streams," in Computational Intelligence and Data Mining, 2007, pp. 504–515.
  3. M. Salehi, C. Leckie, J. C. Bezdek, and T. Vaithianathan, "Local outlier detection for data streams in sensor networks: Revisiting the utility problem,"
  4. S. Papadimitriou, H. Kitagawa, P. B.Gibbons, and C. Faloutsos,"Loci: Fast outlier detection using the local correlation integral,"in International Conference on Data Engineering, 2003, pp. 315–326.
  5. H.-P. Kriegel, P. Kr¨oger, E. Schubert, and A. Zimek, "LoOP: localoutlier probabilities," in ACM Conference on Information and KnowledgeManagement, 2009, pp. 1649–1652.
  6. S. Rajasegarar, C. Leckie, and M. Palaniswami, "Anomaly detectionin wireless sensor networks," IEEE Wireless Communications,vol. 15, no. 4, pp. 34–40, 2008.
  7. V. Chandola, A. Banerjee, and V. Kumar, "Anomaly detection: A survey," ACM Computing Surveys, vol. 41, no. 3, pp. 1–58, 2009.
  8. M. Gupta, J. Gao, C. C. Aggarwal, and J. Han, "Outlier Detectionfor Temporal Data: A Survey," IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 1, pp.1–20, 2013.
  9. C. C. Aggarwal, "Outlier Analysis," 2013 .
  10. K. Yamanishi, J.-I. Takeuchi, Williams, and P.Milne, "Online unsupervised outlier detection using finite mixtures with discounting learning algorithms," in SIGKDD, 2000, pp. 320–324.
  11. K. Yamanishi and J.-i. Takeuchi, "A unifying framework for detecting outliers and change points from non-stationary time series data," in SIGKDD, 2002, pp. 676–681.
  12. C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu, "A framework for clustering evolving data streams," in VLDB, 2003, pp. 81–92.
  13. F. Cao, M. Ester, W. Qian, and A. Zhou, "Density-based clustering over an evolving data stream with noise," in SIAM Conference on Data Mining, 2006, pp. 328–339.
  14. S. Guha, A. Meyerson, N. Mishra, R. Motwani, andL. O’Callaghan, "Clustering data streams: Theory and practice,"IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 3,pp. 515–528, 2003.
  15. C. C. Aggarwal, J. Han, J. Wang, and P. S.Yu, "A framework for projected clustering of high dimensional data streams," in International Conference on Very Large Data Bases-Volume 30, 2004,pp. 852–863.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2017-04-30

Issue

Volume 2, Issue 2, March-April-2017

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
R. Ramya, " Fast Memory Access in Data Streams Using Pagerank Algorithm , IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 2, pp.338-341, March-April-2017.