Partition-based Collaborative Tensor Factorization for POI Recommendation

The rapid development of location-based social networks(LBSNs) provides people with an opportunity of better understanding their mobility behavior which enables them to decide their next location.For example,it can help travelers to choose where to go next,or recommend salesmen the most potential places to deliver advertisements or sell products.In this paper,a method for recommending points of interest(POIs)is proposed based on a collaborative tensor factorization(CTF)technique.Firstly,a generalized objective function is constructed for collaboratively factorizing a tensor with several feature matrices.Secondly,a 3-mode tensor is used to model all users' check-in behaviors,and three feature matrices are extracted to characterize the time distribution,category distribution and POI correlation,respectively.Thirdly,each user's preference to a POI at a specific time can be estimated by using CTF.In order to further improve the recommendation accuracy,PCTF(Partitionbased CTF) is proposed to fill the missing entries of a tensor after clustering its every mode.Experiments on a real checkin database show that the proposed method can provide more accurate location recommendation.

Nonnegative tensor factorizations using an alternating direction method

The nonnegative tensor （matrix） factorization finds more and more applications in various disciplines including machine learning, data mining, and blind source separation, etc. In computation, the optimization problem involved is solved by alternatively minimizing one factor while the others are fixed. To solve the subproblem efficiently, we first exploit a variable regularization term which makes the subproblem far from ill-condition. Second, an augmented Lagrangian alternating direction method is employed to solve this convex and well-conditioned regularized subproblem, and two accelerating skills are also implemented. Some preliminary numerical experiments are performed to show the improvements of the new method.

Robust Feature Extraction for Speaker Recognition Based on Constrained Nonnegative Tensor Factorization

How to extract robust feature is an important research topic in machine learning community. In this paper, we investigate robust feature extraction for speech signal based on tensor structure and develop a new method called constrained Nonnegative Tensor Factorization （cNTF）. A novel feature extraction framework based on the cortical representation in primary auditory cortex （A1） is proposed for robust speaker recognition. Motivated by the neural firing rates model in A1, the speech signal first is represented as a general higher order tensor, cNTF is used to learn the basis functions from multiple interrelated feature subspaces and find a robust sparse representation for speech signal. Computer simulations are given to evaluate the performance of our method and comparisons with existing speaker recognition methods are also provided. The experimental results demonstrate that the proposed method achieves higher recognition accuracy in noisy environment.

Block Incremental Dense Tucker Decomposition with Application to Spatial and Temporal Analysis of Air Quality Data

How can we efficiently store and mine dynamically generated dense tensors for modeling the behavior of multidimensional dynamic data?Much of the multidimensional dynamic data in the real world is generated in the form of time-growing tensors.For example,air quality tensor data consists of multiple sensory values gathered from wide locations for a long time.Such data,accumulated over time,is redundant and consumes a lot ofmemory in its raw form.We need a way to efficiently store dynamically generated tensor data that increase over time and to model their behavior on demand between arbitrary time blocks.To this end,we propose a Block IncrementalDense Tucker Decomposition(BID-Tucker)method for efficient storage and on-demand modeling ofmultidimensional spatiotemporal data.Assuming that tensors come in unit blocks where only the time domain changes,our proposed BID-Tucker first slices the blocks into matrices and decomposes them via singular value decomposition(SVD).The SVDs of the time×space sliced matrices are stored instead of the raw tensor blocks to save space.When modeling from data is required at particular time blocks,the SVDs of corresponding time blocks are retrieved and incremented to be used for Tucker decomposition.The factor matrices and core tensor of the decomposed results can then be used for further data analysis.We compared our proposed BID-Tucker with D-Tucker,which our method extends,and vanilla Tucker decomposition.We show that our BID-Tucker is faster than both D-Tucker and vanilla Tucker decomposition and uses less memory for storage with a comparable reconstruction error.We applied our proposed BID-Tucker to model the spatial and temporal trends of air quality data collected in South Korea from 2018 to 2022.We were able to model the spatial and temporal air quality trends.We were also able to verify unusual events,such as chronic ozone alerts and large fire events.

Neutron-gamma discrimination method based on blind source separation and machine learning

The discrimination of neutrons from gamma rays in a mixed radiation field is crucial in neutron detection tasks.Several approaches have been proposed to enhance the performance and accuracy of neutron-gamma discrimination.However,their performances are often associated with certain factors,such as experimental requirements and resulting mixed signals.The main purpose of this study is to achieve fast and accurate neutron-gamma discrimination without a priori information on the signal to be analyzed,as well as the experimental setup.Here,a novel method is proposed based on two concepts.The first method exploits the power of nonnegative tensor factorization(NTF)as a blind source separation method to extract the original components from the mixture signals recorded at the output of the stilbene scintillator detector.The second one is based on the principles of support vector machine(SVM)to identify and discriminate these components.In addition to these two main methods,we adopted the Mexican-hat function as a continuous wavelet transform to characterize the components extracted using the NTF model.The resulting scalograms are processed as colored images,which are segmented into two distinct classes using the Otsu thresholding method to extract the features of interest of the neutrons and gamma-ray components from the background noise.We subsequently used principal component analysis to select the most significant of these features wich are used in the training and testing datasets for SVM.Bias-variance analysis is used to optimize the SVM model by finding the optimal level of model complexity with the highest possible generalization performance.In this framework,the obtained results have verified a suitable bias–variance trade-off value.We achieved an operational SVM prediction model for neutron-gamma classification with a high true-positive rate.The accuracy and performance of the SVM based on the NTF was evaluated and validated by comparing it to the charge comparison method via figure of merit.The results indicate that the proposed approach has a superior discrimination quality(figure of merit of 2.20).

Semi-supervised non-negative Tucker decomposition for tensor data representation

Non-negative Tucker decomposition(NTD) has been developed as a crucial method for non-negative tensor data representation.However, NTD is essentially an unsupervised method and cannot take advantage of label information. In this paper, we claim that the low-dimensional representation extracted by NTD can be treated as the predicted soft-clustering coefficient matrix and can therefore be learned jointly with label propagation in a unified framework. The proposed method can extract the physicallymeaningful and parts-based representation of tensor data in their natural form while fully exploring the potential ability of the given labels with a nearest neighbors graph. In addition, an efficient accelerated proximal gradient(APG) algorithm is developed to solve the optimization problem. Finally, the experimental results on five benchmark image data sets for semi-supervised clustering and classification tasks demonstrate the superiority of this method over state-of-the-art methods.

BPR-UserRec:a personalized user recommendation method in social tagging systems

Social tagging is one of the most important characteristics of Web 2.0 services, and social tagging systems （STS） are becoming more and more popular for users to annotate, organize and share items on the Web. Moreover, online social network has been incorporated into social tagging systems. As more and more users tend to interact with real friends on the Web, personalized user recommendation service provided in social tagging systems is very appealing. In this paper, we propose a personalized user recommendation method, and our method handles not only the users＇ interest networks, but also the social network information. We empirically show that our method outperforms a state-of-the-art method on real dataset from Last.fro dataset and Douban.