similar to: Newer Matrix Factorization Techniques

Hi all, I found that the PCA gave chaotic results when there are big changes in a few data points. Are there "improved" versions of PCA in R that can help with this problem? Please give me some pointers... Thank you! [[alternative HTML version deleted]]

Hi all, Is everyone switched over to the Google lists? I''m basically ready for the switch, I think, and doing so would be one more closed loop for me. I notice we''ve only got a bit over 300 subscribers to the Puppet Users list, while my madstop list has nearly 600. This is a bit depressing, but it probably represents a better idea of who''s actually using the

Thank you all for your answers. One told me that in order to allow the students to upload/download from their home directories, FTP or something like that is a simple and easy choice. As domain logon and roaming profil is not needed and FTP can be logged, I'll use this. Another question for our brillants candidates : How to batch the creation of a Samba account ? I mean, everytime you

Hi all, I am trying to write an application to monitor queues using the Asterisk Management API. So far I have had some level of sucess, basically reverse engineering the protocol and the event messages using ethereal etc. I know there are a couple of pages on the Wiki that attempt (no dis-respect to who ever did it as it has been a great help) to document the API and was wondering if there

I have been playing around with sparse matrices in the Matrix package, in particularly with the Cholesky factorization of matrices of class dsCMatrix. And BTW, what a fantastic package. My problem is that I have to carry out repeated Cholesky factorization of a spares symmetric matrices, say Q_1, Q_2, ...,Q_n, where the Q's have the same non-zero pattern. I know in this case one does

Hello, I'm in the early stages of designing an Emergency calling service IVR application. The IVR application asks simple one or two questions like "which is the postal code of the area you are currently calling from ?" "Is the correct ?". The expected values are a 5-digits number like "twenty-five-thousand-two-hundreds-twelve" or

Hi I agree with your comments and of course you identifie the problems regarding the implementation of your suggestions. Of course we'd need bidireccional communication to implement it. I think it's impossible to do it statically. What I want with NEdit is a very ligth editor (which jedit is not) that highlights the most important language syntax, so that It becomes easier to write

Hi: Does R have a function as gsorth is SAS, that perform a the Gram-Schmidt orthonormal factorization of the m ?n matrix A, where m is greater than or equal to n? That is, the GSORTH subroutine in SAS computes the column-orthonormal m ?n matrix P and the upper triangular n ?n matrix T such that A = P*T. or any other version of Gram-Schmidt orthonormal factorization? I search the help, but I

Hi everyone: I try to use r to do the Cholesky Decomposition,which is A=LDL',so far I only found how to decomposite A in to LL' by using chol(A),the function Cholesky(A) doesnt work,any one know other command to decomposte A in to LDL' My r code is: library(Matrix) A=matrix(c(1,1,1,1,5,5,1,5,14),nrow=3) > chol(A) [,1] [,2] [,3] [1,] 1 1 1 [2,] 0 2 2

Hi: I've been reading "Computational Methods for Multilevel Modeling" by Pinheiro and Bates, the idea of embedding the technique in my own c-level code. The basic idea is to rewrite the joint density in a form to mimic a single least squares problem conditional upon the variance parameters. The paper is fairly clear except that some important level of detail is missing. For

Hi all, Has any of you implemented code for non-negative matrix factorization to solve Y=T P' +E; dim(Y)=n,p ; dim(T)=n,nc; dim (P)=(p,nc); dim(E)=n,p where T and P must be non-negative and E either Gaussian or Poisson noise. I'm looking for two variants: 1. Easy (I think), T is known (that is we just want to solve the general inverse problem) 2. Harder (?), T is unknown (under some

Hi there, Given a positive definite symmetric matrix, I can use chol(x) to obtain U where U is upper triangular and x=U'U. For example, x=matrix(c(5,1,2,1,3,1,2,1,4),3,3) U=chol(x) U # [,1] [,2] [,3] #[1,] 2.236068 0.4472136 0.8944272 #[2,] 0.000000 1.6733201 0.3585686 #[3,] 0.000000 0.0000000 1.7525492 t(U)%*%U # this is exactly x Does anyone know how to obtain L such

The 'NMF' package implements a number of standard algorithms to perform Nonnegative Matrix Factorization. It also provides a flexible framework to easily test and develop new methods, as well as a layer to work with Bioconductor objects. The package is available from CRAN. Feedbacks are welcome. -- Renaud Gaujoux Computational Biology - University of Cape Town South Africa

The 'NMF' package implements a number of standard algorithms to perform Nonnegative Matrix Factorization. It also provides a flexible framework to easily test and develop new methods, as well as a layer to work with Bioconductor objects. The package is available from CRAN. Feedbacks are welcome. -- Renaud Gaujoux Computational Biology - University of Cape Town South Africa

Dear All, My question is simple but I need someone to help me out. Suppose I have a positive definite matrix A. The funtion chol() gives matrix L, such that A = L'L. The inverse of A, say A.inv, is also positive definite and can be factorized as A.inv = M'M. Then A = inverse of (A.inv) = inverse of (M'M) = (inverse of M) %*% (inverse of M)' = ((inverse of

Hello, I'm running a samba 3.0.14a server in production on a fedora core 3 (kernel 2.6.9-1.667smp) with a least 250 clients (XP Pro SP2) (up to 400 sometimes). A few days ago, a problem appeared with a soft that we are using for a long time. (Petit Robert, a french dictionnary). When someone launch the dictionnary, many clients are freezed when they try to access to the "start

Hi: I've been reading "Computational Methods for Multilevel Modeling" by Pinheiro and Bates, the idea of embedding the technique in my own c-level code. The basic idea is to rewrite the joint density in a form to mimic a single least squares problem conditional upon the variance parameters. The paper is fairly clear except that some important level of detail is missing. For

On Tue, 2 Oct 2001, safemode wrote: > On Tuesday 02 October 2001 08:14, Nathan I. Sharfi wrote: > > I doubt this; why would any self-respecting label advertise that their > > music is capable of being ripped and distributed electronically? > > > > On Tue, 2 Oct 2001, safemode wrote: > > > > <snip> > > > > > You're probably going to

Hi Rich, I've changed part of generator.ml to look like this: (match snd style with | [] -> () | args -> pr " memset (&args, 0, sizeof args);\n"; pr "\n"; pr " if (!xdr_guestfs_%s_args (xdr_in, &args)) {\n" name; pr " reply_with_error (\"%%s: daemon failed to decode

Hi everyone, I have a very quick question: Is there a ready-made function in R or any R packages to find the prime factorization of an integer? -- View this message in context: http://r.789695.n4.nabble.com/Prime-Factorization-tp2548877p2548877.html Sent from the R help mailing list archive at Nabble.com.