Jump to Main Content
PubAg
Main content area
Search
« Previous 
1  20 of 3,181

Next »
Search Results
 Author:
 Dyckerhoff, Rainer; Mozharovskyi, Pavlo
 Source:
 Computational statistics & data analysis 2016 v.98 pp. 1930
 ISSN:
 01679473
 Subject:
 algorithms
 Abstract:
 ... For computing the exact value of the halfspace depth of a point w.r.t. a data cloud of n points in arbitrary dimension, a theoretical framework is suggested. Based on this framework a whole class of algorithms can be derived. In all of these algorithms the depth is calculated as the minimum over a finite number of depth values w.r.t. proper projections of the data cloud. Three variants of this cla ...
 DOI:
 10.1016/j.csda.2015.12.011

http://dx.doi.org/10.1016/j.csda.2015.12.011
 Author:
 Lee, Sangin; Kwon, Sunghoon; Kim, Yongdai
 Source:
 Computational statistics & data analysis 2016 v.94 pp. 275286
 ISSN:
 01679473
 Subject:
 algorithms
 Abstract:
 ... In this paper, we propose an optimization algorithm called the modified local quadratic approximation algorithm for minimizing various ℓ1penalized convex loss functions. The proposed algorithm iteratively solves ℓ1penalized local quadratic approximations of the loss function, and then modifies the solution whenever it fails to decrease the original ℓ1penalized loss function. As an extension, we ...
 DOI:
 10.1016/j.csda.2015.08.019

http://dx.doi.org/10.1016/j.csda.2015.08.019
 Author:
 Kirschstein, T.; Liebscher, S.; Porzio, G.C.; Ragozini, G.
 Source:
 Computational statistics & data analysis 2016 v.93 pp. 456468
 ISSN:
 01679473
 Subject:
 algorithms
 Abstract:
 ... Among the measures of a distribution’s location, the mode is probably the least often used, although it has some appealing properties. Estimators for the mode of univariate distributions are widely available. However, few contributions can be found for the multivariate case. A consistent direct multivariate mode estimation procedure, called minimum volume peeling, can be outlined as follows. The a ...
 DOI:
 10.1016/j.csda.2015.04.012

http://dx.doi.org/10.1016/j.csda.2015.04.012
 Author:
 Xiang, Sijia; Yao, Weixin; Seo, Byungtae
 Source:
 Computational statistics & data analysis 2016 v.103 pp. 413425
 ISSN:
 01679473
 Subject:
 algorithms, etc ; models; Show all 2 Subject
 Abstract:
 ... In this article, we propose a new estimation procedure for a class of semiparametric mixture models that is a mixture of unknown locationshifted symmetric distributions. The proposed method assumes that the nonparametric symmetric distribution falls in a rich class of continuous normal scale mixture distributions. With this new modeling approach, we can suitably avoid the misspecification problem ...
 DOI:
 10.1016/j.csda.2016.06.001

http://dx.doi.org/10.1016/j.csda.2016.06.001
 Author:
 Wilson, Huon; Keich, Uri
 Source:
 Computational statistics & data analysis 2016 v.101 pp. 300315
 ISSN:
 01679473
 Subject:
 algorithms, etc ; probability; Show all 2 Subject
 Abstract:
 ... A novel method is presented for fast convolution of a pair of probability mass functions defined on a finite lattice with guaranteed accuracy of all computed values. This method, called aFFTC (accurate FFT convolution), utilizes the Fast Fourier Transform (FFT) for the gain in speed, but relying on a rigorous analysis of the propagation of roundoff error, it can detect and circumvent the accumula ...
 DOI:
 10.1016/j.csda.2016.03.010

http://dx.doi.org/10.1016/j.csda.2016.03.010
 Author:
 Both, F.; Adam, M.T.P.; Hariharan, A.; Dorner, V.; Lux, E.; Weinhardt, C.
 Source:
 Economics letters 2016 v.145 pp. 235238
 ISSN:
 01651765
 Subject:
 algorithms, etc ; economics; Show all 2 Subject
 Abstract:
 ... Experiments in the field of behavioral economics often require repeated matching of participants to groups over multiple periods. Perfect stranger matching requires that no two participants interact more than once during the experiment. Computing a sequence of perfect stranger matches is an NPhard problem that has received little attention in experimental economics literature beyond bruteforce a ...
 DOI:
 10.1016/j.econlet.2016.06.028

http://dx.doi.org/10.1016/j.econlet.2016.06.028
 Author:
 Schüssler, Rainer; Trede, Mark
 Source:
 Economics letters 2016 v.145 pp. 182185
 ISSN:
 01651765
 Subject:
 algorithms, etc ; economics; Show all 2 Subject
 Abstract:
 ... We construct minimumwidth confidence bands with a predefined nominal coverage from a finite set of sample paths. In contrast to the several heuristics suggested in the literature, our mixedinteger optimization algorithm calculates global minimumwidth pathwise confidence bands. For very large problems, our solution can be used as an approximation with a bounded and known gap to the globally opti ...
 DOI:
 10.1016/j.econlet.2016.06.013

http://dx.doi.org/10.1016/j.econlet.2016.06.013
 Author:
 Okumura, Yasunori
 Source:
 Economics letters 2016 v.143 pp. 111113
 ISSN:
 01651765
 Subject:
 algorithms, etc ; schools; Show all 2 Subject
 Abstract:
 ... We consider a situation where a student–school matching has already been temporarily decided, but unexpectedly the quotas of some schools are increased and/or some new schools enter. Furthermore, the school priority orders are allowed to be weak. We provide a polynomialtime algorithm to derive a student optimal stable matching under the profile of increased quotas that Pareto dominates the stable ...
 DOI:
 10.1016/j.econlet.2016.04.006

http://dx.doi.org/10.1016/j.econlet.2016.04.006
 Author:
 Ali, E.S.; Abd Elazim, S.M.; Abdelaziz, A.Y.
 Source:
 Energy 2016 v.116 pp. 445458
 ISSN:
 03605442
 Subject:
 algorithms, etc ; Myrmeleontidae; wind turbines; Show all 3 Subjects
 Abstract:
 ... Renewable sources can provide a clean and smart solution to the increased demands. Thus, Photovoltaic (PV) system and Wind Turbine (WT) are considered here as sources of Distributed Generation (DG). Allocation and sizing of DG have greatly affected on the system losses. This paper aims to propose Ant Lion Optimization Algorithm (ALOA) for optimal allocation and sizing of renewable DG sources in va ...
 DOI:
 10.1016/j.energy.2016.09.104

https://dx.doi.org/10.1016/j.energy.2016.09.104
 Author:
 Reser, Jared Edward
 Source:
 Physiology & behavior 2016 v.167 pp. 222237
 ISSN:
 00319384
 Subject:
 algorithms, etc ; brain; consciousness; memory; Show all 4 Subjects
 Abstract:
 ... This opinion article explores how sustained neural firing in association areas allows highorder mental representations to be coactivated over multiple perceptionaction cycles, permitting sequential mental states to share overlapping content and thus be recursively interrelated. The term “statespanning coactivity” (SSC) is introduced to refer to neural nodes that remain coactive as a group over ...
 DOI:
 10.1016/j.physbeh.2016.09.019

http://dx.doi.org/10.1016/j.physbeh.2016.09.019
 Author:
 Peng, Gongxin; Ji, Peifeng; Zhao, Fangqing
 Source:
 Genome biology 2016 v.17 no.1 pp. 232
 ISSN:
 1474760X
 Subject:
 algorithms, etc ; genes; prediction; transcriptome; Show all 4 Subjects
 Abstract:
 ... Most gene prediction methods detect coding sequences from transcriptome assemblies in the absence of closely related reference genomes. Such methods are of limited application due to high transcript fragmentation and extensive assembly errors, which may lead to redundant or false coding sequence predictions. We present inGAPCDG, which can construct fulllength and nonredundant coding sequences f ...
 DOI:
 10.1186/s130590161094x

https://dx.doi.org/10.1186/s130590161094x
 Author:
 Urnikyte, A.; Domarkiene, I.; Stoma, S.; Ambrozaityte, L.; Uktveryte, I.; Meskiene, R.; Kasiulevičius, V.; Burokiene, N.; Kučinskas, V.
 Source:
 BMC genetics 2016 v.17 no.1 pp. 64
 ISSN:
 14712156
 Subject:
 algorithms, etc ; databases; genes; genotyping; Show all 4 Subjects
 Abstract:
 ... BACKGROUND: Although copy number variation (CNV) has received much attention, knowledge about the characteristics of CNVs such as occurrence rate and distribution in the genome between populations and within the same population is still insufficient. In this study, Illumina 770 K HumanOmniExpress12 v1.0 (and v1.1) arrays were used to examine the diversity and distribution of CNVs in 286 unrelated ...
 DOI:
 10.1186/s1286301603736
 PubMed:
 27142071
 PubMed Central:
 PMC4855864

http://dx.doi.org/10.1186/s1286301603736
 Author:
 Lee, Jinhyuk; Seo, Kyoungwon
 Source:
 Economics letters 2016 v.149 pp. 6770
 ISSN:
 01651765
 Subject:
 algorithms, etc ; economics; models; Show all 3 Subjects
 Abstract:
 ... This paper examines the numerical properties of the nested fixedpoint algorithm (NFP) in the estimation of Berry et al. (1995) random coefficient logit demand model. Dubé et al. (2012) find the bound on the errors of the NFP estimates computed by contraction mappings (NFP/CTR) has the order of the square root of the inner loop tolerance. Under our assumptions, we theoretically derive an upper bou ...
 DOI:
 10.1016/j.econlet.2016.10.019

http://dx.doi.org/10.1016/j.econlet.2016.10.019
 Author:
 Cao, Yongxiu; Huang, Jian; Liu, Yanyan; Zhao, Xingqiu
 Source:
 Biometrics 2016 v.72 no.4 pp. 10861097
 ISSN:
 0006341X
 Subject:
 algorithms, etc ; biometry; models; Show all 3 Subjects
 Abstract:
 ... This article considers sieve estimation in the Cox model with an unknown regression structure based on right‐censored data. We propose a semiparametric pursuit method to simultaneously identify and estimate linear and nonparametric covariate effects based on B‐spline expansions through a penalized group selection method with concave penalties. We show that the estimators of the linear effects and ...
 DOI:
 10.1111/biom.12529

http://dx.doi.org/10.1111/biom.12529
 Author:
 Feng, Wenning; Sarkar, Abdhi; Lim, Chae Young; Maiti, Tapabrata
 Source:
 Biometrics 2016 v.72 no.4 pp. 11641172
 ISSN:
 0006341X
 Subject:
 algorithms, etc ; biometry; regression analysis; Show all 3 Subjects
 Abstract:
 ... We consider the problem of selecting covariates in a spatial regression model when the response is binary. Penalized likelihood‐based approach is proved to be effective for both variable selection and estimation simultaneously. In the context of a spatially dependent binary variable, an uniquely interpretable likelihood is not available, rather a quasi‐likelihood might be more suitable. We develop ...
 DOI:
 10.1111/biom.12525

http://dx.doi.org/10.1111/biom.12525
 Author:
 Joutsuka, Tatsuya; Morita, Akihiro
 Source:
 The Journal of physical chemistry 2016 v.120 no.43 pp. 1122911238
 ISSN:
 15205207
 Subject:
 algorithms, etc ; molecular dynamics; spectroscopy; Show all 3 Subjects
 Abstract:
 ... Difference spectroscopy between two close systems is widely used to augment its selectivity to the different parts of the observed system, though the molecular dynamics calculation of tiny difference spectra would be computationally extraordinary demanding by subtraction of two spectra. Therefore, we have proposed an efficient computational algorithm of difference spectra without resorting to the ...
 DOI:
 10.1021/acs.jpcb.6b07121

http://dx.doi.org/10.1021%2Facs.jpcb.6b07121
 Author:
 Zou, Dexuan; Li, Steven; Wang, GaiGe; Li, Zongyan; Ouyang, Haibin
 Source:
 Applied energy 2016 v.181 pp. 375390
 ISSN:
 03062619
 Subject:
 algorithms, etc ; mutants; mutation; Show all 3 Subjects
 Abstract:
 ... This paper presents an improved differential evolution (IDE) algorithm for economic load dispatch (ELD) problems with or without valvepoint effects (VPE). The proposed IDE is different from the traditional differential evolution (DE) algorithm in three aspects: first, two mutation operators are used to generate mutant vectors; second, a dynamical crossover rate is used to update trail vectors; th ...
 DOI:
 10.1016/j.apenergy.2016.08.067

https://dx.doi.org/10.1016/j.apenergy.2016.08.067
 Author:
 El Assaad, Hani; Samé, Allou; Govaert, Gérard; Aknin, Patrice
 Source:
 Computational statistics & data analysis 2016 v.103 pp. 206228
 ISSN:
 01679473
 Subject:
 algorithms, etc ; models; statistical analysis; Show all 3 Subjects
 Abstract:
 ... The problem of temporal data clustering is addressed using a dynamic Gaussian mixture model. In addition to the missing clusters used in the classical Gaussian mixture model, the proposed approach assumes that the means of the Gaussian densities are latent variables distributed according to random walks. The parameters of the proposed algorithm are estimated by the maximum likelihood approach. How ...
 DOI:
 10.1016/j.csda.2016.05.007

http://dx.doi.org/10.1016/j.csda.2016.05.007
 Author:
 Ge, Xuming
 Source:
 ISPRS journal of photogrammetry and remote sensing 2016 v.121 pp. 192202
 ISSN:
 09242716
 Subject:
 algorithms, etc ; deformation; image analysis; Show all 3 Subjects
 Abstract:
 ... An algorithm for pairwise nonrigid registration of 3D point clouds is presented in the specific context of isometric deformations. The critical step is registration of point clouds at different epochs captured from an isometric deformation surface within overlapping regions. Based on characteristics invariant under isometric deformation, a variant of the fourpoint congruent sets algorithm is app ...
 DOI:
 10.1016/j.isprsjprs.2016.09.009

https://dx.doi.org/10.1016/j.isprsjprs.2016.09.009
 Author:
 Wu, K.Y.K.; Li, W.K.
 Source:
 Computational statistics & data analysis 2016 v.103 pp. 1727
 ISSN:
 01679473
 Subject:
 algorithms, etc ; linear models; probability; Show all 3 Subjects
 Abstract:
 ... Dispersion regression is often used to predict the expected deviance in a generalised linear model. Using the individual deviance residual as the response variable in that model is considered the standard approach in dispersion modelling. In this paper, we investigate an alternative approach by fitting the dispersion model on the individual Pearson residual responses, which is more straightforward ...
 DOI:
 10.1016/j.csda.2016.04.015

http://dx.doi.org/10.1016/j.csda.2016.04.015