Robotic sensor data analysis using stream data mining techniques

Authors

  • Radhakrishnan Gopalapillai
  • Deepa Gupta
  • Sudarshan, T. S. B

DOI:

https://doi.org/10.14419/ijet.v7i4.21522

Abstract

Many robotic applications deploy multiple robots and it is possible that more than one of those robots are operating in the same environment. Such situations demand grouping together of similar environments in real-time to perform actions in a coordinated way. The main challenge when robots sent huge amount of data is to process the data stream without storing them. In this work, an experimental setup is created to gather data from simulated robotic environments. The data collected are treated as continuously arriving time series data and they are com-pressed using summary data structures suitable for clustering. The robotic environments are clustered using techniques based on simple single pass K-means and StreamKM++ algorithms. The methods used to adapt these two algorithms for robotics data streams are discussed. The suitability of these techniques for robotic applications is analyzed and performances of the algorithms are compared.

References

[1] Farnstrom, F. Lewis, J. In addition, Elkan, C. Scalability for Clustering Algorithms Revisited, SIGKDD Exploration Newslett. 2, 1, 2000, pp. 51–57.

[2] Ackermann,M. Martens, R. Raupach, M. Swierkot, C. Lammersen, K. and Sohler, C. 2012. StreamKM++: A clustering algorithm for data streams. ACM J. Exper. Algor.17, 1. https://doi.org/10.1145/2133803.2184450.

[3] Nair, B B. Kumar, P.K.S. Sakthivel, N.R. Vipin, U, Clustering stock price time series data to generate stock trading recommendations: An empirical studyâ€, Expert Systems with Applications, Vol. 70, pp. 20-36, March 2017 https://doi.org/10.1016/j.eswa.2016.11.002.

[4] Radhakrishnan, G. Gupta, D. Abhishek, R. Ajith, A. Sudarshan, T.S.B. Analysis of multimodal time series data of robotic environment. Proceedings of 12th International Conference on Intelligent Systems Design and Applications (ISDA), Kochi, India, pp. 734-739, 2012.

[5] Radhakrishnan, G. Gupta, D. TSudarshan,T.S.B.,Experimentation And Analysis Of Time Series Data For Rescue Robotics, Proceedings of 2nd International Symposium On Intelligent Informatics (Ist'13), Mysore, India, pp.443-453, 2013.

[6] Gopalapillai, R. Vidhya, J. Gupta, D. Sudarshan, T.S.B. Classification of robotic data using artificial neural network, Proccedings of IEEE Recent Advances Intelligent Computational Systems (RAICS), Trivandrum, India, pp.333-337, 2013.

[7] Mishra, S. Radhakrishnan, G. Gupta, D. Sudarshan T.S.B., Acquisition and Analysis of Robotic Data Using Machine Learning Techniques, Computational Intelligence in Data Mining - Volume 3 Smart Innovation, Systems and Technologies Volume 33, 2015, pp 489-498.

[8] Jacqueline Heinerman, Evert Haasdijk and A.E. Eiben, Unsupervised identification and recognition of situations for high-dimensional sensori-motor streams, Neurocomputing, Vol. 262, 1 November 2017, pp. 90-107. https://doi.org/10.1016/j.neucom.2017.02.090.

[9] Sabarish B.A, Karthi R, Gireeshkumar T.B, Clustering of trajectory data using hierarchical approaches, Lecture Notes in Computational Vision and Biomechanics, Vol. 28, 2018, pp. 215-226 https://doi.org/10.1007/978-3-319-71767-8_18.

[10] Jonathan A. Silva, Elaine R. Faria. Data Stream Clustering: A Survey, ACM Computing Surveys, 2013 Vol. 46, No. 1, Article 13.

[11] Barbara. Requirements of Clustering Data Streams, SIGKDD Explorations (2002) 3(2):23-27. https://doi.org/10.1145/507515.507519.

[12] Zhang Et Al. Birch: An Efficient Data Clustering Method for Very Large Databases. ACM SIGMOD: (1996) 103-110.

[13] Aggarwal, C.C. Han, J. Wang, J. In addition, Yu, P.S. A framework for clustering evolving data streams. In VLDB 2003, Proceedings of 29th International Conference on Very Large Data Bases, pages 81–92.

[14] Rodrigues, P. P., Gama, J., And Pedroso, J. P,.Hierarchical Clustering Of Time-Series Data Streams. IEEE Trans 2008, Knowl. Data Engin 20, 5, 615 –627.

[15] Bradley, P. S., Fayyad, U. M., And Reina, C, Scaling clustering algorithms to large databases. Proceedings of the fourth International Conference on Knowledge Discovery and Data Mining (KDD’98). 1998.

[16] Arthur, D. and Vassilvitskii, S. (2007). K-means++: the advantages of careful seeding. Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics Philadelphia, PA, USA. pp. 1027–1035.

[17] L. Callaghan, N. Mishra, A. Meyerson, S. Guha, and R. Motwani, Streaming-Data Algorithms for High-Quality Clustering, Proceedings of IEEE International Conference on Data Engineering, 2001, pp. 685-694.

[18] Priyanka C.Nair, Radhakrishnan G, Deepa Gupta, Sudarshan TSB, Clustering of Robotic Environment using Image Data Stream, Proceedings of the IEEE International Conference on Communication Control and Intelligent System (CCIS-2015), Mathura, India, 2015, pp. 208-213.

View Full Article: