Algorithm Supported Induction for Building Theory: How Can We Use Prediction Models to Theorize?
Open accessThe DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
Across many fields of social science, machine learning (ML) algorithms are rapidly advancing research as tools to support traditional hypothesis testing research (e.g., through data reduction and automation of data coding or for improving matching on observable features of a phenomenon or constructing instrumental variables). In this paper, we argue that researchers are yet to recognize the value of ML techniques for theory building from data. This may be in part because of scholars’ inherent distaste for predictions without explanations that ML algorithms are known to produce. However, precisely because of this property, we argue that ML techniques can be very useful in theory construction during a key step of inductive theorizing—pattern detection. ML can facilitate algorithm supported induction, yielding conclusions about patterns in data that are likely to be robustly replicable by other analysts and in other samples from the same population. These patterns can then be used as inputs to abductive reasoning for building or developing theories that explain them. We propose that algorithm-supported induction is valuable for researchers interested in using quantitative data to both develop and test theories in a transparent and reproducible manner, and we illustrate our arguments using simulations.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
The Discovery of Grounded Theory: Strategies for Qualitative Research
Glaser, B. G., & Strauss, A. L. (2017) · Aldine (Routledge reprint) · doi:10.4324/9780203793206 · Cited by 25,789
Building Theories from Case Study Research
Eisenhardt, K. M. (1989) · The Academy of Management Review · doi:10.2307/258557 · Cited by 17,455
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Building Better Causal Theories: A Fuzzy Set Approach to Typologies in Organization Research
Fiss, P. C. (2011) · Academy of Management Journal · doi:10.5465/amj.2011.60263120 · Cited by 5,930
Blei, D. M. (2012) · Communications of the ACM · doi:10.1145/2133806.2133826 · Cited by 5,516
Lipton, Z. C. (2018) · Queue · doi:10.1145/3236386.3241340 · Cited by 5,427
Some Studies in Machine Learning Using the Game of Checkers
Samuel, A. L. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.33.0210 · Cited by 4,443
Understanding Machine Learning: From Theory to Algorithms
Shalev-Shwartz, S., & Ben-David, S. (2014) · doi:10.1017/cbo9781107298019 · Cited by 3,115
Cited by
Renewing the resource‐based view: New contexts, new concepts, and new methods
Helfat, C. E., Kaul, A., Ketchen, D. J., Barney, J. B., Chatain, O., & Singh, H. (2023) · Strategic Management Journal · doi:10.1002/smj.3500 · Cited by 319
Bailey, D. E., Faraj, S., Hinds, P. J., Leonardi, P. M., & von Krogh, G. (2022) · Organization Science · doi:10.1287/orsc.2021.1562 · Cited by 305
Recognizing and utilizing novel research opportunities with artificial intelligence
von Krogh, G., Roberson, Q., & Gruber, M. (2023) · Academy of Management Journal · doi:10.5465/amj.2023.4002 · Cited by 164
Herath, S., Bashardoust, A., Bole, Y., & Shrestha, Y. R. (2026) · European Journal of Information Systems · doi:10.1080/0960085x.2026.2616042 · Cited by 16
“Prompt engineering (Section 4.1.1) Errors and hallucination; Resistance, deskilling, and job insecurity DP3 Implementing AI solutions in organisations involves many challenges and trade-offs (Herath Pathirannehelage et al., 2025; Shrestha et al., 2021).”
InfluentialSelf-citation
Metadata
- Authors
- Shrestha, Y. R., He, V. F., Puranam, P., & von Krogh, G.
- Venue
- Organization Science
- Published
- 2021-05
- Volume
- 32
- Issue
- 3
- Pages
- 856-880
- ISSN
- 1047-7039 (ISSN-L)
- 1526-5455
- OpenAlex
- W3112808112
- Cited by
- 156
- References
- 25
- FWCI
- 34.36
- Type
- journal article
- Language
- en
- Open access
- green
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.