The modern industrial sector generates enormous amounts of high-dimensional heterogeneous data daily. However, mostly the vectored data (rank-one tensor) have been considered for anomaly detection, whereas the data in real-life is high dimensional. The expressive power of methods based on vector data is restrictive as they may destroy the structural information embedded in data and lead to the curse-of-dimensionality and overfitting. In this paper, we present a novel anomaly detection approach for large-scale tensor data. We first present novel one-class support tensor machines (OCSTM) with bounded loss function. We further extend it by leveraging the randomness to design a scalable approach that can also be used for large-scale anomaly detection. To solve the corresponding optimization of the objective function, we utilize half-quadratic optimization followed by solving it like a traditional OCSTM optimization at each iteration. We demonstrate the proposed randomized OCSTM with bounded hinge loss through experiments on 14 benchmark data sets. Experimental results demonstrate the effectiveness of the proposed approach against anomalies and a significant reduction in the computational complexity.

Alzheimer's disease (AD) is an irreversible and progressive disorder where a large number of brain cells and their connections degenerate and die, eventually destroy the memory and other important mental functions that affect memory, thinking, language, judgment, and behavior. Not a single test can effectively determine AD; however, CT and magnetic resonance imaging (MRI) can be used to observe the decrease in size of different areas (mainly temporal and parietal lobes). This paper proposes an integrative deep ensemble learning framework to obtain better predictive performance for AD diagnosis. Unlike DenseNet, we present a multiresolutional ensemble PartialNet tailored to Alzheimer detection using brain MRIs. PartialNet incorporates the properties of identity mappings, diversified depth as well as deep supervision, thus, considers feature reuse that in turn results in better learning. Additionally, the proposed ensemble PartialNet demonstrates better characteristics in terms of vanishing gradient, diminishing forward flow with better training time, and a low number of parameters compared with DenseNet. Experiments performed on benchmark AD neuroimaging initiative data set that showed considerable performance gain (2 + % ↑ $\uparrow $ ) and (1.2 + % ↑ $\uparrow $ ) for multiclass and binary class in AD detection in comparison to state-of-the-art methods.

Most existing research about task allocation in mobile crowdsensing mainly focus on requester-centric mobile crowdsensing (RCMCS), where the requester assigns tasks to workers to maximize his/her benefits. A worker in RCMCS might suffer benefit damage because the tasks assigned to him/her may not maximize his/her benefit. Contrarily, worker-centric mobile crowdsensing (WCMCS), where workers autonomously select tasks to accomplish to maximize their benefits, does not receive enough attention. The workers in WCMCS can maximize their benefits, but the requester in WCMCS will suffer benefit damage (cannot maximize the number of expected completed tasks). It is hard to maximize the number of expected completed tasks in WCMCS, because some tasks may be selected by no workers, while others may be selected by many workers. In this paper, we apply task bundling to address this issue, and we formulate a novel task bundling problem in WCMCS with the objective of maximizing the number of expected completed tasks. To solve this problem, we design an algorithm named LocTrajBundling which bundles tasks based on the location of tasks and the trajectories of workers. Experimental results show that, compared with other algorithms, our algorithm can achieve a better performance in maximizing the number of expected completed tasks.