Skip to main content Accessibility help
×
Home
Hostname: page-component-544b6db54f-bkjnw Total loading time: 0.248 Render date: 2021-10-20T08:07:08.798Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true, "newUsageEvents": true }

Comorbid science? 1

Published online by Cambridge University Press:  29 June 2010

David Danks
Affiliation:
Department of Philosophy, Carnegie Mellon University, Pittsburgh, PA 15213. ddanks@cmu.edu http://www.hss.cmu.edu/philosophy/faculty-danks.php sfancsal@andrew.cmu.edu cg09@andrew.cmu.edu http://www.hss.cmu.edu/philosophy/faculty-glymour.php scheines@cmu.edu http://www.hss.cmu.edu/philosophy/faculty-scheines.php Institute for Human and Machine Cognition, Pittsburgh, PA 15213.
Stephen Fancsali
Affiliation:
Department of Philosophy, Carnegie Mellon University, Pittsburgh, PA 15213. ddanks@cmu.edu http://www.hss.cmu.edu/philosophy/faculty-danks.php sfancsal@andrew.cmu.edu cg09@andrew.cmu.edu http://www.hss.cmu.edu/philosophy/faculty-glymour.php scheines@cmu.edu http://www.hss.cmu.edu/philosophy/faculty-scheines.php
Clark Glymour
Affiliation:
Department of Philosophy, Carnegie Mellon University, Pittsburgh, PA 15213. ddanks@cmu.edu http://www.hss.cmu.edu/philosophy/faculty-danks.php sfancsal@andrew.cmu.edu cg09@andrew.cmu.edu http://www.hss.cmu.edu/philosophy/faculty-glymour.php scheines@cmu.edu http://www.hss.cmu.edu/philosophy/faculty-scheines.php Institute for Human and Machine Cognition, Pittsburgh, PA 15213.
Richard Scheines
Affiliation:
Department of Philosophy, Carnegie Mellon University, Pittsburgh, PA 15213. ddanks@cmu.edu http://www.hss.cmu.edu/philosophy/faculty-danks.php sfancsal@andrew.cmu.edu cg09@andrew.cmu.edu http://www.hss.cmu.edu/philosophy/faculty-glymour.php scheines@cmu.edu http://www.hss.cmu.edu/philosophy/faculty-scheines.php

Abstract

We agree with Cramer et al.'s goal of the discovery of causal relationships, but we argue that the authors' characterization of latent variable models (as deployed for such purposes) overlooks a wealth of extant possibilities. We provide a preliminary analysis of their data, using existing algorithms for causal inference and for the specification of latent variable models.

Type
Open Peer Commentary
Copyright
Copyright © Cambridge University Press 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1.

Authors are listed in alphabetical order; all contributed equally to this commentary.

References

Lacerda, G., Spirtes, P., Ramsey, J. & Hoyer, P. (2008) Discovering cyclic causal models by independent components analysis. In: Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, ed. McAllester, D. & Nicholson, A., pp. 366–74. AUAI Press.Google Scholar
Meek, C. (1997) Graphical models: Selecting causal and statistical models. Unpublished doctoral dissertation, Carnegie Mellon University.Google Scholar
Pearl, J. & Dechter, R. (1996) Identifying independencies in causal graphs with feedback. In: Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence, ed. Horvitz, E. & Jensen, F., pp. 420–42. Morgan Kaufmann.Google Scholar
Ramsey, J., Zhang, J. & Spirtes, P. (2006) Adjacency-faithfulness and conservative causal inference. In: Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, ed. Dechter, R. & Richardson, T., pp. 401408. AUAI Press.Google Scholar
Richardson, T. S. (1996) A discovery algorithm for directed cyclic graphs. In: Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence, ed. Horvitz, E. & Jensen, F., pp. 454–61. Morgan Kaufmann.Google Scholar
Silva, R., Scheines, R., Glymour, C. & Spirtes, P. (2006) Learning the structure of linear latent variable models. Journal of Machine Learning Research 7:191246.Google Scholar
Spirtes, P. & Glymour, C. (1991) A fast algorithm for discovering sparse causal graphs. Social Science Computer Review 9:6272.CrossRefGoogle Scholar
Spirtes, P., Glymour, C. & Scheines, R. (1993) Causation, prediction, and search. Springer.CrossRefGoogle Scholar
6
Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Comorbid science? 1
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Comorbid science? 1
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Comorbid science? 1
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *