RESUMEN
To facilitate more accurate and explainable recommendation, it is crucial to incorporate side information into user-item interactions. Recently, knowledge graph (KG) has attracted much attention in a variety of domains due to its fruitful facts and abundant relations. However, the expanding scale of real-world data graphs poses severe challenges. In general, most existing KG-based algorithms adopt exhaustively hop-by-hop enumeration strategy to search all the possible relational paths, this manner involves extremely high-cost computations and is not scalable with the increase of hop numbers. To overcome these difficulties, in this article, we propose an end-to-end framework Knowledge-tree-routed UseR-Interest Trajectories Network (KURIT-Net). KURIT-Net employs the user-interest Markov trees (UIMTs) to reconfigure a recommendation-based KG, striking a good balance for routing knowledge between short-distance and long-distance relations between entities. Each tree starts from the preferred items for a user and routes the association reasoning paths along the entities in the KG to provide a human-readable explanation for model prediction. KURIT-Net receives entity and relation trajectory embedding (RTE) and fully reflects potential interests of each user by summarizing all reasoning paths in a KG. Besides, we conduct extensive experiments on six public datasets, our KURIT-Net significantly outperforms state-of-the-art approaches and shows its interpretability in recommendation.
RESUMEN
Currently, there are various works presented in the literature regarding the activity recognition based on WiFi. We observe that existing public data sets do not have enough data. In this work, we present a data augmentation method called window slicing. By slicing the original data, we get multiple samples for one raw datum. As a result, the size of the data set can be increased. On the basis of the experiments performed on a public data set and our collected data set, we observe that the proposed method assists in improving the results. It is notable that, on the public data set, the activity recognition accuracy improves from 88.13% to 97.12%. Similarly, the recognition accuracy is also improved for the data set collected in this work. Although the proposed method is simple, it effectively enhances the recognition accuracy. It is a general channel state information (CSI) data augmentation method. In addition, the proposed method demonstrates good interpretability.
Asunto(s)
Actividades Humanas , HumanosRESUMEN
To implement minimum power consumption of the link, cluster heads adopt the multi-hop manner for inter-cluster communication so as to forward the aggregation data to the relay nodes. This paper proposes a collaborative data aggregation in emerging sensor networks using a bio-level Voronoi diagram, which is an energy-efficient data aggregation protocol that integrates topology control, Multiple Access Control (MAC) and routing. The sensor nodes situated in the lower level of the diagram are responsible for listening and gathering data, and should be organized by optimal clustering node. In the inter-cluster communication stage, a particle swarm optimization algorithm is addressed to seek optimal transmission path which could simultaneously achieve the minimization of the maximum next hop distance between two nodes in the routing path and the minimization of the maximum hop count, so the minimization of whole network energy consumption is realized. The results of theoretical analysis and simulation results show that energy efficiency and synchronization accuracy of the proposed algorithm can be much better than with traditional routing protocols, and the energy consumption of nodes in the whole network can be more balanced.
RESUMEN
Collaborative strategies for mobile sensor nodes ensure the efficiency and the robustness of data processing, while limiting the required communication bandwidth. In order to solve the problem of pipeline inspection and oil leakage monitoring, a collaborative weighted mobile sensing scheme is proposed. By adopting a weighted mobile sensing scheme, the adaptive collaborative clustering protocol can realize an even distribution of energy load among the mobile sensor nodes in each round, and make the best use of battery energy. A detailed theoretical analysis and experimental results revealed that the proposed protocol is an energy efficient collaborative strategy such that the sensor nodes can communicate with a fusion center and produce high power gain.
RESUMEN
The minimum spanning tree (MST) problem is to find minimum edge connected subsets containing all the vertex of a given undirected graph. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications. Moreover in previous studies, DNA molecular operations usually were used to solve NP-complete head-to-tail path search problems, rarely for NP-hard problems with multi-lateral path solutions result, such as the minimum spanning tree problem. In this paper, we present a new fast DNA algorithm for solving the MST problem using DNA molecular operations. For an undirected graph with n vertex and m edges, we reasonably design flexible length DNA strands representing the vertex and edges, take appropriate steps and get the solutions of the MST problem in proper length range and O(3m+n) time complexity. We extend the application of DNA molecular operations and simultaneity simplify the complexity of the computation. Results of computer simulative experiments show that the proposed method updates some of the best known values with very short time and that the proposed method provides a better performance with solution accuracy over existing algorithms.
