检索结果-内蒙古大学图书馆

Interpreting multi-variate models with setPCA

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Aouni, Nordine Linders, Luc Robinson, David Vandelaer, Len Wiezorek, Jessica Gupta, Geetesh Cavill, Rachel Department of Data Science and Knowledge Engineering Maastricht University Netherlands

Principal Component Analysis (PCA) and other multi-variate models are often used in the analysis of "omics" data. These models contain much information which is currently neither easily accessible nor interpretable. Here we present an algorithmic method which has been developed to integrate this information with existing databases of background knowledge, stored in the form of known sets (for instance genesets or pathways). To make this accessible we have produced a Graphical User Interface (GUI) in Matlab which allows the overlay of known set information onto the loadings plot and thus improves the interpretability of the multi-variate model. For each known set the optimal convex hull, covering a subset of elements from the known set, is found through a search algorithm and displayed. In this paper we discuss two main topics;the details of the search algorithm for the optimal convex hull for this problem and the GUI interface which is freely available for download for academic use. © 2021, CC BY-NC-SA.

关键词： Graphical user interfaces

Semantic SLAM Based on Compensated Segmentation and Geometric Constraints in Dynamic Environments

学校读者我要写书评

暂无评论

Semantic SLAM Based on Compensated Segmentation and Geometri...

Artificial Intelligence Technology (ACAIT), Asian Conference on

作者： Baofu Fang Shuai Zhou Hao Wang School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) Hefei China

Most of the existing slam algorithms are designed based on the assumption of a static environment, this strong assumption limits the practical application of most slam systems. The main reason is that moving objects will cause feature mismatch in the pose estimation process, which in turn affects the accuracy of localization and mapping. In this paper, we propose a SLAM algorithm in a dynamic environment. First, we use the BlendMask network to detect potential moving objects to generate masks for dynamic objects. The geometrically constrained joint optical flow method is used to detect dynamic feature points. Secondly, aiming at the failure of semantic segmentation network segmentation, a missed detection compensation algorithm based on the invariance of adjacent frame speed is proposed. Finally, a keyframe selection strategy is proposed to construct a semantic octree graph containing only static objects. We evaluate our algorithm on TUM RGB-D and real scene datasets. The experimental results show that the algorithm has high accuracy and real-time performance.

关键词：

TREC: transient redundancy elimination-based convolution 22

学校读者我要写书评

暂无评论

TREC: transient redundancy elimination-based convolution

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Jiawei Guan Feng Zhang Jiesong Liu Hsin-Hsuan Sung Ruofan Wu Xiaoyong Du Xipeng Shen Key Laboratory of Data Engineering and Knowledge Engineering (MOE) and School of Information Renmin University of China Computer Science Department North Carolina State University

ISBN: (纸本)9781713871088

The intensive computations in convolutional neural networks (CNNs) pose challenges for resource-constrained devices; eliminating redundant computations from convolution is essential. This paper gives a principled method to detect and avoid transient redundancy, a type of redundancy existing in input data or activation maps and hence changing across inferences. By introducing a new form of convolution (TREC), this new method makes transient redundancy detection and avoidance an inherent part of the CNN architecture, and the determination of the best configurations for redundancy elimination part of CNN backward propagation. We provide a rigorous proof of the robustness and convergence of TREC-equipped CNNs. TREC removes over 96% computations and achieves 3.51× average speedups on microcontrollers with minimal (about 0.7%) accuracy loss.

关键词：

Broad-UNet: Multi-scale feature learning for nowcasting tasks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Fernández, Jesús García Mehrkanoon, Siamak Department of Data Science and Knowledge Engineering Maastricht University Netherlands

Weather nowcasting consists of predicting meteorological components in the short term at high spatial resolutions. Due to its influence in many human activities, accurate nowcasting has recently gained plenty of attention. In this paper, we treat the nowcasting problem as an image-to-image translation problem using satellite imagery. We introduce Broad-UNet, a novel architecture based on the core UNet model, to efficiently address this problem. In particular, the proposed Broad-UNet is equipped with asymmetric parallel convolutions as well as Atrous Spatial Pyramid Pooling (ASPP) module. In this way, The the Broad-UNet model learns more complex patterns by combining multi-scale features while using fewer parameters than the core UNet model. The proposed model is applied on two different nowcasting tasks, i.e. precipitation maps and cloud cover nowcasting. The obtained numerical results show that the introduced Broad-UNet model performs more accurate predictions compared to the other examined architectures. © 2021, CC BY-SA.

关键词： Weather forecasting

RGB-D SLAM Method Based on Feature Association in Dynamic Environment

学校读者我要写书评

暂无评论

RGB-D SLAM Method Based on Feature Association in Dynamic En...

Artificial Intelligence Technology (ACAIT), Asian Conference on

作者： Baofu Fang Hao Wang School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Hefei China

Simultaneous localization and mapping (SLAM) is one of the current research hotspots. However, in visual SLAM for dynamic environments, inaccurate detection of object motion states and incomplete dynamic region culling will lead to large localization errors. To address these issues, this paper proposes an RGB-D SLAM method based on feature association. The method has strongly correlated features in time and space according to the input image sequence. Using the moving probability of the feature points in the previous frame, the movement of the feature points in the current frame is calculated in combination with the dynamic corner points screened in the current frame. Then, the motion state of the object is determined according to the proportion of different feature points. Then combined with semantic information and object depth information, the fast search method is used to obtain accurate dynamic regions. Finally, the selected effective feature points are used to estimate the camera pose and establish a static map of the environment. This paper evaluates the robustness and accuracy of our method on the TUM dataset and real environment, and the results show that our method can significantly improve the system tracking effect and reduce the system tracking error compared with other SLAM methods in dynamic environments.

关键词：

Discovering Locally Maximal Bipartite Subgraphs

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Dürrschnabel, Dominik Hanika, Tom Stumme, Gerd Knowledge & Data Engineering Group University of Kassel Kassel Germany Interdisciplinary Research Center for Information System Design Kassel Germany

Induced bipartite subgraphs of maximal vertex cardinality are an essential concept for the analysis of graphs. Yet, discovering them in large graphs is known to be computationally hard. Therefore, we consider in this work a weaker notion of this problem, where we discard the maximality constraint in favor of inclusion maximality. Thus, we aim to discover locally maximal bipartite subgraphs. For this, we present three heuristic approaches to extract such subgraphs and compare their results to the solutions of the global problem. For the latter, we employ the algorithmic strength of fast SAT-solvers. Our three proposed heuristics are based on a greedy strategy, a simulated annealing approach, and a genetic algorithm, respectively. We evaluate all four algorithms with respect to their time requirement and the vertex cardinality of the discovered bipartite subgraphs on several benchmark *** Codes 90C27 Copyright © 2022, The Authors. All rights reserved.

关键词： Simulated annealing

Unsupervised machine translation on dravidian languages

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Koneru, Sai Liu, Danni Niehues, Jan Department of Data Science and Knowledge Engineering Maastricht University Netherlands

Unsupervised neural machine translation (UNMT) is beneficial especially for low resource languages such as those from the Dravidian family. However, UNMT systems tend to fail in realistic scenarios involving actual low resource languages. Recent works propose to utilize auxiliary parallel data and have achieved state-of-the-art results. In this work, we focus on unsupervised translation between English and Kannada, a low resource Dravidian language. We additionally utilize a limited amount of auxiliary data between English and other related Dravidian languages. We show that unifying the writing systems is essential in unsupervised translation between the Dravidian languages. We explore several model architectures that use the auxiliary data in order to maximize knowledge sharing and enable UNMT for distant language pairs. Our experiments demonstrate that it is crucial to include auxiliary languages that are similar to our focal language, Kannada. Furthermore, we propose a metric to measure language similarity and show that it serves as a good indicator for selecting the auxiliary languages. © 2021, CC BY.

关键词： Neural machine translation

Deep graph convolutional networks for wind speed prediction

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Stańczyk, Tomasz Mehrkanoon, Siamak Department of Data Science and Knowledge Engineering Maastricht University Netherlands

Wind speed prediction and forecasting is important for various business and management sectors. In this paper, we introduce new models for wind speed prediction based on graph convolutional networks (GCNs). Given hourly data of several weather variables acquired from multiple weather stations, wind speed values are predicted for multiple time steps ahead. In particular, the weather stations are treated as nodes of a graph whose associated adjacency matrix is learnable. In this way, the network learns the graph spatial structure and determines the strength of relations between the weather stations based on the historical weather data. We add a self-loop connection to the learnt adjacency matrix and normalize the adjacency matrix. We examine two scenarios with the self-loop connection setting (two separate models). In the first scenario, the self-loop connection is imposed as a constant additive. In the second scenario a learnable parameter is included to enable the network to decide about the self-loop connection strength. Furthermore, we incorporate data from multiple time steps with temporal convolution, which together with spatial graph convolution constitutes spatio-temporal graph convolution. We perform experiments on real datasets collected from weather stations located in cities in Denmark and the Netherlands. The numerical experiments show that our proposed models outperform previously developed baseline models on the referenced datasets. We provide additional insights by visualizing learnt adjacency matrices from each layer of our models. © 2021, CC BY-SA.

关键词： Convolution

The Mont Blanc of Twitter: Identifying Hierarchies of Outstanding Peaks in Social Networks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Stubbemann, Maximilian Stumme, Gerd Knowledge and Data Engineering Group University of Kassel Kassel Germany

The investigation of social networks is often hindered by their size as such networks often consist of at least thousands of vertices and edges. Hence, it is of major interest to derive compact structures that represent important connections of the original network. In this work, we derive such structures with orometric methods that are originally designed to identify outstanding mountain peaks and relationships between them. By adapting these methods to social networks, it is possible to derive family trees of important vertices. Our approach consists of two steps. We first apply a novel method for discarding edges that stand for weak connections. This is done such that the connectivity of the network is preserved. Then, we identify the important "peaks" in the network and the "key cols", i.e., the lower points that connect them. This gives us a compact network that displays which peaks are connected through which cols. Thus, a natural hierarchy on the peaks arises by the question which higher peak comes behind the col, yielding to chains of peaks with increasing heights. The resulting "line parent hierarchy" displays dominance relations between important vertices. We show that networks with hundreds or thousands of edges can be condensed to a small set of vertices and key connections between them. Copyright © 2021, The Authors. All rights reserved.

关键词：