Modern smart environments pose several challenges, among which the design of intelligent algorithms aimed to assist the users. When a variety of points of interest are available, for instance, trajectory recommendations are needed to suggest users the most suitable itineraries based on their interests and contextual constraints. Unfortunately, in many cases, these interests must be explicitly requested and their lack causes the so‐called cold‐start problem. Moreover, lengthy travelling distances and excessive crowdedness of specific points of interest make itinerary planning more difficult. To address these aspects, a multi‐agent itinerary suggestion system that aims at assisting the users in an online and collaborative way is proposed. A profiling agent is responsible for the detection of groups of users whose movements are characterised by similar semantic, spatial and temporal features; then, a recommendation agent leverages contextual information and dynamically associates the current user with the trajectory clusters according to a Multi‐Armed Bandit policy. Framing the trajectory recommendation as a reinforcement learning problem permits to provide high‐quality suggestions while avoiding both cold‐start and preference elicitation issues. The effectiveness of the approach is demonstrated by some deployments in real‐life scenarios, such as smart campuses and theme parks.

A special recurrent neural network (RNN), that is the zeroing neural network (ZNN), is adopted to find solutions to time‐varying quadratic programming (TVQP) problems with equality and inequality constraints. However, there are some weaknesses in activation functions of traditional ZNN models, including convex restriction and redundant formulation. With the aid of different activation functions, modified ZNN models are obtained to overcome the drawbacks for solving TVQP problems. Theoretical and experimental research indicate that the proposed models are better and more effective at solving such TVQP problems.

In the era of automatic task processing or designing complex algorithms, to analyse data, it is always pertinent to find real‐life solutions using cutting‐edge tools and techniques to generate insights into the data. The data‐driven machine learning models are now offering more or less worthy results when they are certainly balanced in the input data sets. Imbalanced data occurs when an unequal distribution of classes occurs in the input datasets. Building a predictive model on the imbalanced data set would cause a model that appears to yield high accuracy but does not generalize well to the new data in the minority class. Now the time has come to look into the datasets which are not so‐called ‘balanced’ in nature but such datasets are generally encountered frequently in a workspace. To prevent creating models with false levels of accuracy, the imbalanced data should be rearranged before creating a predictive model. Those data are, sometimes, voluminous, heterogeneous and complex in nature and generate from different autonomous sources with distributed and decentralized control. The driving force is to efficiently handle these data sets using latest tools and techniques for research and commercial insights. The present article provides different such tools and techniques, in different computing frameworks, to handle such Internet of Things and other related datasets to review common techniques for handling imbalanced data in data ecosystems and offers a comparative data modelling framework in Keras for balanced and imbalanced datasets.

Relation extraction between entity pairs is an increasingly critical area in natural language processing. Recently, the pre‐trained bidirectional encoder representation from transformer (BERT) performs excellently on the text classification or sequence labelling tasks. Here, the high‐level syntactic features that consider the dependency between each word and the target entities into the pre‐trained language models are incorporated. Our model also utilizes the intermediate layers of BERT to acquire different levels of semantic information and designs multi‐granularity features for final relation classification. Our model offers a momentous improvement over the published methods for the relation extraction on the widely used data sets.

Early diagnosis of breast cancer, the most common disease among women around the world, increases the chance of treatment and is highly important. Nuclear atypia grading in histopathological images plays an important role in the final diagnosis and grading of breast cancer. Grading images by pathologists is a time consuming and subjective task. Therefore, the existence of a computer‐aided system for nuclear atypia grading is very useful and necessary. In this study, two automatic systems for grading nuclear atypia in breast cancer histopathological images based on deep learning methods are proposed. A patch‐based approach is introduced due to the large size of the histopathological images and restriction of the training data. In the proposed system I, the most important patches in the image are detected first and then a three‐hidden‐layer convolutional neural network (CNN) is designed and trained for feature extraction and to classify the patches individually. The proposed system II is based on a combination of the CNN for feature extraction and a two‐layer Long short‐term memory (LSTM) network for classification. The LSTM network is utilised to consider all patches of an image simultaneously for image grading. The simulation results show the efficiency of the proposed systems for automatic nuclear atypia grading and outperform the current related studies in the literature.