Search results for "square"
showing 10 items of 1317 documents
Least-squares community extraction in feature-rich networks using similarity data
2021
We explore a doubly-greedy approach to the issue of community detection in feature-rich networks. According to this approach, both the network and feature data are straightforwardly recovered from the underlying unknown non-overlapping communities, supplied with a center in the feature space and intensity weight(s) over the network each. Our least-squares additive criterion allows us to search for communities one-by-one and to find each community by adding entities one by one. A focus of this paper is that the feature-space data part is converted into a similarity matrix format. The similarity/link values can be used in either of two modes: (a) as measured in the same scale so that one may …
Experimental validation for spectrum cartography using adaptive multi-kernels
2017
This paper validates the functionality of an algorithm for spectrum cartography, generating a radio environment map (REM) using adaptive radial basis functions (RBF) based on a limited number of measurements. The power at all locations is estimated as a linear combination of different RBFs without assuming any prior information about either power spectral densities (PSD) of the transmitters or their locations. The RBFs are represented as centroids at optimized locations, using machine learning to jointly optimize their positions, weights and Gaussian decaying parameters. Optimization is performed using expectation maximization with a least squares loss function and a quadratic regularizer. …
Missing Data
2009
In this chapter, we deal with the problem of missing data in principal component analysis (PCA) and partial least squares (PLS) methods. First, we review several statistical methods proposed in the literature for handling missing data. Both single and multiple imputation (MI) methods are studied and compared using simulated data. After this, we particularize the missing data problem for building and exploiting multivariate calibration models. Several approaches proposed in the literature are introduced and their performance compared based on several real data sets.
A Comparison of Advanced Regression Algorithms for Quantifying Urban Land Cover
2014
Quantitative methods for mapping sub-pixel land cover fractions are gaining increasing attention, particularly with regard to upcoming hyperspectral satellite missions. We evaluated five advanced regression algorithms combined with synthetically mixed training data for quantifying urban land cover from HyMap data at 3.6 and 9 m spatial resolution. Methods included support vector regression (SVR), kernel ridge regression (KRR), artificial neural networks (NN), random forest regression (RFR) and partial least squares regression (PLSR). Our experiments demonstrate that both kernel methods SVR and KRR yield high accuracies for mapping complex urban surface types, i.e., rooftops, pavements, gras…
Probabilistic Self-Localization and Mapping - An Asynchronous Multirate Approach
2008
[EN] In this paper, we present a set of robust and efficient algorithms with O(N) cost for the solution of the Simultaneous Localization And Mapping (SLAM) problem of a mobile robot. First, we introduce a novel object detection method, which is mainly based on multiple line fitting method for landmark detection with regular constrained angles. Second, a line-based pose estimation method is proposed, based on LeastSquares (LS). This method performs the matching of lines, providing the global pose estimation under assumption of known Data-Association. Finally, we extend the FastSLAM (FActored Solution To SLAM) algorithm for mobile robot self-localisation and mapping by considering the asynchr…
Specifications of model development
2016
Chapter 4 goes into detail with the specifications of the model and model validation. Why Partial Least Squares (PLS), a structural equation modelling approach, is chosen as the method for model testing is explained in section 4.1, while 4.2 describes the survey conducted to collect data for model testing. Section 4.3 goes into detail with the PLS approach, its theoretical background and its application to the research question, before section 4.4 outlines the necessary operationalisation of the constructs introduced in chapter 3.
Testing for goodness rather than lack of fit of continuous probability distributions.
2021
The vast majority of testing procedures presented in the literature as goodness-of-fit tests fail to accomplish what the term is promising. Actually, a significant result of such a test indicates that the true distribution underlying the data differs substantially from the assumed model, whereas the true objective is usually to establish that the model fits the data sufficiently well. Meeting that objective requires to carry out a testing procedure for a problem in which the statement that the deviations between model and true distribution are small, plays the role of the alternative hypothesis. Testing procedures of this kind, for which the term tests for equivalence has been coined in sta…
Improved locally adaptive least-squares detection of differences in images
2007
We introduce a method for change detection under nonuniform changes of intensity using an improved least-squares method. A locally adaptive normalizing window is correlated with the two images, and a morphological postprocessing is then applied to isolate objects that have been added or removed from the scene. We use a modification of the least-squares solution to get rid of clutter caused by intensity changes that do not satisfy the model assumed for the least-squares solution.
Fast Implementation of Double-coupled Nonnegative Canonical Polyadic Decomposition
2019
Real-world data exhibiting high order/dimensionality and various couplings are linked to each other since they share some common characteristics. Coupled tensor decomposition has become a popular technique for group analysis in recent years, especially for simultaneous analysis of multi-block tensor data with common information. To address the multiblock tensor data, we propose a fast double-coupled nonnegative Canonical Polyadic Decomposition (FDC-NCPD) algorithm in this study, based on the linked CP tensor decomposition (LCPTD) model and fast Hierarchical Alternating Least Squares (Fast-HALS) algorithm. The proposed FDCNCPD algorithm enables simultaneous extraction of common components, i…
Computer Simulations for Polymer Dynamics
1991
In this paper we review recent work on the dynamics of polymeric systems using computer simulation methods. For a two-dimensional polymer melt, we show that the chains segregate and the dynamics can be described very well by the Rouse model. This simulation was carried out using the bond fluctuation Monte Carlo method. For three-dimensional (3d) melts and for the study of hydrodynamic effects, we use a molecular dynamics simulation. For 3d melts our results strongly support the concept of reptation. A detailed comparison to experiment shows that we can predict the time and length scales for the onset of reptation for a variety of polymeric liquids. For a single chain, we find the expected h…