Affective Music Information Retrieval

Much of the appeal of music lies in its power to convey emotions/moods and to evoke them in listeners. In consequence, the past decade witnessed a growing interest in modeling emotions from musical signals in the music information retrieval (MIR) community. In this article, we present a novel generative approach to music emotion modeling, with a specific focus on the valence-arousal (VA) dimension model of emotion. The presented generative model, called \emph{acoustic emotion Gaussians} (AEG), better accounts for the subjectivity of emotion perception by the use of probability distributions. Specifically, it learns from the emotion annotations of multiple subjects a Gaussian mixture model in the VA space with prior constraints on the corresponding acoustic features of the training music pieces. Such a computational framework is technically sound, capable of learning in an online fashion, and thus applicable to a variety of applications, including user-independent (general) and user-dependent (personalized) emotion recognition and emotion-based music retrieval. We report evaluations of the aforementioned applications of AEG on a larger-scale emotion-annotated corpora, AMG1608, to demonstrate the effectiveness of AEG and to showcase how evaluations are conducted for research on emotion-based MIR. Directions of future work are also discussed.Comment: 40 pages, 18 figures, 5 tables, author versio

Feedback control of polymer flooding process considering geologic uncertainty

textPolymer flooding is economically successful in reservoirs where the water flood mobility ratio is high, and/or the reservoir heterogeneity is adverse, because of the improved sweep resulting from the mobility-controlled oil displacement. The performance of a polymer flood can be further improved if the process is dynamically controlled using updated reservoir models and a closed-loop production optimization scheme is implemented. However, the formulation of an optimal production strategy is based on uncertain production forecasts resulting from uncertainty in spatial representation of reservoir heterogeneity, geologic scenarios, inaccurate modeling, scaling, just to cite a few factors. Assessing the uncertainty in reservoir modeling and transferring it to uncertainty in production forecasts is crucial for efficiently controlling the process. This dissertation presents a feedback control framework that (1) assesses uncertainty in reservoir modeling and production forecasts, (2) updates the prior uncertainty in reservoir models by integrating continuously monitored production data, and (3) formulates optimal injection/production rates for the updated reservoir models. This approach focuses on assessing uncertainty in reservoir modeling and production forecasts originated mainly by uncertain geologic scenarios and spatial variations of reservoir properties (heterogeneity). This uncertainty is mapped in a metric space created by comparing multiple reservoir models and measuring differences in effective heterogeneity related to well connectivity and well responses characteristic of polymer flooding. Continuously monitored production data is used to refine the uncertainty map using a Bayesian inversion algorithm. In contrast to classical approach of history matching by model perturbation, a model selection problem is implemented where highly probable reservoir models are selected to represent the posterior uncertainty in production forecasts. The model selection procedure yields the posterior uncertainty associated with the reservoir model. The production optimization problem is solved using the posterior models and a proxy model of polymer flooding to rapidly evaluate the objective function and response surfaces to represent the relationship between well controls and an economic objective function. The value of the feedback control framework is demonstrated with two examples of polymer flooding where the economic performance was maximized.Petroleum and Geosystems Engineerin

Bioinformatics

This book is divided into different research areas relevant in Bioinformatics such as biological networks, next generation sequencing, high performance computing, molecular modeling, structural bioinformatics, molecular modeling and intelligent data analysis. Each book section introduces the basic concepts and then explains its application to problems of great relevance, so both novice and expert readers can benefit from the information and research works presented here

Online Spectral Clustering on Network Streams

Graph is an extremely useful representation of a wide variety of practical systems in data analysis. Recently, with the fast accumulation of stream data from various type of networks, significant research interests have arisen on spectral clustering for network streams (or evolving networks). Compared with the general spectral clustering problem, the data analysis of this new type of problems may have additional requirements, such as short processing time, scalability in distributed computing environments, and temporal variation tracking. However, to design a spectral clustering method to satisfy these requirements certainly presents non-trivial efforts. There are three major challenges for the new algorithm design. The first challenge is online clustering computation. Most of the existing spectral methods on evolving networks are off-line methods, using standard eigensystem solvers such as the Lanczos method. It needs to recompute solutions from scratch at each time point. The second challenge is the parallelization of algorithms. To parallelize such algorithms is non-trivial since standard eigen solvers are iterative algorithms and the number of iterations can not be predetermined. The third challenge is the very limited existing work. In addition, there exists multiple limitations in the existing method, such as computational inefficiency on large similarity changes, the lack of sound theoretical basis, and the lack of effective way to handle accumulated approximate errors and large data variations over time. In this thesis, we proposed a new online spectral graph clustering approach with a family of three novel spectrum approximation algorithms. Our algorithms incrementally update the eigenpairs in an online manner to improve the computational performance. Our approaches outperformed the existing method in computational efficiency and scalability while retaining competitive or even better clustering accuracy. We derived our spectrum approximation techniques GEPT and EEPT through formal theoretical analysis. The well established matrix perturbation theory forms a solid theoretic foundation for our online clustering method. We facilitated our clustering method with a new metric to track accumulated approximation errors and measure the short-term temporal variation. The metric not only provides a balance between computational efficiency and clustering accuracy, but also offers a useful tool to adapt the online algorithm to the condition of unexpected drastic noise. In addition, we discussed our preliminary work on approximate graph mining with evolutionary process, non-stationary Bayesian Network structure learning from non-stationary time series data, and Bayesian Network structure learning with text priors imposed by non-parametric hierarchical topic modeling