Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2011
DOI: 10.1145/2020408.2020526
|View full text |Cite
|
Sign up to set email alerts
|

Data intensive analysis on the gordon high performance data and compute system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
3
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 6 publications
0
3
0
Order By: Relevance
“…This assumption is made implicitly in other projects that aggregate information about repression into one scale (Cingranelli and Richards 2012a, b; Gibney, Cornett and Wood 2012; Landman and Larizza 2009). 28 Each model compared in this article is estimated with two MCMC chains, which are run 100,000 iterations using JAGS (Plummer 2010) on the Gordon Supercomputer (Sinkovits et al 2011). More importantly however, different repressive tactics can be related to one another in theoretically important but noncausal ways.…”
Section: Two Competing Latent Variables Models Of Repressionmentioning
confidence: 99%
See 1 more Smart Citation
“…This assumption is made implicitly in other projects that aggregate information about repression into one scale (Cingranelli and Richards 2012a, b; Gibney, Cornett and Wood 2012; Landman and Larizza 2009). 28 Each model compared in this article is estimated with two MCMC chains, which are run 100,000 iterations using JAGS (Plummer 2010) on the Gordon Supercomputer (Sinkovits et al 2011). More importantly however, different repressive tactics can be related to one another in theoretically important but noncausal ways.…”
Section: Two Competing Latent Variables Models Of Repressionmentioning
confidence: 99%
“… 28 Each model compared in this article is estimated with two MCMC chains, which are run 100,000 iterations using JAGS (Plummer 2010) on the Gordon Supercomputer (Sinkovits et al 2011). The first 50,000 iterations were thrown away as burn-in and the rest were used for inference.…”
mentioning
confidence: 99%
“…For more information on identification problems in IRT models, see Jackman (2009). The latent treaty model is estimated with two MCMC chains, which are run for 100,000 iterations using JAGS (Plummer 2010) on the Gordon Supercomputer (Sinkovits et al 2011). The first 50,000 iterations were thrown away as burn-in and the rest were used for inference.…”
mentioning
confidence: 99%