Oleg Burdakow, Anders Grimwall and M. Hussian. 1 Introduction
|
|
- Shona Edwards
- 5 years ago
- Views:
Transcription
1 COMPSTAT 2004 Symposium c Physica-Verlag/Springer 2004 A GENERALISED PAV ALGORITHM FOR MONOTONIC REGRESSION IN SEVERAL VARIABLES Oleg Burdakow, Anders Grimwall and M. Hussian Key words: Statistical computing, numerical algorithms, monotonic regression, nonparametric regression, pool-adjacent-violators algorithm. COMPSTAT 2004 section: Nonparametrical statistics. Abstract: We present a new algorithm for monotonic regression in one or more explanatory variables. Formally, our method generalises the well-known PAV (pool-adjacent-violators) algorithm from fully to partially ordered data. The computational complexity of our algorithm is O(n 2 ). The goodnessof-fit to observed data is much closer to optimal than for simple averaging techniques. 1 Introduction Monotonic regression is a nonparametric method that is appropriate to use when a response variable (y) is increasing or decreasing in one or more explanatory variables (x 1,..., x p ). Over the past decades, several numerical algorithms have been developed to facilitate practical application of this method. However, all the algorithms that are currently in use have considerable drawbacks. The most widespread computational method for monotonic regression is the so-called pool-adjacent-violators (PAV) algorithm [1], [2], [8]. When p = 1, this algorithm is computationally efficient and provides solutions that are optimal in the sense that the mean square error is minimised. However, if p > 1, the PAV algorithm is less useful. Special cases in which the values of the explanatory variables can be grouped into a moderate number of classes can be handled by repeatedly applying the PAV algorithm to different subsets of data [4], [6], [15], [16]. Other approaches are required for typical multiple regression data in which at least one of the explanatory variables is continuous. Simple averaging techniques constitute another widespread group of methods. The main idea is to form a weighted mean of two monotonic functions that embrace all observed values of the response variable [11], [12], [16]. In contrast to the PAV algorithm, simple averaging techniques can easily accommodate several explanatory variables. On the other hand, the latter techniques are sensitive to outliers, and the goodness-of-fit can be far from optimal. Quadratic programming provides yet another approach to monotonic regression [3], [7]. Given a set of observations {(x 1i,..., x pi, y i ), i = 1,..., n}, we shall find a set of fitted values {z i, i = 1,..., n} such that
2 762 Oleg Burdakow, Anders Grimwall and M. Hussian S = n (z i y i ) 2 i=1 is minimised under the constraints induced by the partially ordered data, namely z i z j, if x ki x kj for k = 1,..., p. All available algorithms for such solutions entail a considerable computational burden, even for moderately large data sets. The best known computational complexity is O(n 4 ), and it refers to an algorithm introduced in [10]. Development of more efficient algorithms remains an open problem. Here, we generalise the PAV algorithm from fully to partially ordered data, and we show how this algorithm can be used for monotonic regression in one or more explanatory variables. In addition, we examine the performance of this algorithm with respect to computational burden and goodness-of-fit to observed data. 2 Main characteristics of the PAV algorithm Let M n = {(x i, y i ), i = 1,..., n} denote a set of n observations of one explanatory variable (x) and one response variable (y), and assume that the x-values are sorted in increasing order. Then the PAV algorithm computes a non-decreasing sequence of values {z i, i = 1,..., n} such that S = n (z i y i ) 2 i=1 is minimised. The cited algorithm is recursive in the sense that the optimal solution for the data set M n is constructed by starting from the solution for M 1, which is subsequently modified into the solution for M 2, and so on. Moreover, it has the following characteristics: (i) (ii) M r+1 is formed by extending M r with a data point (x r+1, y r+1 ), such that x r+1 x i for all i > r + 1. If the values z 1,..., z r denote the solution obtained for M r, then a preliminary solution for M r+1 is formed by setting z r+1 = y r+1. Thereafter, the final solution for M r+1 is derived by pooling adjacent z-values that violate the monotonicity constraints. To be more precise, z r+1,..., z r+1 k are assigned the common value (z r z r+1 k )/(k + 1), where k is the smallest non-negative integer such that the new values of z 1,..., z r+1 form a non-decreasing sequence. (iii) The optimal solution {z i, i = 1,..., n} for M n is composed of clusters of identical z-values.
3 A generalised PAV algorithm An alternative formulation of the PAV algorithm The removal of monotonicity violators implies that adjacent clusters of identical z-values are joined to form new and larger clusters. To achieve a more precise reformulation of the PAV algorithm, we introduce the notation I = {i 1,..., i m } for a cluster consisting of a set of adjacent indices i 1,..., i m. Furthermore, we use I for the number of elements in I, and the symbol z(i) for the common value of all z i, i I. When two adjacent clusters I 1 and I 2 are joined to form a new cluster I 1 I 2, the associated z-value is given by the expression z(i 1 I 2 ) = I 1 z(i 1 ) + I 2 z(i 2 ). I 1 + I 2 If the clusters I 1,..., I q and their associated values z(i 1 ),..., z(i q ) compose the optimal solution for M r, then a preliminary solution for M r+1 is formed by introducing the cluster I q+1 consisting of the integer r + 1, and setting z(i q+1 ) = y r+1. Thereafter, the final solution for M r+1 is obtained by joining I q+1 with adjacent left-neighbour clusters, one by one, until the z-values violating the monotonicity constraints have been removed. 4 A generalised PAV algorithm for partially ordered data In our generalisation of the PAV algorithm to partially ordered data, we use the notions introduced in the previous sections. Let M n = {(x 1i,..., x pi, y i ), i = 1,..., n} denote a set of n observations of p explanatory variables and one response variable. Also, let x i = (x 1i,..., x pi ), i = 1,..., n, denote the elements in R p that are defined by the explanatory variables. Then we can define a partial order on the set U n = {x i, i = 1,..., n} by setting x i x j if x ki x kj, k = 1,..., p, and subsequently sort the elements of U n (and M n ) in such a way that, for each i, x i is a minimal element of the set V i = {x j, j = i,..., n}. Furthermore, we can compute the lower cover L i of each x i. The latter set consists of all elements x j, such that x j x i and the inequalites x j x k x i are satisfied only if x j = x k or x k = x i. Like the original PAV algorithm, our generalisation is recursive. Furthermore, it has the following features: (i) M r+1 is formed by extending M r with a data point (x r+1, y r+1 ), such that, for all i > r+1, either x r+1 x i, or x r+1 is incomparable with x i.
4 764 Oleg Burdakow, Anders Grimwall and M. Hussian (ii) If the clusters I 1,..., I q and their associated values z(i 1 ),..., z(i q ) denote a solution for M r, then a preliminary solution for M r+1 is formed by introducing the cluster I q+1 consisting of the integer r + 1, and setting z(i q+1 ) = y r+1. Thereafter, the final solution for M r+1 is obtained by joining I q+1 with left-neighbour clusters, one by one, until the z-values violating the monotonicity constraints have been removed. A cluster I j is called a left neighbour of I l if there exists an i I j and a k I l such that x i belongs to the lower cover of x k. (iii) The solution {z i, i = 1,..., n} obtained for M n is composed of clusters of identical z-values. Due to their construction, the solutions obtained by using the generalised PAV algorithm are monotonic in the explanatory variables. However, two ambiguities should be noted: (i) (ii) a cluster may have several different left neighbours; the pre-sorting which ensures that, for each i, x i is a minimal element of the set V i = {x j, j = i,..., n} may be done in different ways. The first ambiguity is easy to remove. The goodness-of-fit will be improved, if the largest violator of monotonicity is removed first, whenever a cluster has several left neighbours. The second ambiguity is more intricate, and our generalised PAV algorithm will not necessarily attain the minimal value of the mean square error. 5 Computational burden The computations can be divided into pre-calculations and a recursive establishment of solutions for the data sets M r, r = 1,..., n. The pre-calculations have three major components: (i) establishment of a partial order on the set {x i, i = 1,..., n}; (ii) sorting of the observations to ensure that, for each i, x i is a minimal element of the set V i = {x j, j = i,..., n}; (iii) calculation of the lower cover of each x i. Test runs of a VisualBasic implementation of the algorithm showed that data sets consisting of several hundred observations can be processed in less than a second using an ordinary PC. Most of the computer time was usually spent on the calculation of lower covers, followed by the establishment of a partial order and the removal of monotonicity violators. It is also noteworthy that with our generalised algorithm, after the partial order has been established, the number of explanatory variables does not influence the computational burden. A theoretical analysis of the proposed algorithm showed that its complexity is O(n 2 ). This result will be proved in a separate paper. The proof is based on the following observations. The pre-calculations can be carried out in O(n 2 ) elementary arithmetic operations. Each operation of joining clusters is preceded by the search of the largest violator among the left neighbours.
5 A generalised PAV algorithm 765 Correlation Mean square error Normally distr. errors Exponentially distr. errors GPAV SA GPAV SA Table 1: Mean square error for monotonic regression in two explanatory variables using the generalised PAV algorithm (GPAV) and a simple averaging technique (SA). The table shows mean values for 100 data sets, each consisting of 400 observations. Such search requires at most n comparisons. The complexity of joining clusters is also O(n). Since the total number of joinings cannot exceed n, the overall complexity related to joining is O(n 2 ). The number of cases, in which the search of the largest among the left neighbours does not result in joining of clusters, is below n. Thus, the contribution of these cases to the complexity does not exceed O(n 2 ). When the structure of partially ordered data is a tree, the algorithm is guaranteed to produce the optimal solution, and it has the same complexity as the algorithm introduced in [13], namely O(n log n). 6 Goodness-of-fit A simulation study was undertaken to compare the goodness-of-fit that could be achieved by applying (i) the generalised PAV algorithm and (ii) the simple averaging technique described by Mukarjee in [11]. All of the analysed data sets were generated according to the equation y = x 1 + x 2 + ɛ where (x 1, x 2 ) was normally distributed with mean zero, variance one, and correlation ρ. The error terms ɛ were either normally or exponentially distributed with variance 1. Table 1 shows that, regardless of the distribution of the error terms or the correlation between the two explanatory variables, the generalised PAV algorithm performed better than the simple averaging technique. Furthermore, the difference in goodness-of-fit was particularly large for heavy-tailed (exponentially distributed) error terms. 7 Discussion Models of monotonic responses in two or more explanatory variables have a large number of applications in many areas. Thus far, use of monotonic regression has been hampered by the lack of algorithms suitable for typical
6 766 Oleg Burdakow, Anders Grimwall and M. Hussian multiple regression data. With the generalised PAV algorithm, it is feasible to handle data sets that include hundreds or even thousands of observations of one response variable and an arbitrary number of explanatory variables. For moderately large data sets, it is possible to combine monotonic regression with general model selection techniques, such as cross-validation. The test runs described in this article show that our generalisation of the PAV algorithm has high efficiency from the viewpoint of both its accuracy (goodness-of-fit) and computational time. Two recent conference contributions [5], [9] involving further numerical experiments and applications in environmental science confirm the main results. The present version of the generalised PAV algorithm is superior to simple averaging techniques, but it may not always provide least squares solutions. Further work is needed to determine the extent to which the goodness-of-fit can be improved by removing or reducing the non-optimal performance. References [1] Ayer M., Brunk H.D., Ewing G.M., Reid W.T., Silverman E. (1955). An empirical distribution function for sampling with incomplete information. The Annals of Mathematical Statistics 26, [2] Barlow R.E., Bartholomew D.J., Bremner J.M., Brunk H.D. (1972). Statistical inference under order restrictions. Wiley, New York. [3] Best M.J., Chakravarti N. (1990). Active set algorithms for isotonic regression: a unifying framework. Mathematical Programming 47, [4] Bril G., Dykstra R., Pillers C., Robertson T. (1984). Algorithm AS 206, isotonic regression in two independent variables. Applied Statistics 33, [5] Burdakov O., Sysoev O., Grimvall A., Hussian M. (2004). An algorithm for isotonic regression problems. To appear in the Proceedings of the 4th European Congress of Computational Methods in Applied Science and Engineering ECCOMAS [6] Dykstra R., Robertson T. (1982). An algorithm for isotonic regression for two or more independent variables. The Annals of Statistics 10, [7] Gamarnik D. (1998). Efficient learning of monotone concepts via quadratic optimisation. Proceedings of the Eleventh Annual Conference on Computational Learning Theory, July 24-26, 1998, USA, Wisconsin, Madison [8] Hanson D.L., Pledger G., Wright F.T. (1973). On consistency in monotonic regression. Annals of Statistics 1, [9] Hussian M., Grimvall A., Burdakov O., Sysoev O. (2004). Monotonic regression for trend assessment of environmental quality data. To appear in the Proceedings of the 4th European Congress of Computational Methods in Applied Science and Engineering ECCOMAS 2004.
7 A generalised PAV algorithm 767 [10] Maxwell W.L., Muchstadt J.A. (1983). Establishing consistent and realistic reorder intervals in production-distribution systems. Operations Research 33, [11] Mukarjee H. (1988). Monotone nonparametric regression. The Annals of Statistics 16, [12] Mukarjee H., Stem H. (1994). Feasible nonparametric estimation of multiargument monotone functions. Journal of the American Statistical Association 425, [13] Pardalos P.M., Xue G. (1999). Algorithms for a class of isotonic regression problems. Algorithmica 23, [14] Salanti G., Ulm K. (2001). The multidimensional isotonic regression. Proceedings Book, International Society of Clinical Biostatistics, August, Sweden, Stockholm, 162. [15] Schell M.J., Singh B. (1997). The reduced monotonic regression method. Journal of the American Statistical Association 92, [16] Strand M. (2003). Comparison of methods for monotone nonparametric multiple regression. Communications in Statistics - Simulation and Computation 32, Acknowledgement: The authors are grateful for financial support from the Swedish Environmental Protection Board and the Swedish Research Council. Address: O. Burdakov, A. Grimvall, M. Hussian, Department of Mathematics, Linköping University, Sweden angri@mai.liu.se
Lipschitz Unimodal and Isotonic Regression on Paths and Trees
Lipschitz Unimodal and Isotonic Regression on Paths and Trees Pankaj K. Agarwal Jeff Phillips Bardia Sadri Department of Computer Science Duke University {pankaj, jeffp, sadri}@cs.duke.edu Abstract Given
More informationPackage orqa. R topics documented: February 20, Type Package
Type Package Package orqa February 20, 2015 Title Order Restricted Assessment Of Microarray Titration Experiments Version 0.2.1 Date 2010-10-21 Author Florian Klinglmueller Maintainer Florian Klinglmueller
More informationDistributed Objects with Sense of Direction
Distributed Objects with Sense of Direction G. V. BOCHMANN University of Ottawa P. FLOCCHINI Université de Montréal D. RAMAZANI Université de Montréal Introduction An object system consists of a collection
More informationA Fast Algorithm for Optimal Alignment between Similar Ordered Trees
Fundamenta Informaticae 56 (2003) 105 120 105 IOS Press A Fast Algorithm for Optimal Alignment between Similar Ordered Trees Jesper Jansson Department of Computer Science Lund University, Box 118 SE-221
More informationSet Cover with Almost Consecutive Ones Property
Set Cover with Almost Consecutive Ones Property 2004; Mecke, Wagner Entry author: Michael Dom INDEX TERMS: Covering Set problem, data reduction rules, enumerative algorithm. SYNONYMS: Hitting Set PROBLEM
More informationThe problem of minimizing the elimination tree height for general graphs is N P-hard. However, there exist classes of graphs for which the problem can
A Simple Cubic Algorithm for Computing Minimum Height Elimination Trees for Interval Graphs Bengt Aspvall, Pinar Heggernes, Jan Arne Telle Department of Informatics, University of Bergen N{5020 Bergen,
More informationAssessing Continuous Demand Representation in Coverage Modeling
Assessing Continuous Demand Representation in Coverage Modeling Ran Wei 1, Alan T. Murray 1 1 GeoDa Center for Geospatial Analysis and Computation, School of Geographical Sciences and Urban Planning, Arizona
More informationMath 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)
Math 30 Introduction to Proofs via Number Theory Robert Jewett (with small modifications by B. Ćurgus) March 30, 009 Contents 1 The Integers 3 1.1 Axioms of Z...................................... 3 1.
More informationCSC 501 Semantics of Programming Languages
CSC 501 Semantics of Programming Languages Subtitle: An Introduction to Formal Methods. Instructor: Dr. Lutz Hamel Email: hamel@cs.uri.edu Office: Tyler, Rm 251 Books There are no required books in this
More informationLOESS curve fitted to a population sampled from a sine wave with uniform noise added. The LOESS curve approximates the original sine wave.
LOESS curve fitted to a population sampled from a sine wave with uniform noise added. The LOESS curve approximates the original sine wave. http://en.wikipedia.org/wiki/local_regression Local regression
More informationAn Experiment in Visual Clustering Using Star Glyph Displays
An Experiment in Visual Clustering Using Star Glyph Displays by Hanna Kazhamiaka A Research Paper presented to the University of Waterloo in partial fulfillment of the requirements for the degree of Master
More informationScan Scheduling Specification and Analysis
Scan Scheduling Specification and Analysis Bruno Dutertre System Design Laboratory SRI International Menlo Park, CA 94025 May 24, 2000 This work was partially funded by DARPA/AFRL under BAE System subcontract
More informationINDEPENDENT SCHOOL DISTRICT 196 Rosemount, Minnesota Educating our students to reach their full potential
INDEPENDENT SCHOOL DISTRICT 196 Rosemount, Minnesota Educating our students to reach their full potential MINNESOTA MATHEMATICS STANDARDS Grades 9, 10, 11 I. MATHEMATICAL REASONING Apply skills of mathematical
More informationComputing Degrees of Subsethood and Similarity for Interval-Valued Fuzzy Sets: Fast Algorithms
University of Teas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 8-1-2008 Computing Degrees of Subsethood and Similarity for Interval-Valued Fuzzy Sets:
More informationPlanar Graphs with Many Perfect Matchings and Forests
Planar Graphs with Many Perfect Matchings and Forests Michael Biro Abstract We determine the number of perfect matchings and forests in a family T r,3 of triangulated prism graphs. These results show that
More information9.1. K-means Clustering
424 9. MIXTURE MODELS AND EM Section 9.2 Section 9.3 Section 9.4 view of mixture distributions in which the discrete latent variables can be interpreted as defining assignments of data points to specific
More informationInterval Graphs. Joyce C. Yang. Nicholas Pippenger, Advisor. Arthur T. Benjamin, Reader. Department of Mathematics
Interval Graphs Joyce C. Yang Nicholas Pippenger, Advisor Arthur T. Benjamin, Reader Department of Mathematics May, 2016 Copyright c 2016 Joyce C. Yang. The author grants Harvey Mudd College and the Claremont
More informationAssessing the Quality of the Natural Cubic Spline Approximation
Assessing the Quality of the Natural Cubic Spline Approximation AHMET SEZER ANADOLU UNIVERSITY Department of Statisticss Yunus Emre Kampusu Eskisehir TURKEY ahsst12@yahoo.com Abstract: In large samples,
More informationStar Forests, Dominating Sets and Ramsey-type Problems
Star Forests, Dominating Sets and Ramsey-type Problems Sheila Ferneyhough a, Ruth Haas b,denis Hanson c,1 and Gary MacGillivray a,1 a Department of Mathematics and Statistics, University of Victoria, P.O.
More informationInstituto Nacional de Pesquisas Espaciais - INPE/LAC Av. dos Astronautas, 1758 Jd. da Granja. CEP São José dos Campos S.P.
XXXIV THE MINIMIZATION OF TOOL SWITCHES PROBLEM AS A NETWORK FLOW PROBLEM WITH SIDE CONSTRAINTS Horacio Hideki Yanasse Instituto Nacional de Pesquisas Espaciais - INPE/LAC Av. dos Astronautas, 1758 Jd.
More informationin this web service Cambridge University Press
978-0-51-85748- - Switching and Finite Automata Theory, Third Edition Part 1 Preliminaries 978-0-51-85748- - Switching and Finite Automata Theory, Third Edition CHAPTER 1 Number systems and codes This
More informationGraceful Graphs and Graceful Labelings: Two Mathematical Programming Formulations and Some Other New Results
Graceful Graphs and Graceful Labelings: Two Mathematical Programming Formulations and Some Other New Results Timothy A. Redl Department of Computational and Applied Mathematics, Rice University, Houston,
More informationAlgorithmic complexity of two defence budget problems
21st International Congress on Modelling and Simulation, Gold Coast, Australia, 29 Nov to 4 Dec 2015 www.mssanz.org.au/modsim2015 Algorithmic complexity of two defence budget problems R. Taylor a a Defence
More informationComplexity Results on Graphs with Few Cliques
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9, 2007, 127 136 Complexity Results on Graphs with Few Cliques Bill Rosgen 1 and Lorna Stewart 2 1 Institute for Quantum Computing and School
More informationHyperplane Ranking in. Simple Genetic Algorithms. D. Whitley, K. Mathias, and L. Pyeatt. Department of Computer Science. Colorado State University
Hyperplane Ranking in Simple Genetic Algorithms D. Whitley, K. Mathias, and L. yeatt Department of Computer Science Colorado State University Fort Collins, Colorado 8523 USA whitley,mathiask,pyeatt@cs.colostate.edu
More informationNon Stationary Variograms Based on Continuously Varying Weights
Non Stationary Variograms Based on Continuously Varying Weights David F. Machuca-Mory and Clayton V. Deutsch Centre for Computational Geostatistics Department of Civil & Environmental Engineering University
More informationMA651 Topology. Lecture 4. Topological spaces 2
MA651 Topology. Lecture 4. Topological spaces 2 This text is based on the following books: Linear Algebra and Analysis by Marc Zamansky Topology by James Dugundgji Fundamental concepts of topology by Peter
More informationDefinition: A graph G = (V, E) is called a tree if G is connected and acyclic. The following theorem captures many important facts about trees.
Tree 1. Trees and their Properties. Spanning trees 3. Minimum Spanning Trees 4. Applications of Minimum Spanning Trees 5. Minimum Spanning Tree Algorithms 1.1 Properties of Trees: Definition: A graph G
More informationAn Efficient Approximation for the Generalized Assignment Problem
An Efficient Approximation for the Generalized Assignment Problem Reuven Cohen Liran Katzir Danny Raz Department of Computer Science Technion Haifa 32000, Israel Abstract We present a simple family of
More informationFramework for Design of Dynamic Programming Algorithms
CSE 441T/541T Advanced Algorithms September 22, 2010 Framework for Design of Dynamic Programming Algorithms Dynamic programming algorithms for combinatorial optimization generalize the strategy we studied
More informationOn the Complexity of Broadcast Scheduling. Problem
On the Complexity of Broadcast Scheduling Problem Sergiy Butenko, Clayton Commander and Panos Pardalos Abstract In this paper, a broadcast scheduling problem (BSP) in a time division multiple access (TDMA)
More informationA New Method For Forecasting Enrolments Combining Time-Variant Fuzzy Logical Relationship Groups And K-Means Clustering
A New Method For Forecasting Enrolments Combining Time-Variant Fuzzy Logical Relationship Groups And K-Means Clustering Nghiem Van Tinh 1, Vu Viet Vu 1, Tran Thi Ngoc Linh 1 1 Thai Nguyen University of
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.8 Application: Algorithms Copyright Cengage Learning. All rights reserved. Application:
More informationFurther Maths Notes. Common Mistakes. Read the bold words in the exam! Always check data entry. Write equations in terms of variables
Further Maths Notes Common Mistakes Read the bold words in the exam! Always check data entry Remember to interpret data with the multipliers specified (e.g. in thousands) Write equations in terms of variables
More informationOn the Complexity of the Policy Improvement Algorithm. for Markov Decision Processes
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes Mary Melekopoglou Anne Condon Computer Sciences Department University of Wisconsin - Madison 0 West Dayton Street Madison,
More informationMSEC PLANT LAYOUT OPTIMIZATION CONSIDERING THE EFFECT OF MAINTENANCE
Proceedings of Proceedings of the 211 ASME International Manufacturing Science and Engineering Conference MSEC211 June 13-17, 211, Corvallis, Oregon, USA MSEC211-233 PLANT LAYOUT OPTIMIZATION CONSIDERING
More informationAn Evolution of Mathematical Tools
An Evolution of Mathematical Tools From Conceptualization to Formalization Here's what we do when we build a formal model (or do a computation): 0. Identify a collection of objects/events in the real world.
More informationHeuristic solution methods for the Fiber To The Home cabling problem
Lecture Notes in Management Science (2014) Vol. 6: 198 206 6 th International Conference on Applied Operational Research, Proceedings Tadbir Operational Research Group Ltd. All rights reserved. www.tadbir.ca
More informationResearch Collection. An O(n^4) time algorithm to compute the bisection width of solid grid graphs. Report. ETH Library
Research Collection Report An O(n^4) time algorithm to compute the bisection width of solid grid graphs Author(s): Feldmann, Andreas Emil; Widmayer, Peter Publication Date: 2011 Permanent Link: https://doi.org/10.3929/ethz-a-006935587
More informationOn the Max Coloring Problem
On the Max Coloring Problem Leah Epstein Asaf Levin May 22, 2010 Abstract We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive
More informationOn the packing chromatic number of some lattices
On the packing chromatic number of some lattices Arthur S. Finbow Department of Mathematics and Computing Science Saint Mary s University Halifax, Canada BH C art.finbow@stmarys.ca Douglas F. Rall Department
More informationVertex-Colouring Edge-Weightings
Vertex-Colouring Edge-Weightings L. Addario-Berry a, K. Dalal a, C. McDiarmid b, B. A. Reed a and A. Thomason c a School of Computer Science, McGill University, University St. Montreal, QC, H3A A7, Canada
More informationBilinear Programming
Bilinear Programming Artyom G. Nahapetyan Center for Applied Optimization Industrial and Systems Engineering Department University of Florida Gainesville, Florida 32611-6595 Email address: artyom@ufl.edu
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More informationON THE COMPLEXITY OF THE BROADCAST SCHEDULING PROBLEM
ON THE COMPLEXITY OF THE BROADCAST SCHEDULING PROBLEM SERGIY I. BUTENKO, CLAYTON W. COMMANDER, AND PANOS M. PARDALOS Abstract. In this paper, a Broadcast Scheduling Problem (bsp) in a time division multiple
More informationUSING PRINCIPAL COMPONENTS ANALYSIS FOR AGGREGATING JUDGMENTS IN THE ANALYTIC HIERARCHY PROCESS
Analytic Hierarchy To Be Submitted to the the Analytic Hierarchy 2014, Washington D.C., U.S.A. USING PRINCIPAL COMPONENTS ANALYSIS FOR AGGREGATING JUDGMENTS IN THE ANALYTIC HIERARCHY PROCESS Natalie M.
More informationON SWELL COLORED COMPLETE GRAPHS
Acta Math. Univ. Comenianae Vol. LXIII, (1994), pp. 303 308 303 ON SWELL COLORED COMPLETE GRAPHS C. WARD and S. SZABÓ Abstract. An edge-colored graph is said to be swell-colored if each triangle contains
More informationINTERLEAVING codewords is an important method for
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 2, FEBRUARY 2005 597 Multicluster Interleaving on Paths Cycles Anxiao (Andrew) Jiang, Member, IEEE, Jehoshua Bruck, Fellow, IEEE Abstract Interleaving
More informationOnline algorithms for clustering problems
University of Szeged Department of Computer Algorithms and Artificial Intelligence Online algorithms for clustering problems Summary of the Ph.D. thesis by Gabriella Divéki Supervisor Dr. Csanád Imreh
More informationAn Introduction to the Bootstrap
An Introduction to the Bootstrap Bradley Efron Department of Statistics Stanford University and Robert J. Tibshirani Department of Preventative Medicine and Biostatistics and Department of Statistics,
More informationMulti-Cluster Interleaving on Paths and Cycles
Multi-Cluster Interleaving on Paths and Cycles Anxiao (Andrew) Jiang, Member, IEEE, Jehoshua Bruck, Fellow, IEEE Abstract Interleaving codewords is an important method not only for combatting burst-errors,
More informationMaximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded Cemil Dibek Tınaz Ekim Pinar Heggernes Abstract We determine the maximum number of edges that a claw-free
More informationOn ɛ-unit distance graphs
On ɛ-unit distance graphs Geoffrey Exoo Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809 g-exoo@indstate.edu April 9, 003 Abstract We consider a variation on
More informationFormal Approach in Software Testing
Formal Approach in Software Testing #Abhishek Dixit, #Shivani Goel 1 csed, TIET biodatadixit@yahoo.co.in 2 csed, TIET shivani@tiet.ac.in Abstract Testing is an important activity for checking the correctness
More informationInformation Criteria Methods in SAS for Multiple Linear Regression Models
Paper SA5 Information Criteria Methods in SAS for Multiple Linear Regression Models Dennis J. Beal, Science Applications International Corporation, Oak Ridge, TN ABSTRACT SAS 9.1 calculates Akaike s Information
More informationJoint Entity Resolution
Joint Entity Resolution Steven Euijong Whang, Hector Garcia-Molina Computer Science Department, Stanford University 353 Serra Mall, Stanford, CA 94305, USA {swhang, hector}@cs.stanford.edu No Institute
More informationRough Sets, Neighborhood Systems, and Granular Computing
Rough Sets, Neighborhood Systems, and Granular Computing Y.Y. Yao Department of Computer Science University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca Abstract Granulation
More informationIcETRAN Proceedings of papers. International Conference on Electrical, Electronic and Computing Engineering
IcETRAN 2015 Proceedings of papers International Conference on Electrical, Electronic and Computing Engineering Silver Lake (Srebrno jezero), Serbia, June 8 11, 2015 ISBN 978-86-80509-71-6 Data Centrality
More informationAlgorithm Analysis. Applied Algorithmics COMP526. Algorithm Analysis. Algorithm Analysis via experiments
Applied Algorithmics COMP526 Lecturer: Leszek Gąsieniec, 321 (Ashton Bldg), L.A.Gasieniec@liverpool.ac.uk Lectures: Mondays 4pm (BROD-107), and Tuesdays 3+4pm (BROD-305a) Office hours: TBA, 321 (Ashton)
More informationSaturated Sets in Fuzzy Topological Spaces
Computational and Applied Mathematics Journal 2015; 1(4): 180-185 Published online July 10, 2015 (http://www.aascit.org/journal/camj) Saturated Sets in Fuzzy Topological Spaces K. A. Dib, G. A. Kamel Department
More informationFormal Concept Analysis and Hierarchical Classes Analysis
Formal Concept Analysis and Hierarchical Classes Analysis Yaohua Chen, Yiyu Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: {chen115y, yyao}@cs.uregina.ca
More informationGeneral properties of staircase and convex dual feasible functions
General properties of staircase and convex dual feasible functions JÜRGEN RIETZ, CLÁUDIO ALVES, J. M. VALÉRIO de CARVALHO Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia
More informationHEURISTIC ALGORITHMS FOR THE GENERALIZED MINIMUM SPANNING TREE PROBLEM
Proceedings of the International Conference on Theory and Applications of Mathematics and Informatics - ICTAMI 24, Thessaloniki, Greece HEURISTIC ALGORITHMS FOR THE GENERALIZED MINIMUM SPANNING TREE PROBLEM
More informationA Reduction of Conway s Thrackle Conjecture
A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854
More informationarxiv: v1 [cs.cc] 30 Jun 2017
On the Complexity of Polytopes in LI( Komei Fuuda May Szedlá July, 018 arxiv:170610114v1 [cscc] 30 Jun 017 Abstract In this paper we consider polytopes given by systems of n inequalities in d variables,
More informationAlessandro Del Ponte, Weijia Ran PAD 637 Week 3 Summary January 31, Wasserman and Faust, Chapter 3: Notation for Social Network Data
Wasserman and Faust, Chapter 3: Notation for Social Network Data Three different network notational schemes Graph theoretic: the most useful for centrality and prestige methods, cohesive subgroup ideas,
More informationSearch for an Immobile Entity on a Unit Graph: A Mathematical Programming Approach
Search for an Immobile Entity on a Unit Graph: A Mathematical Programming Approach by Wanyan Yu and Rajan Batta Department of Industrial and Systems Engineering, 438 Bell Hall University at Buffalo (SUNY),
More informationConditional Volatility Estimation by. Conditional Quantile Autoregression
International Journal of Mathematical Analysis Vol. 8, 2014, no. 41, 2033-2046 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.47210 Conditional Volatility Estimation by Conditional Quantile
More informationKnowledge Discovery and Data Mining
Knowledge Discovery and Data Mining Basis Functions Tom Kelsey School of Computer Science University of St Andrews http://www.cs.st-andrews.ac.uk/~tom/ tom@cs.st-andrews.ac.uk Tom Kelsey ID5059-02-BF 2015-02-04
More informationAcyclic Edge Colouring of 2-degenerate Graphs
Acyclic Edge Colouring of 2-degenerate Graphs Chandran Sunil L., Manu B., Muthu R., Narayanan N., Subramanian C. R. Abstract An acyclic edge colouring of a graph is a proper edge colouring such that there
More informationRegression on a Graph
Regression on a Graph arxiv:0911.1928v1 [stat.me] 10 Nov 2009 Arne Kovac and Andrew D.A.C. Smith Abstract The Signal plus Noise model for nonparametric regression can be extended to the case of observations
More informationAn Improved Upper Bound for the Sum-free Subset Constant
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 (2010), Article 10.8.3 An Improved Upper Bound for the Sum-free Subset Constant Mark Lewko Department of Mathematics University of Texas at Austin
More informationMining High Order Decision Rules
Mining High Order Decision Rules Y.Y. Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 e-mail: yyao@cs.uregina.ca Abstract. We introduce the notion of high
More informationOn Rainbow Cycles in Edge Colored Complete Graphs. S. Akbari, O. Etesami, H. Mahini, M. Mahmoody. Abstract
On Rainbow Cycles in Edge Colored Complete Graphs S. Akbari, O. Etesami, H. Mahini, M. Mahmoody Abstract In this paper we consider optimal edge colored complete graphs. We show that in any optimal edge
More informationMATH3016: OPTIMIZATION
MATH3016: OPTIMIZATION Lecturer: Dr Huifu Xu School of Mathematics University of Southampton Highfield SO17 1BJ Southampton Email: h.xu@soton.ac.uk 1 Introduction What is optimization? Optimization is
More informationGeneralized Connectionist Associative Memory
Generalized Connectionist Associative Memory Nigel.Duffy' and Arun Jagota Department of Computer Science University of California Santa Cruz, CA 95064 USA Abstract This paper presents a generalized associative
More informationAdvanced Algorithms Class Notes for Monday, October 23, 2012 Min Ye, Mingfu Shao, and Bernard Moret
Advanced Algorithms Class Notes for Monday, October 23, 2012 Min Ye, Mingfu Shao, and Bernard Moret Greedy Algorithms (continued) The best known application where the greedy algorithm is optimal is surely
More informationDOWNLOAD PDF BIG IDEAS MATH VERTICAL SHRINK OF A PARABOLA
Chapter 1 : BioMath: Transformation of Graphs Use the results in part (a) to identify the vertex of the parabola. c. Find a vertical line on your graph paper so that when you fold the paper, the left portion
More informationTime Series Prediction and Neural Networks
Time Series Prediction and Neural Networks N.Davey, S.P.Hunt, R.J.Frank, University of Hertfordshire Hatfield, UK. Email: {N.Davey, S.P.Hunt, R.J.Frank}@herts.ac.uk Abstract Neural Network approaches to
More informationNonparametric Regression
Nonparametric Regression John Fox Department of Sociology McMaster University 1280 Main Street West Hamilton, Ontario Canada L8S 4M4 jfox@mcmaster.ca February 2004 Abstract Nonparametric regression analysis
More informationRearrangement of DNA fragments: a branch-and-cut algorithm Abstract. In this paper we consider a problem that arises in the process of reconstruction
Rearrangement of DNA fragments: a branch-and-cut algorithm 1 C. E. Ferreira 1 C. C. de Souza 2 Y. Wakabayashi 1 1 Instituto de Mat. e Estatstica 2 Instituto de Computac~ao Universidade de S~ao Paulo e-mail:
More informationEXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY
EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA, 2015 MODULE 4 : Modelling experimental data Time allowed: Three hours Candidates should answer FIVE questions. All questions carry equal
More information6. Concluding Remarks
[8] K. J. Supowit, The relative neighborhood graph with an application to minimum spanning trees, Tech. Rept., Department of Computer Science, University of Illinois, Urbana-Champaign, August 1980, also
More informationGoals: Define the syntax of a simple imperative language Define a semantics using natural deduction 1
Natural Semantics Goals: Define the syntax of a simple imperative language Define a semantics using natural deduction 1 1 Natural deduction is an instance of first-order logic; that is, it is the formal
More informationFitting Fragility Functions to Structural Analysis Data Using Maximum Likelihood Estimation
Fitting Fragility Functions to Structural Analysis Data Using Maximum Likelihood Estimation 1. Introduction This appendix describes a statistical procedure for fitting fragility functions to structural
More informationDesigning Views to Answer Queries under Set, Bag,and BagSet Semantics
Designing Views to Answer Queries under Set, Bag,and BagSet Semantics Rada Chirkova Department of Computer Science, North Carolina State University Raleigh, NC 27695-7535 chirkova@csc.ncsu.edu Foto Afrati
More information2015, IJARCSSE All Rights Reserved Page 31
Volume 5, Issue 7, July 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Procedural Cognitive
More informationTopological Integer Additive Set-Sequential Graphs. Received: 7 April 2015 / Accepted: 26 June 2015 / Published: 3 July 2015
Mathematics 2015, 3, 604-614; doi:10.3390/math3030604 OPEN ACCESS mathematics ISSN 2227-7390 www.mdpi.com/journal/mathematics Article Topological Integer Additive Set-Sequential Graphs Sudev Naduvath 1,
More information3 Fractional Ramsey Numbers
27 3 Fractional Ramsey Numbers Since the definition of Ramsey numbers makes use of the clique number of graphs, we may define fractional Ramsey numbers simply by substituting fractional clique number into
More informationA GENERAL GIBBS SAMPLING ALGORITHM FOR ANALYZING LINEAR MODELS USING THE SAS SYSTEM
A GENERAL GIBBS SAMPLING ALGORITHM FOR ANALYZING LINEAR MODELS USING THE SAS SYSTEM Jayawant Mandrekar, Daniel J. Sargent, Paul J. Novotny, Jeff A. Sloan Mayo Clinic, Rochester, MN 55905 ABSTRACT A general
More informationOn maximum spanning DAG algorithms for semantic DAG parsing
On maximum spanning DAG algorithms for semantic DAG parsing Natalie Schluter Department of Computer Science School of Technology, Malmö University Malmö, Sweden natalie.schluter@mah.se Abstract Consideration
More informationA Survey Of Issues And Challenges Associated With Clustering Algorithms
International Journal for Science and Emerging ISSN No. (Online):2250-3641 Technologies with Latest Trends 10(1): 7-11 (2013) ISSN No. (Print): 2277-8136 A Survey Of Issues And Challenges Associated With
More informationThe Elliptic Curve Discrete Logarithm and Functional Graphs
Rose-Hulman Institute of Technology Rose-Hulman Scholar Mathematical Sciences Technical Reports (MSTR) Mathematics 7-9-0 The Elliptic Curve Discrete Logarithm and Functional Graphs Christopher J. Evans
More informationOn the Finiteness of the Recursive Chromatic Number
On the Finiteness of the Recursive Chromatic Number William I Gasarch Andrew C.Y. Lee Abstract A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive
More informationIntegrated Mathematics I Performance Level Descriptors
Limited A student performing at the Limited Level demonstrates a minimal command of Ohio s Learning Standards for Integrated Mathematics I. A student at this level has an emerging ability to demonstrate
More informationFinding a winning strategy in variations of Kayles
Finding a winning strategy in variations of Kayles Simon Prins ICA-3582809 Utrecht University, The Netherlands July 15, 2015 Abstract Kayles is a two player game played on a graph. The game can be dened
More informationFaster parameterized algorithms for Minimum Fill-In
Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender Pinar Heggernes Yngve Villanger Technical Report UU-CS-2008-042 December 2008 Department of Information and Computing Sciences Utrecht
More informationSome questions of consensus building using co-association
Some questions of consensus building using co-association VITALIY TAYANOV Polish-Japanese High School of Computer Technics Aleja Legionow, 4190, Bytom POLAND vtayanov@yahoo.com Abstract: In this paper
More informationMethods and Models for the Construction of Weakly Parallel Tests
Methods and Models for the Construction of Weakly Parallel Tests Jos J. Adema University of Twente Several methods are proposed for the construction of weakly parallel tests [i.e., tests with the same
More informationARITHMETIC operations based on residue number systems
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 53, NO. 2, FEBRUARY 2006 133 Improved Memoryless RNS Forward Converter Based on the Periodicity of Residues A. B. Premkumar, Senior Member,
More information