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

The Journal of Machine Learning Research 2019年第1期20卷

作者： Tomoyuki Obuchi Yoshiyuki Kabashima Department of Mathematical and Computing Science Tokyo Institute of Technology Meguro-ku Tokyo Japan

An approximate method for conducting resampling in Lasso, the l1 penalized linear regression, in a semi-analytic manner is developed, whereby the average over the resampled datasets is directly computed without repeated numerical sampling, thus enabling an inference free of the statistical fluctuations due to sampling finiteness, as well as a significant reduction of computational time. The proposed method is based on a message passing type algorithm, and its fast convergence is guaranteed by the state evolution analysis, when covariates are provided as zero-mean independently and identically distributed Gaussian random variables. It is employed to implement bootstrapped Lasso (Bolasso) and stability selection, both of which are variable selection methods using resampling in conjunction with Lasso, and resolves their disadvantage regarding computational cost. To examine approximation accuracy and efficiency, numerical experiments were carried out using simulated datasets. Moreover, an application to a real-world dataset, the wine quality dataset, is presented. To process such real-world datasets, an objective criterion for determining the relevance of selected variables is also introduced by the addition of noise variables and resampling. MATLAB codes implementing the proposed method are distributed in (Obuchi, 2018).

关键词： bootstrap method lasso message passing algorithm replica method variable selection

来源：评论

学校读者我要写书评

暂无评论

A Low-Complexity Detection algorithm for Uplink NOMA System Based on Gaussian Approximation

A Low-Complexity Detection Algorithm for Uplink NOMA System ...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Tang, Zihan Wang, Jun Wang, Jintao Song, Jian Tsinghua Univ Tsinghua Natl Lab Informat Sci & Technol Beijing Peoples R China

ISBN: (纸本)9781509041831

LDS-OFDM and SCMA are two examples of non orthogonal multiple access (NOMA), which is considered to be a promising technology for next generation wireless communications due to its larger capacity region compared with orthogonal multiple access (OMA). Iterative receiver structure is used in these two systems to get better performance than the non-iterative receiver, but a direct implementation of iterative receiver with conventional message passing algorithm has a prohibitive computational complexity, especially when the system uses high order modulation. In this paper, Gaussian approximation is used to solve this problem, and can reduce the complexity of detector effectively. Simulation results demonstrate that the proposed Gaussian approximation based iterative receiver offers significant performance gains over the traditional non-iterative receiver structure. Even compared with the computationally intractable message passing based iterative receiver, the performance does not degrade much. This means that the proposed method offers a tradeoff between performance and complexity, and is a good candidate for future use in LDS-OFDM and SCMA systems.

关键词： LDS-OFDM message passing algorithm Gaussian approximation

来源：评论

学校读者我要写书评

暂无评论

Incorporating topological information for predicting robust cancer subnetwork markers in human protein-protein interaction network

引用

BMC BIOINFORMATICS 2016年第13-Sup期17卷 143-152页

作者： Khunlertgit, Navadon Yoon, Byung-Jun Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

Background: Discovering robust markers for cancer prognosis based on gene expression data is an important yet challenging problem in translational bioinformatics. By integrating additional information in biological pathways or a protein-protein interaction (PPI) network, we can find better biomarkers that lead to more accurate and reproducible prognostic predictions. In fact, recent studies have shown that, "modular markers," that integrate multiple genes with potential interactions can improve disease classification and also provide better understanding of the disease mechanisms. Results: In this work, we propose a novel algorithm for finding robust and effective subnetwork markers that can accurately predict cancer prognosis. To simultaneously discover multiple synergistic subnetwork markers in a human PPI network, we build on our previous work that uses affinity propagation, an efficient clustering algorithm based on a message-passing scheme. Using affinity propagation, we identify potential subnetwork markers that consist of discriminative genes that display coherent expression patterns and whose protein products are closely located on the PPI network. Furthermore, we incorporate the topological information from the PPI network to evaluate the potential of a given set of proteins to be involved in a functional module. Primarily, we adopt widely made assumptions that densely connected subnetworks may likely be potential functional modules and that proteins that are not directly connected but interact with similar sets of other proteins may share similar functionalities. Conclusions: Incorporating topological attributes based on these assumptions can enhance the prediction of potential subnetwork markers. We evaluate the performance of the proposed subnetwork marker identification method by performing classification experiments using multiple independent breast cancer gene expression datasets and PPI networks. We show that our method leads to the discovery of robu

关键词： Cancer classification Subnetwork marker identification Protein-protein interaction network message passing algorithm Topological information

来源：评论

学校读者我要写书评

暂无评论

Low-Energy Adaptive Clustering Hierarchy Using Affinity Propagation for Wireless Sensor Networks

引用

IEEE COMMUNICATIONS LETTERS 2016年第3期20卷 558-561页

作者： Sohn, Illsoo Lee, Jong-Ho Lee, Sang Hyun Gachon Univ Dept Elect Engn Songnam South Korea Sejong Univ Dept Elect Engn Seoul South Korea

This letter proposes a new low-energy adaptive clustering hierarchy (LEACH) protocol for wireless sensor networks that use a distributed cluster formation based on affinity propagation (AP). The proposed LEACH protocol (LEACH-AP) enables a fully distributed control and resolves practical limitations of conventional LEACH-based protocols by simplifying network functionalities and reducing sensor hardware costs. Simulation results show that the proposed protocol outperforms existing LEACH-based protocols considerably in terms of network lifetime, energy dissipation rate, and total number of transferred bits.

关键词： Wireless sensor network low-energy adaptive clustering hierarchy message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

The explicit form of expectation propagation for a simple statistical model

引用

ELECTRONIC JOURNAL OF STATISTICS 2016年第1期10卷 550-581页

作者： Kim, Andy S. I. Wand, M. P. Univ Technol Sydney Broadway 2007 Australia Australian Res Council Ctr Excellence Math & Stat Sch Math & Phys Sci Broadway 2007 Australia

We derive the explicit form of expectation propagation for approximate deterministic Bayesian inference in a simple statistical model. The model corresponds to a random sample from the Normal distribution. The explicit forms, and their derivation, allow a deeper understanding of the issues and challenges involved in practical implementation of expectation propagation for statistical analyses. No auxiliary approximations are used: we follow the expectation propagation prescription exactly. A simulation study shows expectation propagation to be more accurate than mean field variational Bayes for larger sample sizes, but at the cost of considerably more algebraic and computational effort.

关键词： Bayesian computing factor graph hierarchical Bayesian models message passing algorithm quadrature variational message passing

来源：评论

学校读者我要写书评

暂无评论

VLSI Implementation of a Rate Decoder for Structural LDPC Channel Codes 7

VLSI Implementation of a Rate Decoder for Structural LDPC Ch...

引用

7th International Conference on Communication, Computing and Virtualization (ICCCV)

作者： Kakde, Sandeep Khobragade, Atish YC Coll Engn Dept Elect Engn Nagpur 441110 Maharashtra India Rajiv Gandhi Coll Engn Dept Elect Engn Nagpur 441110 Maharashtra India

This paper proposes a low complexity low-density parity check decoder (LDPC) design. The design mainly accomplishes a message passing algorithm and systolic high throughput architecture. The typical mathematical calculations are based on the observation that nodes with high log likelihood ratio provide almost same information in every iteration and can be considered as stationary, we propose an algorithm in which the parity check matrix H is updated to a reduced complexity form every time a stationary node is encountered which results in lesser number of numerical computations in subsequent iterations. In this paper, we contemplately focuses on computational complexity and the decoder design significantly benefits from the high throughput point of view and the various improvisations introduced at various levels of abstraction in the decoder design. Threshold Controlled Min Sum algorithm implements the LDPC decoder design for a code compliant with wired and wireless applications. A high performance LDPC decoder has been designed that achieves a throughput of 0.890 Gbps. The whole design of LDPC Decoder is designed, simulated and synthesized using Xilinx ISE 13.1 EDA Tool. (c) 2016 The Authors. Published by Elsevier B.V.

关键词： High Throughput LDPC Decoder message passing algorithm Low Complexity

来源：评论

学校读者我要写书评

暂无评论

Factor Graph Approach for Joint Passive Localization and Receiver Synchronization in Wireless Sensor Networks 27

Factor Graph Approach for Joint Passive Localization and Rec...

引用

27th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

作者： Yuan, Weijie Wu, Nan Wang, Hua Kuang, Jingming Beijing Inst Technol Sch Informat & Elect Beijing Peoples R China

ISBN: (纸本)9781509032549

Obtaining the location of a "passive" target in wireless sensor networks has attracted numerous interest in recent years. This paper considers the passive localization based on time-of-arrival measurements in an asynchronous sensor network where the receivers are with both clock skew and offset. Based on the factor graph model, the beliefs (approximated marginal) of target location and clock parameters can be obtained by executing iterative message passing algorithms. To reduce the huge complexity of particle based method, we propose two approximate approaches to determine parametric Gaussian message passing. Simulation results show that the proposed low complexity algorithm performs close to the particle-based method and attain the Cramer-Rao bound.

关键词： Passive localization wireless sensor networks clock skew and offset factor graph message passing algorithm Cramer-Rao bound

来源：评论

学校读者我要写书评

暂无评论

A Low Complexity SCMA Decoder Based on List Sphere Decoding 59

A Low Complexity SCMA Decoder Based on List Sphere Decoding

引用

59th Annual IEEE Global Communications Conference (IEEE GLOBECOM)

作者： Wei, Fan Chen, Wen Shanghai Jiao Tong Univ Dept Elect Engn Shanghai Peoples R China

ISBN: (纸本)9781509013289

Non-orthogonal multiple access is one of the key techniques developed for the future 5G communication systems among which, the recent proposed sparse code multiple access (SCMA) has attracted a lots of researchers' interests. By exploring the shaping gain of the multi-dimensional complex codewords, SCMA is shown to have a better performance compared with some other non-orthogonal schemes such as low density signature (LDS). However, although the sparsity of the codewords makes the near optimal message passing algorithm (MPA) possible, the decoding complexity is still very high. In this paper, we propose a low complexity decoding algorithm based on list sphere decoding. Complexity analysis and simulation results show that the proposed algorithm can reduce the computational complexity substantially while achieve the near maximum likelihood (ML) performance.

关键词： 5G Non-orthogonal multiple access SCMA message passing algorithm list sphere decoder

来源：评论

学校读者我要写书评

暂无评论

An Optimized Superposition Constellation and Region- Restricted MPA Detector for LDS System

An Optimized Superposition Constellation and Region- Restric...

引用

IEEE International Conference on Communications (ICC)

作者： Tian, Lining Zhong, Jie Zhao, Minjian Wen, Lei Zhejiang Univ Dept Informat Sci & Elect Engn Hangzhou 310027 Zhejiang Peoples R China Univ Surrey Ctr Commun Syst Res Guildford GU2 7XH Surrey England

ISBN: (纸本)9781479966646

In the Low Density Signature (LDS) based multiple access systems, the constellation of chip symbols superposed by several users' symbols is named as superposition constellation. When LDS is applied into the downlink multiple access scenario, maximizing the minimum Euclidean distance of the superposition constellation will be a big challenge. In this paper, by optimizing the superposition constellation as square QAM, we propose a novel LDS matrix construction algorithm. Besides, the original message passing algorithm (MPA) detector for LDS system leads to high complexity which is a big problem for energy-sensitive user equipment. We propose a low complexity region-restricted MPA detector by restricting the search region to a quadrant-like part of the superposition constellation. The complexity of the new detector is reduced to 25%similar to 50% while performance in terms of bit error rate (BER) maintains almost the same. The theoretical analysis and simulation results further verify the effectiveness of our proposed algorithms.

关键词： low density signature superposition constellation message passing algorithm region-restricted reduced-complexity multiple access

来源：评论

学校读者我要写书评

暂无评论

message-passing-Based Dynamic Point Selection for Coordinated Multipoint Transmission

引用

IEEE COMMUNICATIONS LETTERS 2015年第10期19卷 1850-1853页

作者： Lee, Sang Hyun Sohn, Illsoo Sejong Univ Dept Informat & Commun Engn Seoul 143747 South Korea Gachon Univ Dept Elect Engn Songnam 461701 Gyeonggi Do South Korea

This letter develops a dynamic point selection strategy for coordinated multipoint transmission using a message-passing approach. The dynamic determination of the best transmit point for individual users with the objective of the sum-rate maximization can be cast as a bipartite b-matching problem, the computational cost of which, however, becomes quickly intractable with the increasing number of users. Therefore, this letter develops a message-passing algorithm that solves this computationally demanding challenge. Simulation results show that the proposed algorithm outperforms existing greedy-style approaches and provides a very efficient solution for the maximal sum-rate configuration.

关键词： Affinity propagation MIMO cooperative communication message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：