Displaying 20 results from an estimated 21 matches for "sparsity".

Did you mean:
sparsify

2014 Jul 25

3

wordcloud y tabla de palabras

...DocumentMatrix(info.cor.cl)
result<-list(name = informes, tdm= info.tdm)
}
>tdm<-lapply(informes, TDM, path = pathname)
Resultado:
> tdm
[[1]]
[[1]]$name
[1] "2013"
[[1]]$tdm
<<TermDocumentMatrix (terms: 1540, documents: 1)>>
Non-/sparse entries: 1540/0
Sparsity : 0%
Maximal term length: 18
Weighting : term frequency (tf)
[[2]]
[[2]]$name
[1] "2005"
[[2]]$tdm
<<TermDocumentMatrix (terms: 1849, documents: 1)>>
Non-/sparse entries: 1849/0
Sparsity : 0%
Maximal term length: 19
Weighting : te...

2007 Sep 04

0

[LLVMdev] [PATCH]: Add SparseBitmap implementation

On Tue, Sep 04, 2007 at 10:35:10AM -0400, Daniel Berlin wrote:
> On 9/4/07, Dan Gohman <djg at cray.com> wrote:
> > On Fri, Aug 31, 2007 at 08:10:33PM -0400, Daniel Berlin wrote:
> > > + template <int ElementSize>
> > > + class SparseBitmap {
> >
> > Do you expect clients will often want custom ElementSize values? Otherwise,
> > it

2017 Oct 21

1

What exactly is an dgCMatrix-class. There are so many attributes.

...hmetic with them can be much faster because it is based on
> sophisticated sparse matrix linear algebra, notably the
> sparse Cholesky decomposition for solve() etc.
>
> Of course the efficency only applies if most of the
> matrix entries _are_ 0.
> You can measure the "sparsity" or rather the "density", of a
> matrix by
>
> nnzero(A) / length(A)
>
> where length(A) == nrow(A) * ncol(A) as for regular matrices
> (but it does *not* integer overflow)
> and nnzero(.) is a simple utility from Matrix
> which -- very efficiently fo...

2014 Jul 28

2

wordcloud y tabla de palabras

..., TDM, path = pathname)
> >
> > Resultado:
> >
> >> tdm
> > [[1]]
> > [[1]]$name
> > [1] "2013"
> > [[1]]$tdm
> > <<TermDocumentMatrix (terms: 1540, documents: 1)>>
> > Non-/sparse entries: 1540/0
> > Sparsity : 0%
> > Maximal term length: 18
> > Weighting : term frequency (tf)
> >
> > [[2]]
> > [[2]]$name
> > [1] "2005"
> > [[2]]$tdm
> > <<TermDocumentMatrix (terms: 1849, documents: 1)>>
> > Non-/sparse en...

2007 Sep 04

2

[LLVMdev] [PATCH]: Add SparseBitmap implementation

On 9/4/07, Dan Gohman <djg at cray.com> wrote:
> On Fri, Aug 31, 2007 at 08:10:33PM -0400, Daniel Berlin wrote:
> > Suggestions, criticisms, etc, are welcome.
>
> I haven't studied the implementation, but I have a few comments on
> the interface, and some style comments, below.
>
> > Index: include/llvm/ADT/SparseBitmap.h
> >

2017 Oct 21

0

What exactly is an dgCMatrix-class. There are so many attributes.

...memory and
2. matrix arithmetic with them can be much faster because it is based on
sophisticated sparse matrix linear algebra, notably the
sparse Cholesky decomposition for solve() etc.
Of course the efficency only applies if most of the
matrix entries _are_ 0.
You can measure the "sparsity" or rather the "density", of a
matrix by
nnzero(A) / length(A)
where length(A) == nrow(A) * ncol(A) as for regular matrices
(but it does *not* integer overflow)
and nnzero(.) is a simple utility from Matrix
which -- very efficiently for sparseMatrix objects -- gives the
num...

2012 Mar 29

5

[LLVMdev] GSoC - Range Analysis

...iki/gallery that will give
you an idea of what kind of information we can find. Our analysis
comes together with a dynamic profiler that points the minimum and
maximum values that each variable assumes during program execution
too. And it uses a live range splitting strategy to obtain data-flow
sparsity that is lightning fast. It is more than 100x faster than the
original implementation of SSI in LLVM 2.7, for instance. There are a
number of LLVMers, outside my university, that use our analysis.
So, I would like to propose a summer of code that consists in (i)
integrating our infra-structure in...

2007 Nov 16

1

Efficient way to compute power of a sparse matrix

Dear all,
I would like to compute power of a square non symmetric matrix. This is
a part of a simulation study. Matrices are quite large (e.g., 900 by
900), and contains many 0 (more than 99 %). I have try the function
mtx.exp of the Biodem package:
library(Biodem)
m <- matrix(0, 900, 900)
i <- sample(1:900, 3000, replace = T)
j <- sample(1:900, 3000, replace = T)
for(x in 1:3000)

2012 Mar 29

0

[LLVMdev] GSoC - Range Analysis

...give
> you an idea of what kind of information we can find. Our analysis
> comes together with a dynamic profiler that points the minimum and
> maximum values that each variable assumes during program execution
> too. And it uses a live range splitting strategy to obtain data-flow
> sparsity that is lightning fast. It is more than 100x faster than the
> original implementation of SSI in LLVM 2.7, for instance. There are a
> number of LLVMers, outside my university, that use our analysis.
What version of LLVM does your analysis use currently?
It sounds like your analysis is fast...

2011 Jan 12

0

Multivariate autoregressive models with lasso penalization

I wish to estimate sparse causal networks from simulated time series data.
Although there's some discussion about this problem in the literature (at
least a few authors have used lasso and l(1,2) regularization to enforce
sparsity in multivariate autoregressive models, e.g.,
http://user.cs.tu-berlin.de/~nkraemer/papers/grplasso_causality.pdf), I
can't find any R packages with these capabilities.
Has anyone in the R community experimented with such or put code out for
this problem?
Many thanks.
John...

2012 Mar 07

0

sparsenet: a new package for sparse model selection

...ty.
The package is based on our JASA paper
Rahul Mazumder, Jerome Friedman and Trevor Hastie: SparseNet : Coordinate Descent with Non-Convex Penalties. (JASA 2011)
http://www.stanford.edu/~hastie/Papers/Sparsenet/jasa_MFH_final.pdf
We use Zhang's MC+ penalty to impose sparsity in model selection. This penalty
parametrizes a family ranging between L1 and L0 regularization. One nice feature of this
family is that the single-coordinate optimization problems are convex, making it
ideal for coordinate descent.
The package fits the regularization surface for each parameter -...

2012 Mar 07

0

sparsenet: a new package for sparse model selection

...ty.
The package is based on our JASA paper
Rahul Mazumder, Jerome Friedman and Trevor Hastie: SparseNet : Coordinate Descent with Non-Convex Penalties. (JASA 2011)
http://www.stanford.edu/~hastie/Papers/Sparsenet/jasa_MFH_final.pdf
We use Zhang's MC+ penalty to impose sparsity in model selection. This penalty
parametrizes a family ranging between L1 and L0 regularization. One nice feature of this
family is that the single-coordinate optimization problems are convex, making it
ideal for coordinate descent.
The package fits the regularization surface for each parameter -...

2018 Jan 05

0

Document Term Matrix

Hi,
Does anyone know what is maximal term length in Document Term Matrix?
<<DocumentTermMatrix (documents: 255, terms: 858)>>
Non-/sparse entries: 8081/210709
Sparsity : 96%
Maximal term length: 12
Weighting : term frequency (tf)
Thanks for any help!
Elahe

2013 Apr 02

0

softImpute_1.0 uploaded to CRAN

...e svd imputation
* softImpute has an option "type" which can be "svd" or "als" (alternating least squares), for specifying which of the two approaches above should be used.
*included in the package is svd.als, an efficient rank-restricted svd algorithm that can exploit sparsity and other special structure, and accept warm starts.
* a function biScale is provided, for centering and scaling both rows and columns of matrix to have means zero and variance 1. The centering and scaling
constants are stored on the object. For sparse matrices with centering, the centered object...

2013 Apr 02

0

softImpute_1.0 uploaded to CRAN

...e svd imputation
* softImpute has an option "type" which can be "svd" or "als" (alternating least squares), for specifying which of the two approaches above should be used.
*included in the package is svd.als, an efficient rank-restricted svd algorithm that can exploit sparsity and other special structure, and accept warm starts.
* a function biScale is provided, for centering and scaling both rows and columns of matrix to have means zero and variance 1. The centering and scaling
constants are stored on the object. For sparse matrices with centering, the centered object...

2014 Jul 29

2

wordcloud y tabla de palabras [Avanzando]

...gt;>>> > [[1]]
>>>> > [[1]]$name
>>>> > [1] "2013"
>>>> > [[1]]$tdm
>>>> > <<TermDocumentMatrix (terms: 1540, documents: 1)>>
>>>> > Non-/sparse entries: 1540/0
>>>> > Sparsity : 0%
>>>> > Maximal term length: 18
>>>> > Weighting : term frequency (tf)
>>>> >
>>>> > [[2]]
>>>> > [[2]]$name
>>>> > [1] "2005"
>>>> > [[2]]$tdm
>>>>...

2017 Oct 20

4

What exactly is an dgCMatrix-class. There are so many attributes.

Thank you for your responses.
I guess I don't feel alone. I don't find the documentation go into any
detail.
I also find it surprising that,
> object.size(train$data)
1730904 bytes
> object.size(as.matrix(train$data))
6575016 bytes
the dgCMatrix actually takes less memory, though it *looks* like the
opposite.
Cheers!
On Fri, Oct 20, 2017 at 3:22 PM, David Winsemius

2010 Jun 11

2

Compiling R with multi-threaded BLAS math libraries - why not actually ?

Hello all,
I came across<http://www.r-bloggers.com/performance-benefits-of-linking-r-to-multithreaded-math-libraries/>
David
Smith's new post
Performance benefits of linking R to multithreaded math
libraries<http://blog.revolutionanalytics.com/2010/06/performance-benefits-of-multithreaded-r.html>
Which explains how (and why) REvolution

2015 Jun 24

8

rsyncing directories - sanity check

hey guys,
I need to mount a different volume onto /var so we have more room to
breathe. I'll be turning 3 servers into an elasticsearch cluster. And for
some reason when the servers were ordered the large local volume ended up
being /usr when the ES rpm likes to store it's indexes on /var.
So I'm syncing the contents of both directories to a different place, and
I'm

2007 Sep 04

6

[LLVMdev] [PATCH]: Add SparseBitmap implementation

On 9/4/07, Dan Gohman <djg at cray.com> wrote:
> On Tue, Sep 04, 2007 at 10:35:10AM -0400, Daniel Berlin wrote:
> > On 9/4/07, Dan Gohman <djg at cray.com> wrote:
> > > On Fri, Aug 31, 2007 at 08:10:33PM -0400, Daniel Berlin wrote:
> > > > + template <int ElementSize>
> > > > + class SparseBitmap {
> > >
>