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

An Extension of Least Angle Regression Based on the Information Geometry of Dually Flat Spaces

JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS 2010年第4期19卷 1007-1023页

作者： Hirose, Yoshihiro Komaki, Fumiyasu Univ Tokyo Dept Math Informat Grad Sch Informat Sci & Technol Bunkyo Ku Tokyo 1138656 Japan

We extend the least angle regression algorithm using the information geometry of dually flat spaces. The extended least angle regression algorithm is used for estimating parameters in generalized linear regression, and it can be also used for selecting explanatory variables. We use the fact that a model manifold of an exponential family is a dually flat space. In estimating parameters, curves corresponding to bisectors in the Euclidean space play an important role. Originally, the least angle regression algorithm is used for estimating parameters and selecting explanatory variables in linear regression. It is an efficient algorithm in the sense that the number of iterations is the same as the number of explanatory variables. We extend the algorithm while keeping this efficiency. However, the extended least angle regression algorithm differs significantly from the original algorithm. The extended least angle regression algorithm reduces one explanatory variable in each iteration while the original algorithm increases one explanatory variable in each iteration. We show results of the extended least angle regression algorithm for two types of datasets. The behavior of the extended least angle regression algorithm is shown. Especially, estimates of parameters become smaller and smaller, and vanish in turn.

关键词： Bisector Divergence Exponential family Generalized linear regression iterative algorithm Variable selection

来源：评论

学校读者我要写书评

暂无评论

Locality Preserving Projections algorithm Based on Improved iterative SelfOrganize Data Analysis

Locality Preserving Projections Algorithm Based on Improved ...

引用

Chinese Conference on Pattern Recognition (CCPR)

作者： Shu-liang Sun Shou-jue Wang Department of Electronics and Information Engineering University of Tongji Shanghai China Laboratory of Artificial Neural Networks Institute of Semiconductors Chinese Academy and Sciences Beijing China

The new locally preserving projections algorithm is proposed in this paper which is based on Bayesian criteria and adapted improved iterative self-organize data analysis. The experiment shows that the new algorithm can put forward the optimum number of dimensions and be more available than principle component analysis. That is because it takes into account the relation the number of between dimensions and classification. The new algorithm not only preserves the structure of original data and eliminates the correlation and redundancy of high dimension vectors.

关键词： Principal component analysis Electronic mail Data analysis iterative algorithm Classification algorithms algorithm design and analysis Projection algorithms

来源：评论

学校读者我要写书评

暂无评论

(H(., .), η)-accretive operators with an application for solving set-valued variational inclusions in Banach spaces

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 2010年第4期59卷 1559-1567页

作者： Wang, Zhong Bao Ding, Xie Ping Sichuan Univ Math Coll Chengdu 610064 Sichuan Peoples R China Sichuan Normal Univ Coll Math & Software Sci Chengdu 610066 Sichuan Peoples R China

In this paper, we introduce a new class of accretive operators-(H(., .), eta)-accretive operators, which generalize many existing monotone or accretive operators. The resolvent operator associated with an (H(., .), eta)-accretive operator is defined and its Lipschitz continuity is presented. By using the new resolvent operator technique, we also introduce and study a new class of set-valued variational inclusions involving (H(., .), eta)-accretive operators and construct a new algorithm for solving this class of set-valued variational inclusions. These results are new, and improve and generalize many known corresponding results. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： (H(., .), eta)-accretive operators Resolvent operator Variational inclusions iterative algorithm Banach spaces

来源：评论

学校读者我要写书评

暂无评论

ECT image reconstruction based on the generalized vector sampled pattern matching method

ECT image reconstruction based on the generalized vector sam...

引用

6th International Symposium on Precision Engineering Measurements and Instrumentation

作者： Liu, Yonghong Zhao, Yuan Peng, Yonghui Yanshan Univ Key Lab Measurement Technol & Instrument Hebei Pr Qinhuangdao 066004 Peoples R China

ISBN: (纸本)9780819479402

Electrical capacitance tomography (ECT) is a new technology for testing parameters of solid-air two-phase flow during the past decades. The key technique of ECT is the fast and accurate image reconstruction. In this paper, the principle and measuring process of ECT were elaborated, the reconstruction algorithm called generalized vector sampled pattern matching (GVSPM) method was used in two-phase flow particle concentration visualization. GVSPM method achieves accurate reconstruction by using an objective function that is calculated as the inner product calculation between the experimental capacitance and the reconstructed image capacitance. Mathematica simulation results showed that this method proved superior in the three parameters of capacitance residual, image error and image correlation, compared with the linear back projection (LBP) method. Using the GVSPM method, the "soft-field" effect and the ill-posed inverse problem in ECT technology can be effectively conquered, meanwhile, the reconstructed image has the advantages of high spatial resolution and low distortion.

关键词： electrical capacitance tomography GVSPM image reconstruction iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

Transmit Rate Control for Energy-efficient Estimation in Wireless Sensor Networks

Transmit Rate Control for Energy-efficient Estimation in Wir...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Koutsopoulos, Iordanis Stanczak, Slawomir Feistel, Angela Univ Thessaly Volos Greece Ctr Res & Technol Hellas Volos Greece Fraunhofer German Sino Lab Mobile Commun Berlin Germany Tech Univ Berlin Fac EECS Heinrich Hertz Chair Berlin Germany

ISBN: (纸本)9781424456383

We study the impact of physical layer (PHY) transmit rate control on energy efficient estimation in wireless sensor networks. A sensor network collects measurements and transmits them to a Fusion Center (FC) with controllable PHY transmission rates. The FC performs estimation of an unknown parameter process based on sensor measurements, and it needs to adhere to an estimation error constraint. The objective is to maximize network lifetime. High transmission rates consume more energy per transmitted bit, however they convey larger amount of data per unit time and thus can aid in satisfying the estimation error constraint. We identify basic structural properties of the optimal solution, and we propose an iterative algorithm for reaching a solution based on light-weight feedback from the FC.

关键词： controllable PHY transmission rate energy-efficient estimation estimation error constraint fusion center iterative algorithm physical layer transmit rate control sensor measurement telecommunication congestion control wireless sensor network wireless sens

来源：评论

学校读者我要写书评

暂无评论

iterative algorithms for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of families and semigroups of nonexpansive mappings

引用

NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS 2009年第12期70卷 4195-4208页

作者： Saeidi, Shahram Univ Kurdistan Dept Math Kurdistan Iran

We introduce iterative algorithms for finding a common element of the set of solutions of a system of equilibrium problems and of the set of fixed points of a finite family and a left amenable semigroup of nonexpansive mappings in a Hilbert space. We prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. Our results extend, for example, the recent result of [V. Colao, G. Marino, H.K. Xu, An iterative Method for finding common solutions of equilibrium and fixed point problems, J. Math. Anal. Appl. 344 (2008) 340-352] to systems of equilibrium problems. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： Amenable semigroup Common fixed point Equilibrium problem iterative algorithm Nonexpansive mapping Projection Variational inequality Viscosity approximation

来源：评论

学校读者我要写书评

暂无评论

The New Interference Alignment Scheme for the MIMO Interference Channel

The New Interference Alignment Scheme for the MIMO Interfere...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Shen, Hui Li, Bin Tao, Meixia Luo, Yi Dept. Wireless Research Huawei Technologies China Dept. of Electronic Engineering Shanghai Jiao Tong University China

ISBN: (纸本)9781424463985

In this paper, we propose a new interference alignment (IA) scheme designing jointly the linear transmitter and receiver for the MIMO interference channel system, using minimum total mean square error criterion, subject to individual transmit power constraints. We show that transmitter and receiver under such criterion could be realized through a joint iterative algorithm. The convergence of the proposed algorithm is discussed. We also proposed a robust MMSE-based iterative design with imperfect channel state information (CSI). The proposed robust MMSE-based iterative interference alignment scheme is shown to be less sensitive to channel estimation errors. Simulation results show that the proposed schemes outperform the existing IA schemes with fast convergence.

关键词： MIMO interference channel interference alignment joint transceiver iterative algorithm robust

来源：评论

学校读者我要写书评

暂无评论

Optimal Beamforming in MIMO Two-Way Relay Channels

Optimal Beamforming in MIMO Two-Way Relay Channels

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Wang, Xiyuan Zhang, Xian-Da Tsinghua Univ State Key Lab Intelligent Technol & Syst Tsinghua Natl Lab Informat Sci & Technol Dept Automat Beijing 100084 Peoples R China

ISBN: (纸本)9781424456383

In this paper, the optimal analog network coding strategy (or relay beamforming) in MIMO two-way relay channels is studied. The weighted sum rate is used as the optimization criterion. Motivated by the classic Arimoto-Blahut algorithm, an iterative algorithm, which monotonically improves the cost function, is designed to update the relay beamformer. This relay beamforming algorithm is further extended to the case of joint source and relay beamforming. We show that in the iteration of the algorithms, the updates of the relay beamforming matrix and the source beamforming matrices are accomplished by solving a series of quadratic programs and quadratically constrained quadratic programs, which are of low complexity. Simulations are presented to compare the proposed algorithms with the performance upper bounds and the existing algorithms.

关键词： Arimoto-Blahut algorithm MIMO MIMO communication array signal processing iterative algorithm iterative methods optimal analog network coding optimal beamforming relay beamforming telecommunication channels two-way relay channels weighted sum rate

来源：评论

学校读者我要写书评

暂无评论

A Novel iterative Interference Alignment Scheme Via Convex Optimization for the MIMO Interference Channel

A Novel Iterative Interference Alignment Scheme Via Convex O...

引用

IEEE 72nd Vehicular Technology Conference Fall 2010

作者： Shen, Hui Li, Bin Huawei Technol Dept Commun Technol Res Shenzhen Peoples R China

ISBN: (纸本)9781424435746

In this paper, we propose a novel interference alignment (IA) scheme via convex optimization based on minimum mean square error criterion subject to individual transmit power constraints for the MIMO interference channel system. We show that transceiver under such criterion can be realized through an efficient iterative algorithm. The convergence of the proposed algorithm is discussed. Simulation results show that the proposed scheme outperforms the existing IA schemes with fast convergence.

关键词： MIMO interference channel interference alignment convex optimization iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

saddle-point equilibrium of dynamic game for bilinear system

saddle-point equilibrium of dynamic game for bilinear system

引用

International Conference on Innovative Computing and Communication/Asia-Pacific Conference on Information Technology and Ocean Engineering

作者： Sun, Pei-hong Tang, Lei Kuang, Xiao-lei Guangdong Univ Technol Sch Econ & Management Guangzhou 510520 Guangdong Peoples R China Coll Business Management Inner Mongolia Hohhot 010051 Peoples R China Finance & Econ Coll Hohhot 010051 Peoples R China Finance & Econ Coll Network Ctr Inner Mongolia Hohhot 010051 Peoples R China

ISBN: (纸本)9780769539423

In this paper, saddle point equilibrium problem of the bilinear quadratic performance index dynamic game will be discussed from the basic saddle point equilibrium strategy of the game theory, by introducing a proper transformation, transforming the bilinear systems of nonlinear two points boundary value problem into a "separation" form of the linear two-point boundary, and then finding the saddle-point iteration method using equilibrium strategies.

关键词： saddle-point equilibrium iterative algorithm dynamic game

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：