8
V
http://doi.org/10.22214/ijraset.2020.5427
May 2020
International Journal for Research in Applied Science & Engineering Technology (IJRASET) ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor: 7.429 Volume 8 Issue V May 2020- Available at www.ijraset.com
A Survey on Dynamic Structure Embedded Online Multiple-Output Regression for Streaming Data Priyanka K. Kendre1, Pornima M. Birajdar2 1, 2
Department of Computer Science and Engineering, Swami Ramanand Teerth Marathwada University, Nanded
Abstract: This paper introduces a new strategy called Multiple Output Regression for Streaming data named as MORES. It works on streaming information and regression coefficient. The goals of MORES consist of four important perspectives: 1) It uses the mahalanobis matrix to find dissimilarity between the previous regression coefficient and the current regression coefficient to update the model. 2) It uses Mahalanobis distance for finding prediction mistake and increasingly finds remaining errors, it doesn’t use Euclidian distance. 3) It separates the very important data for better prediction and for estimating errors. All vital data stored in the memory and MORES use these data for event purposes. Labeling of information is used in the multiple-output regression for developing information. Mainly lebeling is used to reweight data for finding errors. 4) Different strategies are introduced in the MORES to develop the system architecture. Eigenvalue decomposition method is used to measure elements of the data sources.Eigenvalue decomposition method is introduced for the situation when the size of the data becomes large or for large streaming information. In this way online multiple-output regression uses the techniques of machine learning system for modeling correlated data stream and predicting multidimensional related data stream and it always provides model refinement. Keywords: Critical event, Decision Tree, Efficient Multiple-Output Regression Method, Eigen Value, Random Forest. I. INTRODUCTION In computing environment, various tasks are performed by online and learning such tasks give the basic information required for the online multiple-output regression. The function of learning various tasks is used for collecting related information of data. The online multiple-output regression system is an important technique of machine learning. An online efficient multiple output regression system uses the concept of machine learning to find regression coefficients. It also uses multi-dimensional correlated data streams. To fulfill the goal of spilling information online efficient multiple-output regression system is used. It is a progressive method with the structure of the regression coefficients for modeling continuous refinement. This paper proposes EMORE that uses Random Forest and Decision Tree for utilizing spilling information. A Decision Tree is used in AI and Machine learning. Decision tree is used for the arrangement of data and regression purposes. In the decision tree, inside the hub of tree poses investigation of data stream and leaf hub of tree include prediction of the data. Thus It is an important methodology used in machine learning and AI. A Decision Tree is used because it is easy to adapt, easy to execute, and interpretable. MORES consist of one of the most important learning strategy named as Random Forest strategy. It is simple, easy to execute, and gives an exact results. Both the Decision Tree and Random Forest strategies give a better prediction. Also it uses three covariance matrices for extracting very important data streams from all collected information. These matrices are used to load all historical data into memory and it also scans samples multiple times. Efficient multiple-output regression is consists of related information of data streams and it adjusts these data for better prediction policy. It works efficiently and provides better execution of data streams. II. LITERATURE REVIEW A. Algorithm for clustering It proposes a novel clustering algorithm named SVStream which is based on a description of support vector knowledge domain and support vector clustering [1]. In this proposed algorithm, data components of streaming information are represented into kernel space. The support vector consists of important information of the historical components for clustering. The proposed SVStream algorithm can identify overlapping clusters that can be achieved by using Bounded Support Vector (BSVs). A BSV method is used to detect and remove unrelated data. This algorithm works on the synthetic data streams and real data stream. It also handles noise situations of the data stream. The result of this algorithm provides the efficiency of the proposed system.
ŠIJRASET: All Rights are Reserved
2577
International Journal for Research in Applied Science & Engineering Technology (IJRASET) ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor: 7.429 Volume 8 Issue V May 2020- Available at www.ijraset.com B. Active learning with drifting streaming data It presents a hypothetically upheld system for dynamic gaining from drifting information streams and creates three dynamic learning procedures for streaming data that unequivocally handle idea drift. It depends on vulnerability, lebeling that can be allocated dynamically after some time, and randomization of the search space. Active learning focuses on carefully selecting as few labeled z instances as possible for learning an accurate predictive model [2]. In streaming environment data changes continuously so streaming data is the challenge for active learning. Active learning models the time to time changed data. Active learning strategy focuses on the most changeful data and gives the idea of prediction accuracy. It consists of a theoretically supported framework for active learning with drifting of streaming information and presents three active learning strategies for streaming information that explicitly handles the concept of drift. The main work of active learning is to focus on uncertain data, dynamically allocated space. It theoretically presents that these strategies are used when data changes anywhere in the model. III. DETECTING CHANGES IN DATA STREAMS In the streaming information settings, data points are observed sequentially. The data generating model may change as the information is streaming. In this paper, it proposes detecting this change in data streams by testing the exchangeability property of the observed data. Martingale’s approach is an efficient, nonparametric, one-pass algorithm that is used for the classification, clustering, and regression of data-generating models and its result shows the feasibility and effectiveness of the martingale methodology which is used in detecting changes in the data generating model for time-varying streaming information [3] . It also presents: A. An adaptive support vector machine (SVM) utilizes the martingale methodology which compares favourably against an adaptive SVM that utilizes a sliding window. B. A multiple martingale video-shot change detector compares against standard shot-change detection algorithms. IV. KERNELIZED MATRIX FACTORIZATION It proposes a method called kernelized matrix factorization method that uses a full-Bayesian treatment. It can work with various side information sources that are communicated as different kernels. Kernels can assemble side information about lines and segments, which is used for making better predictions. Its two main contributions First is formulating an efficient variational approximation scheme for inference with the help of a novel fully conjugate probabilistic model and second is coupling matrix factorization with multiple kernels learning to integrate multiple side information sources into the model Kernelized matrix factorization is extended with a full-Bayesian treatment [4]. In contrast to the earlier kernelized probabilistic matrix factorization method, our probabilistic model is possible to derive a computationally feasible fully Bayesian treatment. It also extends our model towards Bayesian model selection by using automatic relevance determination and towards semi-supervised learning setup for partially observed output case. It illustrates the usefulness of the method on one toy data set, two molecular biological interaction data sets, 14 multilabel classification data sets, and one yeast cell cycle data set. V. ONLINE MULTIPLE-OUTPUT REGRESSION FOR STREAMING DATA This paper proposes a new method called an online multiple-output regression method that uses streaming information. This method uses the Random Forest and the Decision tree method to execute online streaming information with MORES. MORES uses multiple inputs of streaming information to the predict output. It also proposes the Efficient Multiple-Output Regression method called EMORES and this can powerfully obtain perfectibility with the structure of regression coefficients that boosts the model’s refinement. Multiple task learning is the function of online that learns related information in an online manner and the framework predicts critical events. MORES uses a novel information stream clustering algorithm named SVStream which depends on support vector domain description and support vector clustering and it also uses kernelized matrix factorization. Kernelized matrix factorization extends with full Bayesian treatment and it can work with various side data sources that are communicated at different kernels. Decision Tree is an important to machine learning method that is used for the regression process and classification. Decision Tree with a group system motivates various trees to search for various errors that used for the future execution and productivity of the data [5].
©IJRASET: All Rights are Reserved
2578
International Journal for Research in Applied Science & Engineering Technology (IJRASET) ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor: 7.429 Volume 8 Issue V May 2020- Available at www.ijraset.com
Fig. 1 System architecture The figure shows a proposed system that explains a detail description of online efficient multiple-output regression procedures for streaming information. This method uses the structure of the regression coefficients to model continuous refinement. It also learns and uses the structure of the remaining errors to upgrade the prediction accuracy. This method also proposes Decision Tree and Random Forest used to predict the resultant events during progress time. In this way, figure shows the system architecture of multiple output regression methods that find the regression coefficient by using Random Forest and Decision Tree. VI. ONLINE SKETCHING HASHING It proposes a new approach which is based on the concept of sketching that handles the following two problems at the same time: A. In many applications, information often comes continuously like in a streaming fashion but most of the hashing methods use batch-based models. B. When the dataset consists of huge data, it is impractical to load all the information into memory for training models [6]. In this paper, a sketch of one dataset preserves its major characters but with significantly smaller size., This method can learn hash functions in an online fashion with a small size sketch while needs rather low computational complexity and storage space. In this method, an online sketch is used in the covariance matrix, so it will use in the PCA hashing. An online sketch is an important topic in the computing environment, where different types of sketches with different objective functions are also proposed. For example, online sketches use in the k-means algorithm and k-median algorithm and these sketches provide an online version for other hashing methods. VII. K-SVD ALGORITHM It develops an efficient online algorithm for learning multiple consecutive tasks based on the KSVD algorithm for sparse dictionary optimization [7]. The K-SVD algorithm is explored in the lifelong machine learning setting. Adapting K-SVD to The lifelong learning setting required several key innovations including it replaces the SVD step in the original algorithm with a generalized SVD and Selectively updates components of the model if new task data is presented. It also shows that ELLA-SVD that performs well on problems where the input distributions of the data are similar. For domains where the input distributions are not similar, It showed that a hybrid approach (in which It interleaves the ELLA-SVD update with another efficient update step called ELLA Incremental) performs robustly. In future work, It will conduct experiments to better understand the tradeoffs between ELLA-SVD and ELLA Incremental. VIII. CONCLUSIONS In this paper, we have presented review approaches that the use SVStream algorithm, a multiple martingale methodology, online sketching hashing, lifelong learning machine, and active learning with drifting streaming data to proposes an online multiple-output regression technique for streaming information. The result gives better performance and prediction.
ŠIJRASET: All Rights are Reserved
2579
International Journal for Research in Applied Science & Engineering Technology (IJRASET) ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor: 7.429 Volume 8 Issue V May 2020- Available at www.ijraset.com REFERENCES [1] [2] [3] [4] [5] [6] [7]
C.-D.Wang, J.-H. Lai, D. Huang, and W.-S. Zheng, “Svstream: A support vector-based algorithm for clustering data streams,” IEEE Trans. On Knowledge and Data Engineering, vol. 25, no. 6, pp. 1410–1424, 2013. I. Zliobaite, A. Bifet, B. Pfahringer, and G. Holmes, “Active learning with drifting streaming data.” IEEE Trans. on Neural Networks and Learning Systems, vol. 25, no. 1, pp. 27–39, 2014. S.-S. Ho and H. Wechsler, “A martingale framework for detecting changes in data streams by testing exchangeability,” IEEE Trans. On Pattern Analysis and Machine Intelligence, vol. 32, no. 12, pp. 2113–2127, 2010. M. Gonen and S. Kaski, “Kernelized Bayesian matrix factorization,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 36, no. 10, pp. 2047–2060, 2014. Changsheng Li, Fan Wei, Weishan Dong, Xiangfeng Wang, Qingshan Liu, and Xin Zhang, “Dynamic Structure Embedded Online Multiple-Output Regression for Streaming Data” Transactions on Pattern Analysis and Machine Intelligence, Volume: 41, Issue: 2, Feb. 1, 2019. C. Leng, J. Wu, J. Cheng, X. Bai, and H. Lu, “Online sketching hashing,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015, pp. 2503 2511. P. Ruvolo and E. Eaton, “Online multi-task learning via sparse dictionary optimization,” in Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI), 2014.
©IJRASET: All Rights are Reserved
2580