Clustering analysis is a basic and essential method for mining heterogeneous information networks, which consist of multiple types of objects and rich semantic relations among different object types. Heterogeneous information networks are ubiquitous in the real-world applications, such as bibliographic networks and social media networks. Unfortunately, most existing approaches, such as spectral clustering, are designed to analyze homogeneous information networks, which are composed of only one type of objects and links. Some recent studies focused on heterogeneous information networks and yielded some research fruits, such as RankClus and NetClus. However, they often assumed that the heterogeneous information networks usually follow some simple schemas, such as bityped network schema or star network schema. To overcome the above limitations, we model the heterogeneous information network as a tensor without the restriction of network schema. Then, a tensor CP decomposition method is adapted to formulate the clustering problem in heterogeneous information networks. Further, we develop two stochastic gradient descent algorithms, namely, SGDClus and SOSClus, which lead to effective clustering multityped objects simultaneously. The experimental results on both synthetic datasets and real-world dataset have demonstrated that our proposed clustering framework can model heterogeneous information networks efficiently and outperform state-of-the-art clustering methods.

Participatory sensing is a crowdsourcing-based framework, where the platform executes the sensing requests with the help of many common peoples handheld devices (typically smartphones). In this paper, we mainly address the online sensing request admission and smartphone selection problem to maximize the profit of the platform, taking into account the queue backlog, and the location of sensing requests and smartphones. First, we formulate this problem as a discrete time model and design a location aware online admission and selection control algorithm (LAAS) based on the Lyapunov optimization technique. The LAAS algorithm only depends on the currently available information and makes all the control decisions independently and simultaneously. Next, we utilize the recent advancement of the accurate prediction of smartphones mobility and sensing request arrival information in the next few time slots and develop a predictive location aware admission and selection control algorithm (PLAAS). We further design a greedy predictive location aware admission and selection control algorithm (GPLAAS) to achieve the online implementation of PLAAS approximately and iteratively. Theoretical analysis shows that under any control parameter V > 0, both LAAS and PLAAS algorithm can achieve O(1/V)-optimal average profit, while the sensing request backlog is bounded by O(V). Extensive numerical results based on both synthetic and real trace show that LAAS outperforms the Greedy algorithm and Random algorithm and GPLAAS improves the profit-backlog tradeoff over LAAS.

The heterogeneous information networks are omnipresent in real‐world applications, which consist of multiple types of objects with various rich semantic meaningful links among them. Community discovery is an effective method to extract the hidden structures in networks. Usually, heterogeneous information networks are time‐evolving, whose objects and links are dynamic and varying gradually. In such time‐evolving heterogeneous information networks, community discovery is a challenging topic and quite more difficult than that in traditional static homogeneous information networks. In contrast to communities in traditional approaches, which only contain one type of objects and links, communities in heterogeneous information networks contain multiple types of dynamic objects and links. Recently, some studies focus on dynamic heterogeneous information networks and achieve some satisfactory results. However, they assume that heterogeneous information networks usually follow some simple schemas, such as bityped network and star network schema. In this paper, we propose a multityped community discovery method for time‐evolving heterogeneous information networks with general network schemas. A tensor decomposition framework, which integrates tensor CP factorization with a temporal evolution regularization term, is designed to model the multityped communities and address their evolution. Experimental results on both synthetic and real‐world datasets demonstrate the efficiency of our framework.

(1) Background: Chinese news text is a popular form of media communication, which can be seen everywhere in China. Chinese news text classification is an important direction in natural language processing (NLP). How to use high-quality text classification technology to help humans to efficiently organize and manage the massive amount of web news is an urgent problem to be solved. It is noted that the existing deep learning methods rely on a large-scale tagged corpus for news text classification tasks and this model is poorly interpretable because the size is large. (2) Methods: To solve the above problems, this paper proposes a Chinese news text classification method based on key feature enhancement named KFE-CNN. It can effectively expand the semantic information of key features to enhance sample data and then combine the zero–one binary vector representation to transform text features into binary vectors and input them into CNN model for training and implementation, thus improving the interpretability of the model and effectively compressing the size of the model. (3) Results: The experimental results show that our method can significantly improve the overall performance of the model and the average accuracy and F₁-score of the THUCNews subset of the public dataset reached 97.84% and 98%. (4) Conclusions: this fully proved the effectiveness of the KFE-CNN method for the Chinese news text classification task and it also fully demonstrates that key feature enhancement can improve classification performance.

The core challenge of the Unique Continuity (UC) problem lies in inferring solutions across an entire domain using limited observational data, holding significant practical implications for multiphysics coupled models. Recently, physics-informed neural networks (PINNs) have shown considerable promise in addressing the UC problem. However, the reliance on a fixed activation function and a fixed weighted loss function prevents PINNs from adequately representing the multiphysics characteristics embedded in coupled models. To overcome these limitations, we propose a novel dual adaptive neural network (DANN) algorithm. This approach integrates trainable adaptive activation functions and an adaptively weighted loss scheme, enabling the network to dynamically balance the observational data and governing physics. Our method is applicable not only to the UC problem but also to general forward problems governed by partial differential equations. Furthermore, we provide a theoretical foundation for the algorithm by deriving a generalization error estimate, discussing the potential causes of neural networks solving this problem. Extensive numerical experiments including 3D demonstrate the superior accuracy and effectiveness of the proposed DANN framework in solving the UC problem compared to standard PINNs.

The problem of scheduling multiple tasks for Unmanned Aerial Vehicles (UAV) to perform is a NP-hard problem especially in uncertain environment. It is well-known that different scheduling orders for UAV performing multitask will result in different incomes. In accordance, with the characteristics above, this paper proposes a markov state transition tasks scheduling model based on the feature of the task implementation. Then it deduces the cost and income of the task scheduling for acquiring an optimality criterion whose descending order is the optimal scheduling sequence. After that, the optimality of the policy is proved by simulation. Finally we compare our algorithm with the greedy search and the genetic algorithm which shows that the theoretical goal is consistent with the experimental results.