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

Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

Data Mining Practical Machine Learning Tools and Techniques

http://www.csun.edu/~andrzej/COMP529-S05/papers/Mesh%20Networks%20Survey.pdf

Wireless mesh networks: a survey

“Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks”の学習報告

Nonlinear data-driven dimensionality reduction techniques have recently gained popularity due to the emergence of high dimensional data sets. The algorithmic complexity and storage requirements of these techniques, however, can make them prohibitive in resource-limited applications. It is therefore beneficial to reduce the number of exemplar samples required for performing an out-of-sample extension to a test point. In this paper, we propose a novel method for selecting a minimal set of exemplars and performing the out-of-sample extension. In the case of two-class target recognition with synthetic aperture radar (SAR) data, we compare the efficacy of the proposed approach with other approaches for selecting a subset of the available training samples. We show that the proposed algorithm outperforms the existing methods by providing low-dimensional embeddings that maintain interclass separability using fewer retained exemplars.

Sparse Manifold Learning with Applications to SAR Image Classification

Methods and systems for recovering corrupted/degraded images using approximations obtained from an ensemble of multiple sparse models are disclosed. Sparse models may represent images parsimoniously using elementary patterns from a "dictionary" matrix. Various embodiments of the present disclosure involve simple and computationally efficient dictionary design approach along with low-complexity reconstruction procedure that may use a parallel-friendly table-lookup process. Multiple dictionaries in an ensemble model may be inferred sequentially using greedy forward-selection approach and can incorporate bagging/boosting strategies, taking into account application-specific degradation. Recovery performance obtained using the proposed approaches with image super resolution and compressive recovery can be comparable to or better than existing sparse modeling based approaches, at reduced computational complexity. By including ensemble models in hierarchical multilevel learning, where multiple dictionaries are inferred in each level, further performance improvements can be obtained in image recovery, without significant increase in computational complexity.

Ensemble sparse models for image analysis and restoration

Arizona State University (ASU) established an NSF Research Experiences for Undergraduates (REU) site to embed students in research projects related to integrated sensor and signal processing systems The program includes both sensor hardware and algorithm/software design for a variety of applications including health monitoring The site was funded in February 2017 and the Co-PIs recruited nine students from different universities and community colleges to spend the summer of 2017 in research laboratories at ASU The program included structured training with modules in sensor design, signal processing, and machine learning Cross-cutting training included research ethics, IEEE manuscript development, and building presentation skills Nine undergraduate research projects were launched and the program went through an assessment by an independent evaluator This paper describes the REU activities, modules, training, projects, and their assessment

A Stem Reu Site on the Integrated Design of Sensor Devices and Signal Processing Algorithms

The general aim of this work is to learn a unique statistical signature for the state of a particular speech pathology. We pose this as a speaker identification problem for dysarthric individuals. To that end, we propose a novel algorithm for feature selection that aims to minimize the effects of speaker-specific features (e.g., fundamental frequency) and maximize the effects of pathology-specific features (e.g., vocal tract distortions and speech rhythm). We derive a cost function for optimizing feature selection that simultaneously trades off between these two competing criteria. Furthermore, we develop an efficient algorithm that optimizes this cost function and test the algorithm on a set of 34 dysarthric and 13 healthy speakers. Results show that the proposed method yields a set of features related to the speech disorder and not an individual's speaking style. When compared to other feature-selection algorithms, the proposed approach results in an improvement in a disorder fingerprinting task by selecting features that are specific to the disorder.

/pdf/selecting-disorder-specific-features-for-speech-pathology-4itzs8u9xe.pdf

Selecting disorder-specific features for speech pathology fingerprinting

State-of-the-art under-determined audio source separation systems rely on supervised end-end training of carefully tailored neural network architectures operating either in the time or the spectral domain. However, these methods are severely challenged in terms of requiring access to expensive source level labeled data and being specific to a given set of sources and the mixing process, which demands complete re-training when those assumptions change. This strongly emphasizes the need for unsupervised methods that can leverage the recent advances in data-driven modeling, and compensate for the lack of labeled data through meaningful priors. To this end, we propose a novel approach for audio source separation based on generative priors trained on individual sources. Through the use of projected gradient descent optimization, our approach simultaneously searches in the source-specific latent spaces to effectively recover the constituent sources. Though the generative priors can be defined in the time domain directly, e.g. WaveGAN, we find that using spectral domain loss functions for our optimization leads to good-quality source estimates. Our empirical studies on standard spoken digit and instrument datasets clearly demonstrate the effectiveness of our approach over classical as well as state-of-the-art unsupervised baselines.

Andreas Spanias

Papers

Sparse Manifold Learning with Applications to SAR Image Classification

Ensemble sparse models for image analysis and restoration

A Stem Reu Site on the Integrated Design of Sensor Devices and Signal Processing Algorithms

Selecting disorder-specific features for speech pathology fingerprinting

Unsupervised audio source separation using generative priors