Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/24812
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZhang, Z-
dc.contributor.authorLee, H-
dc.contributor.authorYoo, Y-
dc.contributor.authorChoi, YT-
dc.date.accessioned2022-07-06T15:14:27Z-
dc.date.available2022-07-06T15:14:27Z-
dc.date.issued2022-03-01-
dc.identifier.citationZhang, Z., Lee, H., Yoo, Y., Choi, Y.T. (2022) 'Theorizing Routines with Computational Sequence Analysis: A criticism Realism Framework', Journal of the Association for Information Systems, 23( 2), pp. 589 - 630. doi:10.17705/1jais.00734.en_US
dc.identifier.issn1536-9323-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/24812-
dc.description.abstractWe develop a methodological framework to develop process theories on routines by leveraging large volumes of digital trace data following critical realism principles. Our framework begins with collecting and preprocessing digital trace data, corresponding to the empirically observed experience of critical realism. In the second and third steps of the framework, we identify a finite set of similar repetitive patterns (routines) through computational analysis. We accomplish this by combining frequent subsequence mining and clustering analysis to transform empirical observation into a set of routines that correspond to actual happening in critical realism. Then, we employ a retroduction approach to identify generative mechanisms of the routines. In the final step, we validate the generative mechanisms by evaluating proposed processual explanations and/or eliminating alternatives. We provide an illustrative example of developing a process theory in relation to the collaboration pattern in Wikipedia.en_US
dc.format.extent589 - 630-
dc.format.mediumPrint - Electronic-
dc.language.isoen_USen_US
dc.publisherAssociation for Information Systems-
dc.rightsCopyright © 2022 by the Association for Information Systems. This is an author-produced version of a paper accepted for publication in Journal of the Association for Information Systems. Uploaded in accordance with the publisher's self-archiving policy at: https://aisnet.org/page/PoliciesGuidelines . Journal of the Association for Information Systems (JAIS) Communications of the Association for Information Systems (CAIS) Pacific Asia Journal of the Association for Information Systems (PAJAIS) Transactions on Human-Computer Interaction (THCI) Transactions on Replication Research (TRR) MIS Quarterly Executive (MISQE) AIS’s self-archiving option pertains to the version of the article that received the official acceptance letter from the editor after successfully passing peer review (i.e., post-print or Author’s Accepted Manuscript) or the final, official published version after the publisher has copy-edited, formatted and distributed it (i.e., version of record). Authors may self-archive the version of their research article that they choose on their website, or on a publicly-accessible institutional or subject-based repository-
dc.rights.urihttps://aisnet.org/page/PoliciesGuidelines-
dc.subjectProcess studiesen_US
dc.subjectroutinesen_US
dc.subjectsequence analyticsen_US
dc.subjectcritical realismen_US
dc.titleTheorizing Routines with Computational Sequence Analysis: A Critical Realism Frameworken_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.17705/1jais.00734-
dc.relation.isPartOfJournal of the Association for Information Systems-
pubs.issue2-
pubs.publication-statusPublished-
pubs.volume23-
dc.identifier.eissn1558-3457-
dc.rights.holderAssociation for Information Systems [Society Publisher]-
Appears in Collections:Brunel Business School Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2022 by the Association for Information Systems. This is an author-produced version of a paper accepted for publication in Journal of the Association for Information Systems. Uploaded in accordance with the publisher's self-archiving policy at: https://aisnet.org/page/PoliciesGuidelines .1.17 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.