A Hierarchical Model for Ordinal Matrix Factorization

This paper proposes a hierarchical probabilistic model for ordinal matrix factorization. Unlike previous approaches, we model the ordinal nature of the data and take a principled approach to incorporating priors for the hidden variables. Two algorithms are presented for inference, one based on Gibbs sampling and one based on variational Bayes. Importantly, these algorithms may be implemented in the factorization of very large matrices with missing entries. The model is evaluated on a collaborative filtering task, where users have rated a collection of movies and the system is asked to predict their ratings for other movies. The Netflix data set is used for evaluation, which consists of around 100 million ratings. Using root mean-squared error (RMSE) as an evaluation metric, results show that the suggested model outperforms alternative factorization techniques. Results also show how Gibbs sampling outperforms variational Bayes on this task, despite the large number of ratings and model parameters. Matlab implementations of the proposed algorithms are available from cogsys.imm.dtu.dk/ordinalmatrixfactorization.

Confidence in beliefs about pain predicts expectancy effects on pain perception and anticipatory processing in right anterior insula.

Psychological factors play a major role in exacerbating chronic pain. Effective self-management of pain is often hindered by inaccurate beliefs about the nature of pain which lead to a high degree of emotional reactivity. Probabilistic models of perception state that greater confidence (certainty) in beliefs increases their influence on perception and behavior. In this study, we treat confidence as a metacognitive process dissociable from the content of belief. We hypothesized that confidence is associated with anticipatory activation of areas of the pain matrix involved with top-down modulation of pain. Healthy volunteers rated their beliefs about the emotional distress that experimental pain would cause, and separately rated their level of confidence in this belief. Confidence predicted the influence of anticipation cues on experienced pain. We measured brain activity during anticipation of pain using high-density EEG and used electromagnetic tomography to determine neural substrates of this effect. Confidence correlated with activity in right anterior insula, posterior midcingulate and inferior parietal cortices during the anticipation of pain. Activity in the right anterior insula predicted a greater influence of anticipation cues on pain perception, whereas activity in right inferior parietal cortex predicted a decreased influence of anticipatory cues. The results support probabilistic models of pain perception and suggest that confidence in beliefs is an important determinant of expectancy effects on pain perception.

Low-rank optimization for distance matrix completion

This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the number of considered data points. The focus is on high-dimensional problems. We recast the considered problem into an optimization problem over the set of low-rank positive semidefinite matrices and propose two efficient algorithms for low-rank distance matrix completion. In addition, we propose a strategy to determine the dimension of the embedding space. The resulting algorithms scale to high-dimensional problems and monotonically converge to a global solution of the problem. Finally, numerical experiments illustrate the good performance of the proposed algorithms on benchmarks. © 2011 IEEE.

Optimization Algorithms on Matrix Manifolds

This book shows how to exploit the special structure of such problems to develop efficient numerical algorithms.

Determination of the rheological parameters of self-compacting concrete matrix using slump flow test

The classification of a concrete mixture as self-compacting (SCC) is performed by a series of empirical characterization tests that have been designed to assess not only the flowability of the mixture but also its segregation resistance and filling ability. The objective of the present work is to correlate the rheological parameters of SCC matrix, yield stress and plastic viscosity, to slump flow measurements. The focus of the slump flow test investigation was centered on the fully yielded flow regime and an empirical model relating the yield stress to material and flow parameters is proposed. Our experimental data revealed that the time for a spread of 500 mm which is used in engineering practice as reference for measurement parameters, is an arbitrary choice. Our findings indicate that the non-dimensional final spread is linearly related to the non-dimensional yield-stress. Finally, there are strong indications that the non-dimensional viscosity of the mixture is associated with the non-dimensional final spread as well as the stopping time of the slump flow; this experimental data set suggests an exponential decay of the final spread and stopping time with viscosity. © Appl. Rheol.

Dynamics of filopodium-like protrusion and endothelial cellular motility on onedimensional extracellular matrix fibrils

Endothelial filopodia play key roles in guiding the tubular sprouting during angiogenesis. However, their dynamic morphological characteristics, with the associated implications in cell motility, have been subjected to limited investigations. In this work, the interaction between endothelial cells and extracellular matrix fibrils was recapitulated in vitro, where a specific focus was paid to derive the key morphological parameters to define the dynamics of filopodium-like protrusion during cell motility. Based on one-dimensional gelatin fibrils patterned by near-field electrospinning (NFES), we study the response of endothelial cells (EA.hy926) under normal culture or ROCK inhibition. It is shown that the behaviour of temporal protrusion length versus cell motility can be divided into distinct modes. Persistent migration was found to be one of the modes which permitted cell displacement for over 300 μm at a speed of approximately 1 μm min-1. ROCK inhibition resulted in abnormally long protrusions and diminished the persistent migration, but dramatically increased the speeds of protrusion extension and retraction. Finally, we also report the breakage of protrusion during cell motility, and examine its phenotypic behaviours. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

Determination of 266 pesticide residues in apple juice by matrix solid-phase dispersion and gas chromatography-mass selective detection

A macro matrix solid-phase dispersion (MSPD) method was developed to extract 266 pesticides from apple juice samples prior to gas chromatography-mass selective detection (GC-MSD) determination. A 10 g samples was mixed with 20 g diatomaceous earth. The mixture was transferred into a glass column. Pesticide residues were leached with a 160 mL hexane-dichloromethane (1:1) at 5 mL/min. Two hundred and sixty-six pesticides were divided into three groups and detected by GC-MSD under selective ion monitoring. The proposed method takes advantage of both liquid-liquid extraction and conventional MSPD methods. Application was illustrated by the analysis of 236 apple juice samples produced in Shaanxi province China mainland this year. (C) 2004 Elsevier B.V. All rights reserved.

Fixed-rank matrix factorizations and Riemannian low-rank optimization

Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fixed-rank symmetric positive semidefinite matrices, apply to a broad range of applications, scale to high-dimensional problems, and confer a geometric basis to recent contributions on the learning of fixed-rank non-symmetric matrices. We make connections with existing algorithms in the context of low-rank matrix completion and discuss the usefulness of the proposed framework. Numerical experiments suggest that the proposed algorithms compete with state-of-the-art algorithms and that manifold optimization offers an effective and versatile framework for the design of machine learning algorithms that learn a fixed-rank matrix. © 2013 Springer-Verlag Berlin Heidelberg.