6,022 research outputs found
Posterior Contraction Rates of the Phylogenetic Indian Buffet Processes
By expressing prior distributions as general stochastic processes,
nonparametric Bayesian methods provide a flexible way to incorporate prior
knowledge and constrain the latent structure in statistical inference. The
Indian buffet process (IBP) is such an example that can be used to define a
prior distribution on infinite binary features, where the exchangeability among
subjects is assumed. The phylogenetic Indian buffet process (pIBP), a
derivative of IBP, enables the modeling of non-exchangeability among subjects
through a stochastic process on a rooted tree, which is similar to that used in
phylogenetics, to describe relationships among the subjects. In this paper, we
study the theoretical properties of IBP and pIBP under a binary factor model.
We establish the posterior contraction rates for both IBP and pIBP and
substantiate the theoretical results through simulation studies. This is the
first work addressing the frequentist property of the posterior behaviors of
IBP and pIBP. We also demonstrated its practical usefulness by applying pIBP
prior to a real data example arising in the field of cancer genomics where the
exchangeability among subjects is violated
Somoclu: An Efficient Parallel Library for Self-Organizing Maps
Somoclu is a massively parallel tool for training self-organizing maps on
large data sets written in C++. It builds on OpenMP for multicore execution,
and on MPI for distributing the workload across the nodes in a cluster. It is
also able to boost training by using CUDA if graphics processing units are
available. A sparse kernel is included, which is useful for high-dimensional
but sparse data, such as the vector spaces common in text mining workflows.
Python, R and MATLAB interfaces facilitate interactive use. Apart from fast
execution, memory use is highly optimized, enabling training large emergent
maps even on a single computer.Comment: 26 pages, 9 figures. The code is available at
https://peterwittek.github.io/somoclu
Data-Gathering and Aggregation Protocol for Networked Carrier Ad Hoc Networks: The Optimal and Heuristic Approach
In this chapter, we address the problem of data-gathering and aggregation (DGA) in navigation carrier ad hoc networks (NC-NET), in order to reduce energy consumption and enhance network scalability and lifetime. Several clustering algorithms have been presented for vehicle ad hoc network (VANET) and other mobile ad hoc network (MANET). However, DGA approach in harsh environments, in terms of long-range transmission, high dynamic topology and three-dimensional monitor region, is still an open issue. In this chapter, we propose a novel clustering-based DGA approach, namely, distributed multiple-weight data-gathering and aggregation (DMDG) protocol, to guarantee quality of service (QoS)-aware DGA for heterogeneous services in above harsh environments. Our approach is explored by the synthesis of three kernel features. First, the network model is addressed according to specific conditions of networked carrier ad hoc networks (NC-NET), and several performance indicators are selected. Second, a distributed multiple-weight data-gathering and aggregation protocol (DMDG) is proposed, which contains all-sided active clustering scheme and realizes long-range real-time communication by tactical data link under a time-division multiple access/carrier sense multiple access (TDMA/CSMA) channel sharing mechanism. Third, an analytical paradigm facilitating the most appropriate choice of the next relay is proposed. Experimental results have shown that DMDG scheme can balance the energy consumption and extend the network lifetime notably and outperform LEACH, PEACH and DEEC in terms of network lifetime and coverage rate, especially in sparse node density or anisotropic topologies
3D Room Layout Estimation from a Cubemap of Panorama Image via Deep Manhattan Hough Transform
Significant geometric structures can be compactly described by global
wireframes in the estimation of 3D room layout from a single panoramic image.
Based on this observation, we present an alternative approach to estimate the
walls in 3D space by modeling long-range geometric patterns in a learnable
Hough Transform block. We transform the image feature from a cubemap tile to
the Hough space of a Manhattan world and directly map the feature to the
geometric output. The convolutional layers not only learn the local
gradient-like line features, but also utilize the global information to
successfully predict occluded walls with a simple network structure. Unlike
most previous work, the predictions are performed individually on each cubemap
tile, and then assembled to get the layout estimation. Experimental results
show that we achieve comparable results with recent state-of-the-art in
prediction accuracy and performance. Code is available at
https://github.com/Starrah/DMH-Net.Comment: Accepted by ECCV 202
Supplement to Minimax Estimation in Sparse Canonical Correlation Analysis
In this appendix, we prove Theorem 4 and Lemmas 7-12 in order
- …