Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE ( © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 21 September 2020

Abstract and Keywords

We argue that the time is ripe to develop multilevel models that provide explanations at both the individual and social levels to extend research in human-computer interaction to the emerging area called socio-computer interaction. We provide three examples of such multilevel models. We first describe the SNIF-ACT model, which was developed to explain individuals’ information foraging behavior as they navigate through web pages to find target information, and to explain the general tendency for people to stay on any particular website. We then describe the social information Foraging theory, which characterizes how search efficiencies may be improved by utilizing social signals generated by other information foragers. Finally, we describe the semantic imitation model, which characterizes how individual users may generate social tags to index their own documents and could lead to aggregate indices that act as semantic structures that help other users to find relevant information. The models demonstrate the significance in capturing the social dynamics involved in systems that afford socio-computer interaction.

Keywords: socio-computer interaction, cognitive models, multilevel models, information foraging, social dynamics

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.