Generic, network schema agnostic sparse tensor factorization for single-pass clustering of heterogeneous information networks

Heterogeneous information networks (e.g. bibliographic networks and social media networks) that consist of multiple interconnected objects are ubiquitous. Clustering analysis is an effective method to understand the semantic information and interpretable structure of the heterogeneous information networks, and it has attracted the attention of many researchers in recent years. However, most studies assume that heterogeneous information networks usually follow some simple schemas, such as bi-typed networks or star network schema, and they can only cluster one type of object in the network each time. In this paper, a novel clustering framework is proposed based on sparse tensor factorization for heterogeneous information networks, which can cluster multiple types of objects simultaneously in a single pass without any network schema information. The types of objects and the relations between them in the heterogeneous information networks are modeled as a sparse tensor. The clustering issue is modeled as an optimization problem, which is similar to the well-known Tucker decomposition. Then, an Alternating Least Squares (ALS) algorithm and a feasible initialization method are proposed to solve the optimization problem. Based on the tensor factorization, we simultaneously partition different types of objects into different clusters. The experimental results on both synthetic and real-world datasets have demonstrated that our proposed clustering framework, STFClus, can model heterogeneous information networks efficiently and can outperform state-of-the-art clustering algorithms as a generally applicable single-pass clustering method for heterogeneous network which is network schema agnostic

Tensor based multichannel reconstruction for breast tumours identification from DCE-MRIs

A new methodology based on tensor algebra that uses a higher order singular value decomposition to perform three-dimensional voxel reconstruction from a series of temporal images obtained using dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) is proposed. Principal component analysis (PCA) is used to robustly extract the spatial and temporal image features and simultaneously de-noise the datasets. Tumour segmentation on enhanced scaled (ES) images performed using a fuzzy C-means (FCM) cluster algorithm is compared with that achieved using the proposed tensorial framework. The proposed algorithm explores the correlations between spatial and temporal features in the tumours. The multi-channel reconstruction enables improved breast tumour identification through enhanced de-noising and improved intensity consistency. The reconstructed tumours have clear and continuous boundaries; furthermore the reconstruction shows better voxel clustering in tumour regions of interest. A more homogenous intensity distribution is also observed, enabling improved image contrast between tumours and background, especially in places where fatty tissue is imaged. The fidelity of reconstruction is further evaluated on the basis of five new qualitative metrics. Results confirm the superiority of the tensorial approach. The proposed reconstruction metrics should also find future applications in the assessment of other reconstruction algorithms

Tensorized multi-view subspace representation learning

Self-representation based subspace learning has shown its effectiveness in many applications. In this paper, we promote the traditional subspace representation learning by simultaneously taking advantages of multiple views and prior constraint. Accordingly, we establish a novel algorithm termed as Tensorized Multi-view Subspace Representation Learning. To exploit different views, the subspace representation matrices of different views are regarded as a low-rank tensor, which effectively models the high-order correlations of multi-view data. To incorporate prior information, a constraint matrix is devised to guide the subspace representation learning within a unified framework. The subspace representation tensor equipped with a low-rank constraint models elegantly the complementary information among different views, reduces redundancy of subspace representations, and then improves the accuracy of subsequent tasks. We formulate the model with a tensor nuclear norm minimization problem constrained with ℓ2,1-norm and linear equalities. The minimization problem is efficiently solved by using an Augmented Lagrangian Alternating Direction Minimization method. Extensive experimental results on diverse multi-view datasets demonstrate the effectiveness of our algorithm