The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Temporal causal modeling with graphical granger methods
Abstract
The need for mining causality, beyond mere statistical correlations, for real world problems has been recognized widely. Many of these applications naturally involve temporal data, which raises the challenge of how best to leverage the temporal information for causal modeling. Recently graphical modeling with the concept of “Granger causality”, based on the intuition that a cause helps predict its effects in the future, has gained attention in many domains involving time series data analysis. With the surge of interest in model selection methodologies for regression, such as the Lasso, as practical alternatives to solving structural learning of graphical models, the question arises whether and how to combine these two notions into a practically viable approach for temporal causal modeling. In this paper, we examine a host of related
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Investigating causal relations by econometric models and cross-spectral methods
Granger, C. W. J. (1969) · Econometrica · doi:10.2307/1912791 · Cited by 22,989
The balanced scorecard : measures that drive performance
Caplan, R. S. (1992) · Harvard business review · Cited by 12,085
The balanced scorecard: Translating strategy into action
(1997) · Long Range Planning · doi:10.1016/s0024-6301(97)80925-9 · Cited by 8,192
(1992) · PubMed · Cited by 7,979
Investigating Causal Relations by Econometric Models and Cross-Spectral Methods
Granger, C. W. J. (2010) · Essays in Econometrics · doi:10.1017/cbo9780511753978.002 · Cited by 4,762
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (1993) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2748-9 · Cited by 4,617
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (2001) · doi:10.7551/mitpress/1754.001.0001 · Cited by 4,521
Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
Golub, G. H., Heath, M., & Wahba, G. (1979) · Technometrics · doi:10.1080/00401706.1979.10489751 · Cited by 3,934
Lauritzen, S. L. (1996) · doi:10.1093/oso/9780198522195.001.0001 · Cited by 2,976
High dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · Cited by 2,539
High-dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · The Annals of Statistics · doi:10.1214/009053606000000281 · Cited by 2,521 · cited 2×
“More rigorously, letting p denote the number of features, a be an arbitrary node in the true graph G, and nea be the set of neighbors of a in G = 〈V, E〉, and θa be the coefficient vector of the optimal linear regressor for a using nea, we have the following theorem due to [19].”
BackgroundMethod(1998) · Springer eBooks · doi:10.1007/978-94-011-5014-9 · Cited by 2,418
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
A Tutorial on Learning with Bayesian Networks
Heckerman, D. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_11 · Cited by 1,220
A Unifying Review of Linear Gaussian Models
Roweis, S., & Ghahramani, Z. (1999) · Neural Computation · doi:10.1162/089976699300016674 · Cited by 869
(1935) · Economic Record · doi:10.1111/j.1475-4932.1935.tb02774.x · Cited by 712
The Oxford University Press, 1468–192
(1922) · Notes and Queries · doi:10.1093/nq/s12-x.208.280b · Cited by 614
Estimating high-dimensional directed acyclic graphs with the PC-algorithm
Kalisch, M., & Bühlmann, P. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0510436 · Cited by 591
Learning Bayesian Network Structure from Massive Datasets: The "Sparse Candidate" Algorithm
Friedman, N., Nachman, I., & Pe’er, D. (1999) · arXiv (Cornell University) · doi:10.13140/2.1.1125.2169 · Cited by 501
Sparse graphical models for exploring gene expression data
Dobra, A., Hans, C., Jones, B., Nevins, J. R., Yao, G., & West, M. (2004) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2004.02.009 · Cited by 462
The balanced scorecard: translating strategy into action
(1997) · Choice Reviews Online · doi:10.5860/choice.34-2839 · Cited by 426
Estimating brain functional connectivity with sparse multivariate autoregression
Valdés-Sosa, P. A., Sánchez-Bornot, J. M., Lage-Castellanos, A., Vega-Hernández, M., Bosch-Bayard, J., Melie-García, L., & Canales-Rodríguez, E. (2005) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2005.1654 · Cited by 323
Learning the Structure of Linear Latent Variable Models
Silva, R., Scheines, R., Glymour, C., & Spirtes, P. (2018) · doi:10.1184/r1/6492122 · Cited by 172
Opgen-Rhein, R., & Strimmer, K. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-s2-s3 · Cited by 166
Discussion of "Least Angle Regression" by Efron, Hastie, Johnstone and Tibshirani
Turlach, B. A. (2004) · UWA Profiles and Research Repository (University of Western Australia) · Cited by 153
A SINful approach to Gaussian graphical model selection
Drton, M., & Perlman, M. D. (2007) · Journal of Statistical Planning and Inference · doi:10.1016/j.jspi.2007.05.035 · Cited by 117
Graphical Models for the Identification of Causal Structures in Multivariate Time Series Models
Moneta, A., & Spirtes, P. (2006) · Advances in intelligent systems research/Advances in Intelligent Systems Research · doi:10.2991/jcis.2006.171 · Cited by 38
Combining var estimation and state space model reduction for simple good predictions
Gilbert, P. (1995) · Journal of Forecasting · doi:10.1002/for.3980140307 · Cited by 37
Finding a causal ordering via independent component analysis
Shimizu, S., Hyvärinen, A., Hoyer, P. O., & Kano, Y. (2005) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2005.05.004 · Cited by 24
Estimation of linear, non-gaussian causal models in the presence of confounding latent variablesPreprint
Hoyer, P. O., Shimizu, S., & Kerminen, A. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0603038 · Cited by 23
Cited by
Spatio-Temporal Data Mining: A Survey of Problems and Methods
Atluri, G., Karpatne, A., & Kumar, V. (2019) · ACM Computing Surveys · doi:10.1145/3161602 · Cited by 461
Soldani, J., & Brogi, A. (2023) · ACM Computing Surveys · doi:10.1145/3501297 · Cited by 256
Network inference with Granger causality ensembles on single-cell transcriptomics
Deshpande, A., Chu, L.-F., Stewart, R., & Gitter, A. (2022) · Cell Reports · doi:10.1016/j.celrep.2022.110333 · Cited by 130
Anomaly Detection in Microservice-Based Systems
Nobre, J., Pires, E. J. S., & Reis, A. (2023) · Applied Sciences · doi:10.3390/app13137891 · Cited by 34
Metadata
- Authors
- Arnold, A., Liu, Y., & Abe, N.
- Venue
- Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2007-08-12
- Pages
- 66-75
- OpenAlex
- W2118418963
- Cited by
- 291
- References
- 31
- FWCI
- 3.69
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.