Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Machine learning

Nowadays, a large amount of information has to be transmitted or processed. This implies high-power processing, large memory density, and increased energy consumption. In several applications, such as imaging, radar, speech recognition, and data acquisition, the signals involved can be considered sparse or compressive in some domain. The compressive sensing theory could be a proper candidate to deal with these constraints. It can be used to recover sparse or compressive signals with fewer measurements than the traditional methods. Two problems must be addressed by compressive sensing theory: design of the measurement matrix and development of an efficient sparse recovery algorithm. These algorithms are usually classified into three categories: convex relaxation, non-convex optimization techniques, and greedy algorithms. This paper intends to supply a comprehensive study and a state-of-the-art review of these algorithms to researchers who wish to develop and use them. Moreover, a wide range of compressive sensing theory applications is summarized and some open research challenges are presented.

/pdf/a-review-of-sparse-recovery-algorithms-3a8ag4tbpe.pdf

A Review of Sparse Recovery Algorithms

Generally, data is available abundantly in unlabeled form, and its annotation requires some cost. The labeling, as well as learning cost, can be minimized by learning with the minimum labeled data instances. Active learning (AL), learns from a few labeled data instances with the additional facility of querying the labels of instances from an expert annotator or oracle. The active learner uses an instance selection strategy for selecting those critical query instances, which reduce the generalization error as fast as possible. This process results in a refined training dataset, which helps in minimizing the overall cost. The key to the success of AL is query strategies that select the candidate query instances and help the learner in learning a valid hypothesis. This survey reviews AL query strategies for classification, regression, and clustering under the pool-based AL scenario. The query strategies under classification are further divided into: informative-based, representative-based, informative- and representative-based, and others. Also, more advanced query strategies based on reinforcement learning and deep learning, along with query strategies under the realistic environment setting, are presented. After a rigorous mathematical analysis of AL strategies, this work presents a comparative analysis of these strategies. Finally, implementation guide, applications, and challenges of AL are discussed.

Active Learning Query Strategies for Classification, Regression, and Clustering: A Survey

In today’s world, ruled by a great amount of data and mobile devices, cloud-based systems are spreading all over. Such phenomenon increases the number of connected devices, broadcast bandwidth, and information exchange. These fine-grained interconnected systems, which enable the Internet connectivity for an extremely large number of facilities (far beyond the current number of devices) go by the name of Internet of Things (IoT). In this scenario, mobile devices have an operating time which is proportional to the battery capacity, the number of operations performed per cycle and the amount of exchanged data. Since the transmission of data to a central cloud represents a very energy-hungry operation, new computational paradigms have been implemented. The computation is not completely performed in the cloud, distributing the power load among the nodes of the system, and data are compressed to reduce the transmitted power requirements. In the edge-computing paradigm, part of the computational power is moved toward data collection sources, and, only after a first elaboration, collected data are sent to the central cloud server. Indeed, the “edge” term refers to the extremities of systems represented by IoT devices. This survey paper presents the hardware architectures of typical IoT devices and sums up many of the low power techniques which make them appealing for a large scale of applications. An overview of the newest research topics is discussed, besides a final example of a complete functioning system, embedding all the introduced features.

Edge Computing: A Survey On the Hardware Requirements in the Internet of Things World

Nowadays, condition-based maintenance (CBM) and fault diagnosis (FD) of rotating machinery (RM) has a vital role in the modern industrial world. However, the remaining useful life (RUL) of machiner...

https://journals.sagepub.com/doi/pdf/10.1177/1687814021996915

Sounds and acoustic emission-based early fault diagnosis of induction motor: A review study:

Compressive Sensing (CS) is a new sensing modality, which compresses the signal being acquired at the time of sensing. Signals can have sparse or compressible representation either in original domain or in some transform domain. Relying on the sparsity of the signals, CS allows us to sample the signal at a rate much below the Nyquist sampling rate. Also, the varied reconstruction algorithms of CS can faithfully reconstruct the original signal back from fewer compressive measurements. This fact has stimulated research interest toward the use of CS in several fields, such as magnetic resonance imaging, high-speed video acquisition, and ultrawideband communication. This paper reviews the basic theoretical concepts underlying CS. To bridge the gap between theory and practicality of CS, different CS acquisition strategies and reconstruction approaches are elaborated systematically in this paper. The major application areas where CS is currently being used are reviewed here. This paper also highlights some of the challenges and research directions in this field.

A Systematic Review of Compressive Sensing: Concepts, Implementations and Applications

The vibration monitoring of ball bearings of a rotating machinery is a crucial aspect for smooth functioning and sustainability of plants. The wireless vibration monitoring using conventional Nyquist sampling techniques is costly in terms of power consumption, as it generates lots of data that need to be processed. To overcome this issue, compressive sensing (CS) can be employed, which directly acquires the signal in compressed form and hence reduces power consumption. The compressive measurements so generated can easily be transmitted to the base station and the original signal can be recovered there using CS reconstruction algorithms to diagnose the faults. However, the CS reconstruction is very costly in terms of computational time and power. Hence, this conventional CS framework is not suitable for diagnosing the machinery faults in real time. In this paper, a bearing condition monitoring framework is presented based on compressed signal processing (CSP). The CSP is a newer research area of CS, in which inference problems are solved without reconstructing the original signal back from compressive measurements. By omitting the reconstruction efforts, the proposed method significantly improves the time and power cost. This leads to faster processing of compressive measurements for solving the required inference problems for machinery condition monitoring. This gives a way to diagnose the machinery faults in real-time. A comparison of proposed scheme with the conventional method shows that the proposed scheme lowers the computational efforts while simultaneously achieving the comparable fault classification accuracy.

A Machine Condition Monitoring Framework Using Compressed Signal Processing

Electroencephalogram (EEG) signal is a measure of electrical activity across the brain. For patients suffering from brain disorders like epilepsy, coma, sleep disorders, etc., this electrical activity is continuously monitored. For this, a minimum of 21 electrodes are required, which are placed across the scalp. These electrodes generate a lot of data to be processed for diagnosing the brain disease. Compressive sensing (CS), which is a newer sensing modality, has proved itself to be a better candidate for handling large amount of data to be as compared to the traditional sampling mechanism. CS generates far fewer samples than that suggested by Nyquist rate and still allows faithful reconstruction. The CS reconstruction employs complex nonlinear methods, which are very costly. Compressed signal processing (CSP), which is an advancement over CS, gives a direction to solve certain signal processing tasks from compressive measurements itself, without the need for reconstructing the original signal at all. In this paper, CSP has been used for detecting the presence or absence of epileptic seizure in the EEG signal. For this purpose, a feature extraction method is proposed for extracting the features from compressed EEG measurements. The performance of proposed method has been found to be surprisingly effective in this regard. All the experiments are done on the EEG database taken from physionet CHB-MIT using MATLAB.

EEG Seizure Detection from Compressive Measurements

Compressed signal processing (CSP) is a branch of compressive sensing (CS), which gives a direction to solve a class of signal processing problems directly from the compressive measurements of a signal. CSP utilizes the information preserved in the compressive measurements of a signal to solve certain inference problems like: classification, detection, and estimation, without reconstructing the original signal. It further simplifies the signal processing compared to conventional CS by omitting their complex reconstruction stage. This, in turn, reduces the implementation complexity of signal processing systems. This paper investigates the performance of CSP for classification application. After extracting the features from compressive measurements, these features or the data instances are used for classification purpose. Through experimental analysis, it has been found that as the CS undersampling factor is increased, the overlapping among the data instances predominates. This results in a complex decision boundary, which in turn degrades the classification accuracy at higher undersampling factors. To overcome the above issue, this paper proposes the use of a machine learning method known as overlap aware learning along with CSP. This generates a smoother decision boundary and hence improves the classification accuracy at higher undersampling factors. The simulation results show the trend of improved classification accuracy using the proposed method. An analysis of the proposed method has been done on different datasets and based on run-time complexity and complexity vs gain analysis to verify the effectiveness of proposed method.

/pdf/overlap-aware-compressed-signal-classification-u4kwu0mx89.pdf

Overlap Aware Compressed Signal Classification

EEG represents the electrical activity across brain. This activity is monitored to diagnose the diseases due to brain disorders, like epilepsy, coma, sleep disorders, etc. To record EEG signal, a minimum of 21 electrodes are placed across the scalp, which generates huge amount of data. To handle this data, compressive sensing (CS) proves itself to be a better candidate than the traditional sampling. CS generates far fewer samples than that suggested by Nyquist rate and still allows faithful reconstruction. This paper compares the performance of CS reconstruction algorithms in reconstructing the EEG signal back from compressive measurements. The algorithms compared from convex optimization are basis pursuit (BP) and basis pursuit denoising (BPDN) and from greedy algorithms are orthogonal matching pursuit (OMP) and compressive sampling matching pursuit (CoSaMP). The performance of these algorithms is compared on the basis of speed and reconstruction efficiency.

Meenu Rani

Papers

A Systematic Review of Compressive Sensing: Concepts, Implementations and Applications

A Machine Condition Monitoring Framework Using Compressed Signal Processing

EEG Seizure Detection from Compressive Measurements

Overlap Aware Compressed Signal Classification

EEG Monitoring: Performance Comparison of Compressive Sensing Reconstruction Algorithms