The qp Package. December 21, 2006

Size: px
Start display at page:

Download "The qp Package. December 21, 2006"

Transcription

1 The qp Package December 21, 2006 Type Package Title q-order partial correlation graph search algorithm Version Date Author Robert Castelo Alberto Roverato Maintainer Robert Castelo Depends R (>= 2.2.1) the q-order partial correlation graph search algorithm, q-partial, or qp, algorithm for short, is a robust procedure for structure learning of undirected Gaussian graphical Markov models from small n, large p data, that is, multivariate normal data coming from a number of random variables p larger than the number of multidimensional data points n as in the case of, e.g., microarray data. License GPL version 2 or newer R topics documented: jmlr06data qp qp.analyse qp.ci.test qp.clique qp.edge.prob qp.get.cliques qp.graph qp.hist qp.matrix.image qp.search Index 15 1

2 2 qp jmlr06data Synthetic data from the article by Castelo and Roverato (2006) Format Synthetic data generated from two graphs with 150 vertices, G 1 and G 2. In G 1 the boundary of every vertex is at most 5, while in G 2 the boundary of every vertext is at most 20 IC.bd5: inverse correlation matrix encoding the independence structure of G 1 IC.bd20: inverse correlation matrix encoding the independence structure of G 2 S.bd5.N20: sample covariance matrix from a sample of size 20 drawn from a normal distribution with mean 0 and inverse correlation matrix IC.bd5 S.bd5.N50: sample covariance matrix from a sample of size 50 drawn from a normal distribution with mean 0 and inverse correlation matrix IC.bd5 S.bd5.N150: sample covariance matrix from a sample of size 150 drawn from a normal distribution with mean 0 and inverse correlation matrix IC.bd5 S.bd20.N20: sample covariance matrix from a sample of size 20 drawn from a normal distribution with mean 0 and inverse correlation matrix IC.bd20 S.bd20.N50: sample covariance matrix from a sample of size 50 drawn from a normal distribution with mean 0 and inverse correlation matrix IC.bd20 S.bd20.N150: sample covariance matrix from a sample of size 150 drawn from a normal distribution with mean 0 and inverse correlation matrix IC.bd20 qp.out.bd5.n20.q10: output from qp.search applied to S.bd5.N20 with q=10 and T=500 qp.out.bd20.n20.q10: output from qp.search applied to S.bd20.N20 with q=10 and T=500 qp The package qp : summary information

3 qp 3 This package provides functions for implementing the q-order partial-correlation graph search algorithm, q-partial, or qp, algorithm for short. The qp algorithm is a robust procedure for structure learning of undirected Gaussian graphical Markov models (UGGMMs) from "small n, large p" data, that is, multivariate normal data coming from a number of random variables p larger than the number of multidimensional data points n as in the case of, e.g., microarray data. Data jmlr06data synthetic data used in the referenced article Functions qp.search calculates the estimates of the non-rejection rates for every pair of variables qp.edge.prob calculates the estimate of the non-rejection rate for a particular pair of variables, this function is also called by qp.search qp.ci.test performs a test for conditional independence qp.analyse provides some exploratory analyses on the output of qp.search qp.clique calculates the maximum clique size as a function of the minimum threshold on the non-rejection rate for removing an edge qp.hist shows a histogram of the estimated non-rejection rates obtained through qp.search qp.graph returns the qp-graph, in the form of an incidence matrix, resulting of thresholding the non-rejection rates in the output of qp.search qp.matrix.image makes an image plot of the absolute value of an inverse correlation matrix qp.get.cliques finds the set of cliques of an undirected graph The package provides an implementation of the procedures described by Castelo and Roverato (2006) and is a contribution to the gr-project described by Lauritzen (2002). Authors Robert Castelo, Departament de Ciències Experimentals i de la Salut, Universitat Pompeu Fabra, Barcelona, Spain. Alberto Roverato, Dipartimento di Scienze Statistiche, Università di Bologna, Italy. Lauritzen, S. L. (2002). graphical Models in R. R News, 3(2)39.

4 4 qp.analyse qp.analyse Performs some exploratory analyses on the q-partial graph Using the output of qp.search this function provides some exploratory analyses on the resulting q-partial graph. qp.analyse(qp.output, threshold, largest.clique=true, plot.image=true, exact.calculation=false, approximation.iterations=100) qp.output output of qp.search threshold threshold on the minimum non-rejection rate required for edge removal largest.clique when this flag is set to TRUE it calculates the size of the largest clique plot.image when this flag is set it plots the incidence matrix resulting of thresholding the non-rejection rates exact.calculation when this flag is set to TRUE, the exact maximum clique size is calculated and when set to FALSE a lower bound is calculated instead. It applies only when largest.clique=true approximation.iterations number of iterations performed to calculate the lower bound on the clique number of each graph. It applies only when largest.clique=true and \ exact.calculation=false Details Returns an object of the class matrix showing the number of selected edges, the number of edges of the complete graph and the percentage of selected edges. When largest.clique=true it gives also the size of the largest clique and when plot.image=true it plots the incidence matrix resulting of thresholding the non-rejection rates. Beware that setting largest.clique=true and exact.calculation=true when giving breakpoints between 0.95 and 1.0 (which may result into very dense graphs) can lead to a very long time of computation due to the NP-completeness of the problem of calculating the size of the largest clique which is therefore bounded by an exponential growth of the running time as function of the graph density (cf. Pardalos and Xue, 1994). The lower bound on the maximum clique size is calculated by ranking the vertices by their connectivity degree, put the first vertex in a set and go through the rest of the ranking adding those vertices

5 qp.ci.test 5 to the set that form a clique with the vertices currently within the set. Once the entire ranking has been examined a large clique should have been built and hopefully the largest one. This process is repeated a number of times (approximation.iterations) each of which the ranking is altered with increasing levels of randomness acyclically (altering 1 to p vertices and again). Larger values of approximation.iterations should provide tighter lower bounds and eventually the exact maximum clique size (the clique number). Pardalos, P.M. and Xue, J. (1994). The maximum clique problem, J. Global Optim., 4: qp.search, qp.clique qp.analyse(qp.out.bd5.n20.q10,threshold=0.9,largest.clique=true) qp.ci.test Conditional independence test Performs a test for conditional independence between variables indexed by i and j given the conditioning set Q qp.ci.test(s, N, i=1, j=2, Q=c(), binary=true) S N i j Q binary sample variance-covariance matrix sample size index of one variable index of another variable conditioning set flag to switch to the compiled C code

6 6 qp.clique Details By default binary=true and the compiled and faster C code corresponding to this function will be executed. If binary=false is set, then the R code will be executed. Value t.value p.value the t-statistic value the p-value on rejecting the null hypothesis of conditional independence qp.edge.prob S <- S.bd5.N20 N <- 20 qp.ci.test(s,n,i=3,j=4,q=c(5,6,7)) qp.clique Relationship between non-rejection rate and maximum clique size Using the output of qp.search this function calculates the maximum clique size as a function of the minimum threshold on the non-rejection rate for removing an edge qp.clique(qp.output, N, threshold.lim=c(0,1), breaks=5, plot.image=true, exact.calculation=false, approximation.iterations=100)

7 qp.clique 7 qp.output N output of qp.search sample size threshold.lim range of the non-rejection rate threshold on which calculate the funcion breaks plot.image one of: a vector giving the breakpoints along the range defined by threshold.lim, a single number giving the number of equidistant breakpoints that divide the range defined by threshold.lim. when this flag is set to TRUE, the qp.clique plot is produced exact.calculation when this flag is set to TRUE, the exact maximum clique size is calculated and when set to FALSE a lower bound is calculated instead approximation.iterations number of iterations performed to calculate the lower bound on the clique number of each graph. It applies only when exact.calculation=false Details The qp.clique plot provides information on the graphs potentially selected by specifying different values of the threshold. Every circle in the plot corresponds to a graph and has three values associated with it: the threshold value used to construct the graph (horizontal axis); the number of vertices of the largest clique of the graph (vertical axis); the percentage of present edges in the graph (number inside the plot, beside the circle). Furthermore, adjacent circles are joined by a line and the dotted horizontal line corresponds to the sample size N. Beware that setting exact.calculation=true and giving breakpoints between 0.95 and 1.0, may result into very dense graphs which can lead to a very long time of computation due to the NPcompleteness of the problem of calculating the size of the largest clique which is therefore bounded by an exponential growth of the running time as function of the graph density (cf. Pardalos and Xue, 1994). The lower bound on the maximum clique size is calculated by ranking the vertices by their connectivity degree, put the first vertex in a set and go through the rest of the ranking adding those vertices to the set that form a clique with the vertices currently within the set. Once the entire ranking has been examined a large clique should have been built and hopefully the largest one. This process is repeated a number of times (approximation.iterations) each of which the ranking is altered with increasing levels of randomness acyclically (altering 1 to p vertices and again). Larger values of approximation.iterations should provide tighter lower bounds and eventually the exact maximum clique size (the clique number). Value threshold size threshold on the non-rejection rate that provides the maximum clique size that is strictly smaller than the sample size N maximum clique size strictly smaller than the sample size N

8 8 qp.edge.prob Pardalos, P.M. and Xue, J. (1994). The maximum clique problem, J. Global Optim., 4: qp.search qp.clique(qp.out.bd5.n20.q10,20) qp.edge.prob Estimate of the non-rejection rate Calculates the estimate of the non-rejection rate for a pair of variables, that is, the proportion of conditional independence tests that accept the null hypothesis of zero partial correlation given the q-order conditionals. qp.edge.prob(s, N, i=1, j=2, q=0, T=500, significance=0.05, binary=true) S N i j q T Details sample variance-covariance matrix sample size index of one variable index of another variable partial-correlation order number of tests per adjacency significance significance level of each test binary flag to switch to the compiled C code By default binary=true and the compiled and faster C code corresponding to this function will be executed. If binary=false is set, then the R code will be executed.

9 qp.get.cliques 9 qp.search, qp.ci.test S <- S.bd5.N20 N <- 20 q <- 6 T <- 100 qp.edge.prob(s,n,i=3,j=4,q,t) qp.get.cliques Cliques of an undirected graph It finds the set of cliques, i.e. maximal complete subsets of vertices, of an undirected graph taken as an incidence matrix. qp.get.cliques(i, binary=true) I binary incidence matrix flag to switch to the compiled C code Details It uses the algorithm described in Bron and Kerbosch (1973) and returns a list where each member is a vector of vertices forming a clique in the given graph. Beware that the problem of finding the set of cliques is NP-complete and the time of computation of this algorithm grows exponentially in the graph density (number of actual edges over the total number of adjacencies).

10 10 qp.graph Bron, C. and Kerbosch, J (1973). Finding all cliques of an undirected graph, Commun. ACM, 16: qp.graph, qp.clique I <- qp.graph(qp.out.bd5.n20.q10,threshold=0.9) cliquelist <- qp.get.cliques(i) sprintf("the graph has %d cliques\n",length(cliquelist)) qp.graph Incidence matrix of the qp-graph Using the output of qp.search this function returns the qp-graph, in the form of an incidence matrix, resulting of thresholding the non-rejection rates in the output of qp.search qp.graph(qp.output, threshold) qp.output threshold output of qp.search threshold on the non-rejection rate

11 qp.hist 11 qp.search I <- qp.graph(qp.out.bd5.n20.q10,threshold=0.9) sprintf("the graph has %.0f edges\n",sum(i)/2) qp.hist Histogram of the non-rejection rates Using the output of qp.search this function plots the histogram of the estimated non-rejection rates. When the inverse correlation matrix from the generative graph is given, it provides additional plots of information. qp.hist(qp.output, IC=NULL, prob=false) qp.output IC prob output of qp.search inverse correlation matrix from the generative graph when this flag is set to TRUE the histograms show densities, otherwise they show absolute frequencies. qp.search

12 12 qp.matrix.image # if are working with synthetic data and have the IC matrix qp.hist(qp.out.bd5.n20.q10,ic.bd5,prob=true) # otherwise, we just look at the non-rejection rate distribution qp.hist(qp.out.bd5.n20.q10,null,prob=true) qp.matrix.image Image of an inverse correlation matrix Makes an image plot of the absolute value of an inverse correlation matrix and reports the number of edges of the corresponding independence graph, the total number of adjacencies of the graph and the percentage of edges respect to this total number of adjacencies qp.matrix.image(m, col=null, plot=true) M col plot the matrix to make the image plot flag that when set to NULL the gray scale is used in the plot when this flag is set to TRUE it plots the function Details Returns an object of the class matrix containing the the number of edges of the corresponding independence graph, the total number of adjacencies of the graph and the percentage of edges respect to this total number of adjacencies. When plot=true it plots the partial correlation coefficients as a matrix.

13 qp.search 13 qp.matrix.image(ic.bd5) qp.search Matrix of non-rejection rates Calculates the estimates of the non-rejection rates for every pair of variables. qp.search(s, N, q=0, T=500, significance=0.05, binary=true) S N T q Details Value sample variance-covariance matrix sample size number of tests per adjacency partial-correlation order significance significance level of each test binary flag to switch to the compiled C code By default binary=true and the compiled and faster C code corresponding to this function will be executed. If binary=false is set, then the R code will be executed. A T matrix with the acceptance test counts number of tests per adjacency (copied from the input parameter) qp.edge.prob, qp.analyse, qp.hist

14 14 qp.search S <- S.bd5.N20 N <- 20 q <- 6 T <- 100 qp.out <- qp.search(s,n,q,t)

15 Index Topic datasets jmlr06data, 1 Topic graphs qp, 2 qp.analyse, 3 qp.ci.test, 5 qp.clique, 6 qp.edge.prob, 8 qp.get.cliques, 9 qp.graph, 10 qp.hist, 11 qp.matrix.image, 12 qp.search, 13 Topic models qp, 2 qp.analyse, 3 qp.ci.test, 5 qp.clique, 6 qp.edge.prob, 8 qp.get.cliques, 9 qp.graph, 10 qp.hist, 11 qp.matrix.image, 12 qp.search, 13 Topic multivariate qp, 2 qp.analyse, 3 qp.ci.test, 5 qp.clique, 6 qp.edge.prob, 8 qp.get.cliques, 9 qp.graph, 10 qp.hist, 11 qp.matrix.image, 12 qp.search, 13 qp, 2 qp.analyse, 2, 3, 13 qp.ci.test, 2, 5, 8 qp.clique, 3, 4, 6, 9 qp.edge.prob, 2, 5, 8, 13 qp.get.cliques, 3, 9 qp.graph, 3, 9, 10 qp.hist, 3, 11, 13 qp.matrix.image, 3, 12 qp.out.bd20.n20.q10 (jmlr06data), 1 qp.out.bd5.n20.q10 (jmlr06data), 1 qp.search, 2 4, 6 8, 10, 11, 13 S.bd20.N150 (jmlr06data), 1 S.bd20.N20 (jmlr06data), 1 S.bd20.N50 (jmlr06data), 1 S.bd5.N150 (jmlr06data), 1 S.bd5.N20 (jmlr06data), 1 S.bd5.N50 (jmlr06data), 1 IC.bd20 (jmlr06data), 1 IC.bd5 (jmlr06data), 1 jmlr06data, 1, 2 15

Simulation of molecular regulatory networks with graphical models

Simulation of molecular regulatory networks with graphical models Simulation of molecular regulatory networks with graphical models Inma Tur 1 inma.tur@upf.edu Alberto Roverato 2 alberto.roverato@unibo.it Robert Castelo 1 robert.castelo@upf.edu 1 Universitat Pompeu Fabra,

More information

Fathom Dynamic Data TM Version 2 Specifications

Fathom Dynamic Data TM Version 2 Specifications Data Sources Fathom Dynamic Data TM Version 2 Specifications Use data from one of the many sample documents that come with Fathom. Enter your own data by typing into a case table. Paste data from other

More information

Data Analysis and Solver Plugins for KSpread USER S MANUAL. Tomasz Maliszewski

Data Analysis and Solver Plugins for KSpread USER S MANUAL. Tomasz Maliszewski Data Analysis and Solver Plugins for KSpread USER S MANUAL Tomasz Maliszewski tmaliszewski@wp.pl Table of Content CHAPTER 1: INTRODUCTION... 3 1.1. ABOUT DATA ANALYSIS PLUGIN... 3 1.3. ABOUT SOLVER PLUGIN...

More information

Package qpgraph. January 22, 2018

Package qpgraph. January 22, 2018 Package qpgraph January 22, 2018 Title Estimation of genetic and molecular regulatory networks from high-throughput genomics data Version 2.12.0 Estimate gene and eqtl networks from high-throughput expression

More information

Statistical Analysis of Metabolomics Data. Xiuxia Du Department of Bioinformatics & Genomics University of North Carolina at Charlotte

Statistical Analysis of Metabolomics Data. Xiuxia Du Department of Bioinformatics & Genomics University of North Carolina at Charlotte Statistical Analysis of Metabolomics Data Xiuxia Du Department of Bioinformatics & Genomics University of North Carolina at Charlotte Outline Introduction Data pre-treatment 1. Normalization 2. Centering,

More information

Multivariate Capability Analysis

Multivariate Capability Analysis Multivariate Capability Analysis Summary... 1 Data Input... 3 Analysis Summary... 4 Capability Plot... 5 Capability Indices... 6 Capability Ellipse... 7 Correlation Matrix... 8 Tests for Normality... 8

More information

Notation Index. Probability notation. (there exists) (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5.

Notation Index. Probability notation. (there exists) (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5. Notation Index (there exists) (for all) Fn-4 Fn-4 (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5 ( n ) k (binomial coefficient) CL-15 ( n m 1,m 2,...) (multinomial coefficient)

More information

Notation Index 9 (there exists) Fn-4 8 (for all) Fn-4 3 (such that) Fn-4 B n (Bell numbers) CL-25 s ο t (equivalence relation) GT-4 n k (binomial coef

Notation Index 9 (there exists) Fn-4 8 (for all) Fn-4 3 (such that) Fn-4 B n (Bell numbers) CL-25 s ο t (equivalence relation) GT-4 n k (binomial coef Notation 9 (there exists) Fn-4 8 (for all) Fn-4 3 (such that) Fn-4 B n (Bell numbers) CL-25 s ο t (equivalence relation) GT-4 n k (binomial coefficient) CL-14 (multinomial coefficient) CL-18 n m 1 ;m 2

More information

10-701/15-781, Fall 2006, Final

10-701/15-781, Fall 2006, Final -7/-78, Fall 6, Final Dec, :pm-8:pm There are 9 questions in this exam ( pages including this cover sheet). If you need more room to work out your answer to a question, use the back of the page and clearly

More information

Computational complexity

Computational complexity Computational complexity Heuristic Algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Definitions: problems and instances A problem is a general question expressed in

More information

The Maximum Clique Problem

The Maximum Clique Problem November, 2012 Motivation How to put as much left-over stuff as possible in a tasty meal before everything will go off? Motivation Find the largest collection of food where everything goes together! Here,

More information

The Power and Sample Size Application

The Power and Sample Size Application Chapter 72 The Power and Sample Size Application Contents Overview: PSS Application.................................. 6148 SAS Power and Sample Size............................... 6148 Getting Started:

More information

Package assortnet. January 18, 2016

Package assortnet. January 18, 2016 Type Package Package assortnet January 18, 2016 Title Calculate the Assortativity Coefficient of Weighted and Binary Networks Version 0.12 Date 2016-01-18 Author Damien Farine Maintainer

More information

Algorithms for the Bin Packing Problem with Conflicts

Algorithms for the Bin Packing Problem with Conflicts Algorithms for the Bin Packing Problem with Conflicts Albert E. Fernandes Muritiba *, Manuel Iori, Enrico Malaguti*, Paolo Toth* *Dipartimento di Elettronica, Informatica e Sistemistica, Università degli

More information

Graph Theory. ICT Theory Excerpt from various sources by Robert Pergl

Graph Theory. ICT Theory Excerpt from various sources by Robert Pergl Graph Theory ICT Theory Excerpt from various sources by Robert Pergl What can graphs model? Cost of wiring electronic components together. Shortest route between two cities. Finding the shortest distance

More information

COMPUTER AND ROBOT VISION

COMPUTER AND ROBOT VISION VOLUME COMPUTER AND ROBOT VISION Robert M. Haralick University of Washington Linda G. Shapiro University of Washington A^ ADDISON-WESLEY PUBLISHING COMPANY Reading, Massachusetts Menlo Park, California

More information

University of Florida CISE department Gator Engineering. Clustering Part 4

University of Florida CISE department Gator Engineering. Clustering Part 4 Clustering Part 4 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville DBSCAN DBSCAN is a density based clustering algorithm Density = number of

More information

Data Mining Chapter 3: Visualizing and Exploring Data Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University

Data Mining Chapter 3: Visualizing and Exploring Data Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Data Mining Chapter 3: Visualizing and Exploring Data Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Exploratory data analysis tasks Examine the data, in search of structures

More information

Package CoClust. December 17, 2017

Package CoClust. December 17, 2017 Title Copula Based Cluster Analysis Date 2017-12-15 Version 0.3-2 Package CoClust December 17, 2017 Author Francesca Marta Lilja Di Lascio, Simone Giannerini Depends R (>= 2.15.1), methods, copula Imports

More information

Clustering Part 4 DBSCAN

Clustering Part 4 DBSCAN Clustering Part 4 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville DBSCAN DBSCAN is a density based clustering algorithm Density = number of

More information

Package nlsrk. R topics documented: June 24, Version 1.1 Date Title Runge-Kutta Solver for Function nls()

Package nlsrk. R topics documented: June 24, Version 1.1 Date Title Runge-Kutta Solver for Function nls() Version 1.1 Date 2017-06-22 Title Runge-Kutta Solver for Function nls() Package nlsrk June 24, 2017 Author Jean-Sebastien Pierre Maintainer Jean-Sebastien Pierre

More information

Week 7 Picturing Network. Vahe and Bethany

Week 7 Picturing Network. Vahe and Bethany Week 7 Picturing Network Vahe and Bethany Freeman (2005) - Graphic Techniques for Exploring Social Network Data The two main goals of analyzing social network data are identification of cohesive groups

More information

Lecture 4: Undirected Graphical Models

Lecture 4: Undirected Graphical Models Lecture 4: Undirected Graphical Models Department of Biostatistics University of Michigan zhenkewu@umich.edu http://zhenkewu.com/teaching/graphical_model 15 September, 2016 Zhenke Wu BIOSTAT830 Graphical

More information

Predictive Analysis: Evaluation and Experimentation. Heejun Kim

Predictive Analysis: Evaluation and Experimentation. Heejun Kim Predictive Analysis: Evaluation and Experimentation Heejun Kim June 19, 2018 Evaluation and Experimentation Evaluation Metrics Cross-Validation Significance Tests Evaluation Predictive analysis: training

More information

Chapter 5: Outlier Detection

Chapter 5: Outlier Detection Ludwig-Maximilians-Universität München Institut für Informatik Lehr- und Forschungseinheit für Datenbanksysteme Knowledge Discovery in Databases SS 2016 Chapter 5: Outlier Detection Lecture: Prof. Dr.

More information

Part I, Chapters 4 & 5. Data Tables and Data Analysis Statistics and Figures

Part I, Chapters 4 & 5. Data Tables and Data Analysis Statistics and Figures Part I, Chapters 4 & 5 Data Tables and Data Analysis Statistics and Figures Descriptive Statistics 1 Are data points clumped? (order variable / exp. variable) Concentrated around one value? Concentrated

More information

Package fso. February 19, 2015

Package fso. February 19, 2015 Version 2.0-1 Date 2013-02-26 Title Fuzzy Set Ordination Package fso February 19, 2015 Author David W. Roberts Maintainer David W. Roberts Description Fuzzy

More information

Package XMRF. June 25, 2015

Package XMRF. June 25, 2015 Type Package Package XMRF June 25, 2015 Title Markov Random Fields for High-Throughput Genetics Data Version 1.0 Date 2015-06-12 Author Ying-Wooi Wan, Genevera I. Allen, Yulia Baker, Eunho Yang, Pradeep

More information

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong) Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong) References: [1] http://homepages.inf.ed.ac.uk/rbf/hipr2/index.htm [2] http://www.cs.wisc.edu/~dyer/cs540/notes/vision.html

More information

Package gibbs.met documentation

Package gibbs.met documentation Version 1.1-2 Package gibbs.met documentation Title Naive Gibbs Sampling with Metropolis Steps Author Longhai Li of March 26, 2008 Maintainer Longhai Li

More information

Mean Tests & X 2 Parametric vs Nonparametric Errors Selection of a Statistical Test SW242

Mean Tests & X 2 Parametric vs Nonparametric Errors Selection of a Statistical Test SW242 Mean Tests & X 2 Parametric vs Nonparametric Errors Selection of a Statistical Test SW242 Creation & Description of a Data Set * 4 Levels of Measurement * Nominal, ordinal, interval, ratio * Variable Types

More information

UNIVERSITY OF OSLO. Faculty of Mathematics and Natural Sciences

UNIVERSITY OF OSLO. Faculty of Mathematics and Natural Sciences UNIVERSITY OF OSLO Faculty of Mathematics and Natural Sciences Exam: INF 4300 / INF 9305 Digital image analysis Date: Thursday December 21, 2017 Exam hours: 09.00-13.00 (4 hours) Number of pages: 8 pages

More information

Package ldbod. May 26, 2017

Package ldbod. May 26, 2017 Type Package Title Local Density-Based Outlier Detection Version 0.1.2 Author Kristopher Williams Package ldbod May 26, 2017 Maintainer Kristopher Williams Description

More information

Package MultiMeta. February 19, 2015

Package MultiMeta. February 19, 2015 Type Package Package MultiMeta February 19, 2015 Title Meta-analysis of Multivariate Genome Wide Association Studies Version 0.1 Date 2014-08-21 Author Dragana Vuckovic Maintainer Dragana Vuckovic

More information

An Edge-Swap Heuristic for Finding Dense Spanning Trees

An Edge-Swap Heuristic for Finding Dense Spanning Trees Theory and Applications of Graphs Volume 3 Issue 1 Article 1 2016 An Edge-Swap Heuristic for Finding Dense Spanning Trees Mustafa Ozen Bogazici University, mustafa.ozen@boun.edu.tr Hua Wang Georgia Southern

More information

A NEW DYNAMIC SINGLE-ROW ROUTING FOR CHANNEL ASSIGNMENTS

A NEW DYNAMIC SINGLE-ROW ROUTING FOR CHANNEL ASSIGNMENTS A NEW DYNAMIC SINGLE-ROW ROUTING FOR CHANNEL ASSIGNMENTS N Patra 1, B N B Ray 2, S P Mohanty 3 1 Research Scholar, PG Dept of Comp.Sc. & Application,Utkal University, Odisha,India 2 Sr. Lecture, PG Dept

More information

EE795: Computer Vision and Intelligent Systems

EE795: Computer Vision and Intelligent Systems EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 04 130131 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Histogram Equalization Image Filtering Linear

More information

Uncertainties: Representation and Propagation & Line Extraction from Range data

Uncertainties: Representation and Propagation & Line Extraction from Range data 41 Uncertainties: Representation and Propagation & Line Extraction from Range data 42 Uncertainty Representation Section 4.1.3 of the book Sensing in the real world is always uncertain How can uncertainty

More information

Section 2-2 Frequency Distributions. Copyright 2010, 2007, 2004 Pearson Education, Inc

Section 2-2 Frequency Distributions. Copyright 2010, 2007, 2004 Pearson Education, Inc Section 2-2 Frequency Distributions Copyright 2010, 2007, 2004 Pearson Education, Inc. 2.1-1 Frequency Distribution Frequency Distribution (or Frequency Table) It shows how a data set is partitioned among

More information

Smooth Simultaneous Structural Graph Matching and Point-Set Registration

Smooth Simultaneous Structural Graph Matching and Point-Set Registration 8th IAPR - TC-15 Workshop on Graph-based Representations in Pattern Recognition Smooth Simultaneous Structural Graph Matching and Point-Set Registration Gerard Sanromà¹, René Alquézar² and Francesc Serratosa¹

More information

Minitab 18 Feature List

Minitab 18 Feature List Minitab 18 Feature List * New or Improved Assistant Measurement systems analysis * Capability analysis Graphical analysis Hypothesis tests Regression DOE Control charts * Graphics Scatterplots, matrix

More information

The pheno Package. December 11, Description Provides some easy-to-use functions for time series analyses of (plant-) phenological data sets.

The pheno Package. December 11, Description Provides some easy-to-use functions for time series analyses of (plant-) phenological data sets. The pheno Package December 11, 2003 Title Auxiliary functions for phenological data analysis Version 1.0 Date 13.11.2003 Author Provides some easy-to-use functions for time series analyses of (plant-)

More information

Package lle. February 20, 2015

Package lle. February 20, 2015 Type Package Title Locally linear embedding Version 1.1 Date 2012-03-21 Package lle February 20, 2015 Author Holger Diedrich, Dr. Markus Abel (Department of Physics, University Potsdam) Maintainer Holger

More information

Chapter 9 Graph Algorithms

Chapter 9 Graph Algorithms Introduction graph theory useful in practice represent many real-life problems can be if not careful with data structures Chapter 9 Graph s 2 Definitions Definitions an undirected graph is a finite set

More information

List of NEW Maths content

List of NEW Maths content List of NEW Maths content Our brand new Maths content for the new Maths GCSE (9-1) consists of 212 chapters broken up into 37 titles and 4 topic areas (Algebra, Geometry & Measures, Number and Statistics).

More information

SAS/STAT 13.1 User s Guide. The Power and Sample Size Application

SAS/STAT 13.1 User s Guide. The Power and Sample Size Application SAS/STAT 13.1 User s Guide The Power and Sample Size Application This document is an individual chapter from SAS/STAT 13.1 User s Guide. The correct bibliographic citation for the complete manual is as

More information

UNIT 1: NUMBER LINES, INTERVALS, AND SETS

UNIT 1: NUMBER LINES, INTERVALS, AND SETS ALGEBRA II CURRICULUM OUTLINE 2011-2012 OVERVIEW: 1. Numbers, Lines, Intervals and Sets 2. Algebraic Manipulation: Rational Expressions and Exponents 3. Radicals and Radical Equations 4. Function Basics

More information

MINITAB Release Comparison Chart Release 14, Release 13, and Student Versions

MINITAB Release Comparison Chart Release 14, Release 13, and Student Versions Technical Support Free technical support Worksheet Size All registered users, including students Registered instructors Number of worksheets Limited only by system resources 5 5 Number of cells per worksheet

More information

How does the ROI affect the thresholding?

How does the ROI affect the thresholding? How does the ROI affect the thresholding? Micro-computed tomography can be applied for the visualization of the inner structure of a material or biological tissue in a non-destructive manner. Besides visualization,

More information

3 Feature Selection & Feature Extraction

3 Feature Selection & Feature Extraction 3 Feature Selection & Feature Extraction Overview: 3.1 Introduction 3.2 Feature Extraction 3.3 Feature Selection 3.3.1 Max-Dependency, Max-Relevance, Min-Redundancy 3.3.2 Relevance Filter 3.3.3 Redundancy

More information

THE SWALLOW-TAIL PLOT: A SIMPLE GRAPH FOR VISUALIZING BIVARIATE DATA.

THE SWALLOW-TAIL PLOT: A SIMPLE GRAPH FOR VISUALIZING BIVARIATE DATA. STATISTICA, anno LXXIV, n. 2, 2014 THE SWALLOW-TAIL PLOT: A SIMPLE GRAPH FOR VISUALIZING BIVARIATE DATA. Maria Adele Milioli Dipartimento di Economia, Università di Parma, Parma, Italia Sergio Zani Dipartimento

More information

Introduction to Combinatorial Algorithms

Introduction to Combinatorial Algorithms Fall 2009 Intro Introduction to the course What are : Combinatorial Structures? Combinatorial Algorithms? Combinatorial Problems? Combinatorial Structures Combinatorial Structures Combinatorial structures

More information

8. MINITAB COMMANDS WEEK-BY-WEEK

8. MINITAB COMMANDS WEEK-BY-WEEK 8. MINITAB COMMANDS WEEK-BY-WEEK In this section of the Study Guide, we give brief information about the Minitab commands that are needed to apply the statistical methods in each week s study. They are

More information

Medical Image Analysis

Medical Image Analysis Medical Image Analysis Instructor: Moo K. Chung mchung@stat.wisc.edu Lecture 10. Multiple Comparisons March 06, 2007 This lecture will show you how to construct P-value maps fmri Multiple Comparisons 4-Dimensional

More information

Package mixphm. July 23, 2015

Package mixphm. July 23, 2015 Type Package Title Mixtures of Proportional Hazard Models Version 0.7-2 Date 2015-07-23 Package mixphm July 23, 2015 Fits multiple variable mixtures of various parametric proportional hazard models using

More information

Clustering. Chapter 10 in Introduction to statistical learning

Clustering. Chapter 10 in Introduction to statistical learning Clustering Chapter 10 in Introduction to statistical learning 16 14 12 10 8 6 4 2 0 2 4 6 8 10 12 14 1 Clustering ² Clustering is the art of finding groups in data (Kaufman and Rousseeuw, 1990). ² What

More information

Making Science Graphs and Interpreting Data

Making Science Graphs and Interpreting Data Making Science Graphs and Interpreting Data Eye Opener: 5 mins What do you see? What do you think? Look up terms you don t know What do Graphs Tell You? A graph is a way of expressing a relationship between

More information

ALGEBRA II A CURRICULUM OUTLINE

ALGEBRA II A CURRICULUM OUTLINE ALGEBRA II A CURRICULUM OUTLINE 2013-2014 OVERVIEW: 1. Linear Equations and Inequalities 2. Polynomial Expressions and Equations 3. Rational Expressions and Equations 4. Radical Expressions and Equations

More information

Supplementary Material

Supplementary Material Supplementary Material Figure 1S: Scree plot of the 400 dimensional data. The Figure shows the 20 largest eigenvalues of the (normalized) correlation matrix sorted in decreasing order; the insert shows

More information

Package gibbs.met. February 19, 2015

Package gibbs.met. February 19, 2015 Version 1.1-3 Title Naive Gibbs Sampling with Metropolis Steps Author Longhai Li Package gibbs.met February 19, 2015 Maintainer Longhai Li Depends R (>=

More information

Set up of the data is similar to the Randomized Block Design situation. A. Chang 1. 1) Setting up the data sheet

Set up of the data is similar to the Randomized Block Design situation. A. Chang 1. 1) Setting up the data sheet Repeated Measure Analysis (Univariate Mixed Effect Model Approach) (Treatment as the Fixed Effect and the Subject as the Random Effect) (This univariate approach can be used for randomized block design

More information

Lesson 18-1 Lesson Lesson 18-1 Lesson Lesson 18-2 Lesson 18-2

Lesson 18-1 Lesson Lesson 18-1 Lesson Lesson 18-2 Lesson 18-2 Topic 18 Set A Words survey data Topic 18 Set A Words Lesson 18-1 Lesson 18-1 sample line plot Lesson 18-1 Lesson 18-1 frequency table bar graph Lesson 18-2 Lesson 18-2 Instead of making 2-sided copies

More information

Lecture 18 Representation and description I. 2. Boundary descriptors

Lecture 18 Representation and description I. 2. Boundary descriptors Lecture 18 Representation and description I 1. Boundary representation 2. Boundary descriptors What is representation What is representation After segmentation, we obtain binary image with interested regions

More information

Introduction to Geospatial Analysis

Introduction to Geospatial Analysis Introduction to Geospatial Analysis Introduction to Geospatial Analysis 1 Descriptive Statistics Descriptive statistics. 2 What and Why? Descriptive Statistics Quantitative description of data Why? Allow

More information

NEW CERN PROTON SYNCHROTRON BEAM OPTIMIZATION TOOL

NEW CERN PROTON SYNCHROTRON BEAM OPTIMIZATION TOOL 16th Int. Conf. on Accelerator and Large Experimental Control Systems ICALEPCS2017, Barcelona, Spain JACoW Publishing NEW CERN PROTON SYNCHROTRON BEAM OPTIMIZATION TOOL E. Piselli, A. Akroh CERN, Geneva,

More information

Mobile Human Detection Systems based on Sliding Windows Approach-A Review

Mobile Human Detection Systems based on Sliding Windows Approach-A Review Mobile Human Detection Systems based on Sliding Windows Approach-A Review Seminar: Mobile Human detection systems Njieutcheu Tassi cedrique Rovile Department of Computer Engineering University of Heidelberg

More information

Fast or furious? - User analysis of SF Express Inc

Fast or furious? - User analysis of SF Express Inc CS 229 PROJECT, DEC. 2017 1 Fast or furious? - User analysis of SF Express Inc Gege Wen@gegewen, Yiyuan Zhang@yiyuan12, Kezhen Zhao@zkz I. MOTIVATION The motivation of this project is to predict the likelihood

More information

Methods for Intelligent Systems

Methods for Intelligent Systems Methods for Intelligent Systems Lecture Notes on Clustering (II) Davide Eynard eynard@elet.polimi.it Department of Electronics and Information Politecnico di Milano Davide Eynard - Lecture Notes on Clustering

More information

SAS (Statistical Analysis Software/System)

SAS (Statistical Analysis Software/System) SAS (Statistical Analysis Software/System) SAS Analytics:- Class Room: Training Fee & Duration : 23K & 3 Months Online: Training Fee & Duration : 25K & 3 Months Learning SAS: Getting Started with SAS Basic

More information

Minimum Spanning Trees My T. UF

Minimum Spanning Trees My T. UF Introduction to Algorithms Minimum Spanning Trees @ UF Problem Find a low cost network connecting a set of locations Any pair of locations are connected There is no cycle Some applications: Communication

More information

Complexity Results on Graphs with Few Cliques

Complexity 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 information

3 INTEGER LINEAR PROGRAMMING

3 INTEGER LINEAR PROGRAMMING 3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=

More information

Lecture and notes by: Nate Chenette, Brent Myers, Hari Prasad November 8, Property Testing

Lecture and notes by: Nate Chenette, Brent Myers, Hari Prasad November 8, Property Testing Property Testing 1 Introduction Broadly, property testing is the study of the following class of problems: Given the ability to perform (local) queries concerning a particular object (e.g., a function,

More information

Clustering Using Graph Connectivity

Clustering Using Graph Connectivity Clustering Using Graph Connectivity Patrick Williams June 3, 010 1 Introduction It is often desirable to group elements of a set into disjoint subsets, based on the similarity between the elements in the

More information

Expectation Maximization (EM) and Gaussian Mixture Models

Expectation Maximization (EM) and Gaussian Mixture Models Expectation Maximization (EM) and Gaussian Mixture Models Reference: The Elements of Statistical Learning, by T. Hastie, R. Tibshirani, J. Friedman, Springer 1 2 3 4 5 6 7 8 Unsupervised Learning Motivation

More information

STATISTICS (STAT) Statistics (STAT) 1

STATISTICS (STAT) Statistics (STAT) 1 Statistics (STAT) 1 STATISTICS (STAT) STAT 2013 Elementary Statistics (A) Prerequisites: MATH 1483 or MATH 1513, each with a grade of "C" or better; or an acceptable placement score (see placement.okstate.edu).

More information

Exploring Data. This guide describes the facilities in SPM to gain initial insights about a dataset by viewing and generating descriptive statistics.

Exploring Data. This guide describes the facilities in SPM to gain initial insights about a dataset by viewing and generating descriptive statistics. This guide describes the facilities in SPM to gain initial insights about a dataset by viewing and generating descriptive statistics. 2018 by Minitab Inc. All rights reserved. Minitab, SPM, SPM Salford

More information

Basics of Network Analysis

Basics of Network Analysis Basics of Network Analysis Hiroki Sayama sayama@binghamton.edu Graph = Network G(V, E): graph (network) V: vertices (nodes), E: edges (links) 1 Nodes = 1, 2, 3, 4, 5 2 3 Links = 12, 13, 15, 23,

More information

Supplementary text S6 Comparison studies on simulated data

Supplementary text S6 Comparison studies on simulated data Supplementary text S Comparison studies on simulated data Peter Langfelder, Rui Luo, Michael C. Oldham, and Steve Horvath Corresponding author: shorvath@mednet.ucla.edu Overview In this document we illustrate

More information

31.6 Powers of an element

31.6 Powers of an element 31.6 Powers of an element Just as we often consider the multiples of a given element, modulo, we consider the sequence of powers of, modulo, where :,,,,. modulo Indexing from 0, the 0th value in this sequence

More information

A Tutorial on VLFeat

A Tutorial on VLFeat A Tutorial on VLFeat Antonino Furnari Image Processing Lab Dipartimento di Matematica e Informatica Università degli Studi di Catania furnari@dmi.unict.it 17/04/2014 MATLAB & Computer Vision 2 MATLAB offers

More information

Using PageRank in Feature Selection

Using PageRank in Feature Selection Using PageRank in Feature Selection Dino Ienco, Rosa Meo, and Marco Botta Dipartimento di Informatica, Università di Torino, Italy {ienco,meo,botta}@di.unito.it Abstract. Feature selection is an important

More information

Minitab 17 commands Prepared by Jeffrey S. Simonoff

Minitab 17 commands Prepared by Jeffrey S. Simonoff Minitab 17 commands Prepared by Jeffrey S. Simonoff Data entry and manipulation To enter data by hand, click on the Worksheet window, and enter the values in as you would in any spreadsheet. To then save

More information

Network Traffic Measurements and Analysis

Network Traffic Measurements and Analysis DEIB - Politecnico di Milano Fall, 2017 Introduction Often, we have only a set of features x = x 1, x 2,, x n, but no associated response y. Therefore we are not interested in prediction nor classification,

More information

CSE 417T: Introduction to Machine Learning. Lecture 6: Bias-Variance Trade-off. Henry Chai 09/13/18

CSE 417T: Introduction to Machine Learning. Lecture 6: Bias-Variance Trade-off. Henry Chai 09/13/18 CSE 417T: Introduction to Machine Learning Lecture 6: Bias-Variance Trade-off Henry Chai 09/13/18 Let! ", $ = the maximum number of dichotomies on " points s.t. no subset of $ points is shattered Recall

More information

Package mgc. April 13, 2018

Package mgc. April 13, 2018 Type Package Title Multiscale Graph Correlation Version 1.0.1 Date 2018-04-12 Package mgc April 13, 2018 Maintainer Multiscale Graph Correlation (MGC) is a framework developed by Shen

More information

Exploratory data analysis for microarrays

Exploratory data analysis for microarrays Exploratory data analysis for microarrays Jörg Rahnenführer Computational Biology and Applied Algorithmics Max Planck Institute for Informatics D-66123 Saarbrücken Germany NGFN - Courses in Practical DNA

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 18 Luca Trevisan March 3, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 18 Luca Trevisan March 3, 2011 Stanford University CS359G: Graph Partitioning and Expanders Handout 8 Luca Trevisan March 3, 20 Lecture 8 In which we prove properties of expander graphs. Quasirandomness of Expander Graphs Recall that

More information

The Curse of Dimensionality

The Curse of Dimensionality The Curse of Dimensionality ACAS 2002 p1/66 Curse of Dimensionality The basic idea of the curse of dimensionality is that high dimensional data is difficult to work with for several reasons: Adding more

More information

Combo Charts. Chapter 145. Introduction. Data Structure. Procedure Options

Combo Charts. Chapter 145. Introduction. Data Structure. Procedure Options Chapter 145 Introduction When analyzing data, you often need to study the characteristics of a single group of numbers, observations, or measurements. You might want to know the center and the spread about

More information

[Programming Assignment] (1)

[Programming Assignment] (1) http://crcv.ucf.edu/people/faculty/bagci/ [Programming Assignment] (1) Computer Vision Dr. Ulas Bagci (Fall) 2015 University of Central Florida (UCF) Coding Standard and General Requirements Code for all

More information

Data Mining and. in Dynamic Networks

Data Mining and. in Dynamic Networks Data Mining and Knowledge Discovery in Dynamic Networks Panos M. Pardalos Center for Applied Optimization Dept. of Industrial & Systems Engineering Affiliated Faculty of: Computer & Information Science

More information

Computing Largest Correcting Codes and Their Estimates Using Optimization on Specially Constructed Graphs p.1/30

Computing Largest Correcting Codes and Their Estimates Using Optimization on Specially Constructed Graphs p.1/30 Computing Largest Correcting Codes and Their Estimates Using Optimization on Specially Constructed Graphs Sergiy Butenko Department of Industrial Engineering Texas A&M University College Station, TX 77843

More information

Indexing by Shape of Image Databases Based on Extended Grid Files

Indexing by Shape of Image Databases Based on Extended Grid Files Indexing by Shape of Image Databases Based on Extended Grid Files Carlo Combi, Gian Luca Foresti, Massimo Franceschet, Angelo Montanari Department of Mathematics and ComputerScience, University of Udine

More information

11/22/2016. Chapter 9 Graph Algorithms. Introduction. Definitions. Definitions. Definitions. Definitions

11/22/2016. Chapter 9 Graph Algorithms. Introduction. Definitions. Definitions. Definitions. Definitions Introduction Chapter 9 Graph Algorithms graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 2 Definitions an undirected graph G = (V, E) is

More information

Using Symbolic Techniques to find the Maximum Clique in Very Large Sparse Graphs

Using Symbolic Techniques to find the Maximum Clique in Very Large Sparse Graphs Using Symbolic Techniques to find the Maximum Clique in Very Large Sparse Graphs Fulvio CORNO, Paolo PRINETTO, Matteo SONZA REORDA Politecnico di Torino Dipartimento di Automatica e Informatica Torino,

More information

STATA 13 INTRODUCTION

STATA 13 INTRODUCTION STATA 13 INTRODUCTION Catherine McGowan & Elaine Williamson LONDON SCHOOL OF HYGIENE & TROPICAL MEDICINE DECEMBER 2013 0 CONTENTS INTRODUCTION... 1 Versions of STATA... 1 OPENING STATA... 1 THE STATA

More information

Spectral Clustering and Community Detection in Labeled Graphs

Spectral Clustering and Community Detection in Labeled Graphs Spectral Clustering and Community Detection in Labeled Graphs Brandon Fain, Stavros Sintos, Nisarg Raval Machine Learning (CompSci 571D / STA 561D) December 7, 2015 {btfain, nisarg, ssintos} at cs.duke.edu

More information

Metrics for Performance Evaluation How to evaluate the performance of a model? Methods for Performance Evaluation How to obtain reliable estimates?

Metrics for Performance Evaluation How to evaluate the performance of a model? Methods for Performance Evaluation How to obtain reliable estimates? Model Evaluation Metrics for Performance Evaluation How to evaluate the performance of a model? Methods for Performance Evaluation How to obtain reliable estimates? Methods for Model Comparison How to

More information

Estimating Human Pose in Images. Navraj Singh December 11, 2009

Estimating Human Pose in Images. Navraj Singh December 11, 2009 Estimating Human Pose in Images Navraj Singh December 11, 2009 Introduction This project attempts to improve the performance of an existing method of estimating the pose of humans in still images. Tasks

More information