A personalized hybrid music recommender based on empirical estimation of user-timbre preference

Automatic recommendation system as a subject of machine learning has been undergoing a rapid development in the recent decade along with the trend of big data. Particularly, music recommendation is a highlighted topic because of its commercial value coming from the large music industry. Popular online music recommendation services, including Spotify, Pandora and Last.FM use similarity-based approaches to generate recommendations. In this thesis work, I propose a personalized music recommendation approach that is based on probability estimation without any similarity calculation involved. In my system, each user gets a score for every piece of music. The score is obtained by combining two estimated probabilities of an acceptance. One estimated probability is based on the user’s preferences on timbres. Another estimated probability is the empirical acceptance rate of a music piece. The weighted arithmetic mean is evaluated to be the best performing combination function. An online demonstration of my system is available at www.shuyang.eu/plg/. Demonstrating recommendation results show that the system works effectively. Through the algorithm analysis on my system, we can see that my system has good reactivity and scalability without suffering cold start problem. The accuracy of my recommendation approach is evaluated with Million Song Dataset. My system achieves a pairwise ranking accuracy of 0.592, which outperforms random ranking (0.5) and ranking by popularity (0.557). Unfortunately, I have not found any other music recommendation method evaluated with ranking accuracy yet. As a comparison, Page Rank algorithm (for web page ranking) has a pairwise ranking accuracy of 0.567

Computational Methods for Segmentation of Multi-Modal Multi-Dimensional Cardiac Images

Segmentation of the heart structures helps compute the cardiac contractile function quantified via the systolic and diastolic volumes, ejection fraction, and myocardial mass, representing a reliable diagnostic value. Similarly, quantification of the myocardial mechanics throughout the cardiac cycle, analysis of the activation patterns in the heart via electrocardiography (ECG) signals, serve as good cardiac diagnosis indicators. Furthermore, high quality anatomical models of the heart can be used in planning and guidance of minimally invasive interventions under the assistance of image guidance. The most crucial step for the above mentioned applications is to segment the ventricles and myocardium from the acquired cardiac image data. Although the manual delineation of the heart structures is deemed as the gold-standard approach, it requires significant time and effort, and is highly susceptible to inter- and intra-observer variability. These limitations suggest a need for fast, robust, and accurate semi- or fully-automatic segmentation algorithms. However, the complex motion and anatomy of the heart, indistinct borders due to blood flow, the presence of trabeculations, intensity inhomogeneity, and various other imaging artifacts, makes the segmentation task challenging. In this work, we present and evaluate segmentation algorithms for multi-modal, multi-dimensional cardiac image datasets. Firstly, we segment the left ventricle (LV) blood-pool from a tri-plane 2D+time trans-esophageal (TEE) ultrasound acquisition using local phase based filtering and graph-cut technique, propagate the segmentation throughout the cardiac cycle using non-rigid registration-based motion extraction, and reconstruct the 3D LV geometry. Secondly, we segment the LV blood-pool and myocardium from an open-source 4D cardiac cine Magnetic Resonance Imaging (MRI) dataset by incorporating average atlas based shape constraint into the graph-cut framework and iterative segmentation refinement. The developed fast and robust framework is further extended to perform right ventricle (RV) blood-pool segmentation from a different open-source 4D cardiac cine MRI dataset. Next, we employ convolutional neural network based multi-task learning framework to segment the myocardium and regress its area, simultaneously, and show that segmentation based computation of the myocardial area is significantly better than that regressed directly from the network, while also being more interpretable. Finally, we impose a weak shape constraint via multi-task learning framework in a fully convolutional network and show improved segmentation performance for LV, RV and myocardium across healthy and pathological cases, as well as, in the challenging apical and basal slices in two open-source 4D cardiac cine MRI datasets. We demonstrate the accuracy and robustness of the proposed segmentation methods by comparing the obtained results against the provided gold-standard manual segmentations, as well as with other competing segmentation methods

Improving object segmentation by using EEG signals and rapid serial visual presentation

This paper extends our previous work on the potential of EEG-based brain computer interfaces to segment salient objects in images. The proposed system analyzes the Event Related Potentials (ERP) generated by the rapid serial visual presentation of windows on the image. The detection of the P300 signal allows estimating a saliency map of the image, which is used to seed a semi-supervised object segmentation algorithm. Thanks to the new contributions presented in this work, the average Jaccard index was improved from $0.47$ to $0.66$ when processed in our publicly available dataset of images, object masks and captured EEG signals. This work also studies alternative architectures to the original one, the impact of object occupation in each image window, and a more robust evaluation based on statistical analysis and a weighted F-score

Modeling item--item similarities for personalized recommendations on Yahoo! front page

We consider the problem of algorithmically recommending items to users on a Yahoo! front page module. Our approach is based on a novel multilevel hierarchical model that we refer to as a User Profile Model with Graphical Lasso (UPG). The UPG provides a personalized recommendation to users by simultaneously incorporating both user covariates and historical user interactions with items in a model based way. In fact, we build a per-item regression model based on a rich set of user covariates and estimate individual user affinity to items by introducing a latent random vector for each user. The vector random effects are assumed to be drawn from a prior with a precision matrix that measures residual partial associations among items. To ensure better estimates of a precision matrix in high-dimensions, the matrix elements are constrained through a Lasso penalty. Our model is fitted through a penalized-quasi likelihood procedure coupled with a scalable EM algorithm. We employ several computational strategies like multi-threading, conjugate gradients and heavily exploit problem structure to scale our computations in the E-step. For the M-step we take recourse to a scalable variant of the Graphical Lasso algorithm for covariance selection. Through extensive experiments on a new data set obtained from Yahoo! front page and a benchmark data set from a movie recommender application, we show that our UPG model significantly improves performance compared to several state-of-the-art methods in the literature, especially those based on a bilinear random effects model (BIRE). In particular, we show that the gains of UPG are significant compared to BIRE when the number of users is large and the number of items to select from is small. For large item sets and relatively small user sets the results of UPG and BIRE are comparable. The UPG leads to faster model building and produces outputs which are interpretable.Comment: Published in at http://dx.doi.org/10.1214/11-AOAS475 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org

Using K-means Clustering and Similarity Measure to Deal with Missing Rating in Collaborative Filtering Recommendation Systems

The Collaborative Filtering recommendation systems have been developed to address the information overload problem and personalize the content to the users for business and organizations. However, the Collaborative Filtering approach has its limitation of data sparsity and online scalability problems which result in low recommendation quality. In this thesis, a novel Collaborative Filtering approach is introduced using clustering and similarity technologies. The proposed method using K-means clustering to partition the entire dataset reduces the time complexity and improves the online scalability as well as the data density. Moreover, the similarity comparison method predicts and fills up the missing value in sparsity dataset to enhance the data density which boosts the recommendation quality. This thesis uses MovieLens dataset to investigate the proposed method, which yields amazing experimental outcome on a large sparsity data set that has a higher quality with lower time complexity than the traditional Collaborative Filtering approaches

Identifying metabolites by integrating metabolome databases with mass spectrometry cheminformatics.

Novel metabolites distinct from canonical pathways can be identified through the integration of three cheminformatics tools: BinVestigate, which queries the BinBase gas chromatography-mass spectrometry (GC-MS) metabolome database to match unknowns with biological metadata across over 110,000 samples; MS-DIAL 2.0, a software tool for chromatographic deconvolution of high-resolution GC-MS or liquid chromatography-mass spectrometry (LC-MS); and MS-FINDER 2.0, a structure-elucidation program that uses a combination of 14 metabolome databases in addition to an enzyme promiscuity library. We showcase our workflow by annotating N-methyl-uridine monophosphate (UMP), lysomonogalactosyl-monopalmitin, N-methylalanine, and two propofol derivatives