Influence of Model and Traffic Pattern on Determining the Self-Similarity in IP Networks

This study aimed to determine the applicability of using selected libraries of computing environment R to establish the coefficient of self-similarity. R environment is an analytical environment with rich functionality that is used in many research and practical works concerning data analysis and knowledge discovery. Such an issue is significant in the context of contemporary wide area computer networks and the emerging type of network infrastructure IoT. This originates directly from the new nature of IoT traffic, which also has a substantial impact on Industry 4.0. It provides built-in operations facilitating data processing. The Hurst coefficient is used to evaluate traffic behavior and analyze its character. The study analyzed two cases of IoT network traffic: high and low intensity. For different sizes of time windows, we dermined the statistical Hurst exponent and compared it with standard, smoothed, and Robinson methods. The accuracy of the methods used was evaluated. Spectral regression graphs were additionally generated for selected motion variants. The obtained results were verified by Higuchi and Aggvar methods.

Low rank spectral regression via matrix factorization for efficient subspace learning

Subspace learning aims to obtain the corresponding low-dimensional representation of high dimensional data in order to facilitate the subsequent data storage and processing. Graph-based subspace learning is a kind of effective subspace learning methods by modeling the data manifold with a graph, which can be included in the general spectral regression (SR) framework. By using the least square regression form as objective function, spectral regression mathematically avoids performing eign-decomposition on dense matrices and has excellent flexibility. Recently, spectral regression has obtained promising performance in diverse applications; however, it did not take the underlying classes/tasks correlation patterns of data into consideration. In this paper, we propose to improve the performance of spectral regression by exploring the correlation among classes with low-rank modeling. The newly formulated low-rank spectral regression (LRSR) model is achieved by decomposing the projection matrix in SR by two factor matrices which were respectively regularized. The LRSR objective function can be handled by the alternating direction optimization framework. Besides some analysis on the differences between LRSR and existing related models, we conduct extensive experiments by comparing LRSR with its full rank counterpart on benchmark data sets and the results demonstrate its superiority.

Introducing the hybrid “K-means, RLS” learning for the RBF network in obstructive apnea disease detection using Dual-tree complex wavelet transform based features

Apnea is one of the deadliest diseases that can be prevented and cured if it is detected in time. In this paper, we propose a precise method for early detection of the obstructive sleep apnea (OSA) disease using the latest feature selection and extraction methods. The feature selection in this paper is based on the Dual tree complex wavelet (DT-CWT) coefficients of the ECG signals of several patients. The feature extraction from these coefficients is done using frequency and time techniques. The Feature selection is done using the spectral regression discriminant analysis (SRDA) algorithm and the classification is performed using the hybrid RBF network. A hybrid RBF neural network is introduced in this paper for detecting apnea that is much less computationally demanding than the previously presented SVM networks. Our findings showed a 3 percent improvement in the detection and at least a 30 percent reduction in the computational complexity in comparison with methods that have been presented recently.