The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Discovery is never by chance: designing for (un)serendipity
Abstract
Serendipity has a long tradition in the history of science as having played a key role in many significant discoveries. Computer scientists, valuing the role of serendipity in discovery, have attempted to design systems that encourage serendipity. However, that research has focused primarily on only one aspect of serendipity: that of chance encounters. In reality, for serendipity to be valuable chance encounters must be synthesized into insight. In this paper we show, through a formal consideration of serendipity and analysis of how various systems have seized on attributes of interpreting serendipity, that there is a richer space for design to support serendipitous creativity, innovation and discovery than has been tapped to date. We discuss how ideas might be encoded to be shared or discovered by 'association-hunting' agents. We propose considering not only the inventor's role in perceiving serendipity, but also how that inventor's perception may be enhanced to increase the opportunity for serendipity. We explore the role of environment and how we can better enable serendipitous discoveries to find a home more readily and immediately.
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
Item-based collaborative filtering recommendation algorithms
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372071 · Cited by 9,135 · cited 2×
“As previously mentioned in the ‗Chance‘ section, researchers in this space have already considered some of this work (e.g., serendipity measures [17], less popular items [ 30 ], and diversification of recommendation lists [45]).”
BackgroundEvaluating collaborative filtering recommender systems
Herlocker, J. L., Konstan, J. A., Terveen, L. G., & Riedl, J. T. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963772 · Cited by 5,798 · cited 2×
“, serendipity measures [17], less popular items [30], and diversification of recommendation lists [45]).”
Background
Cited by
Digital innovation:Areview and synthesis
Kohli, R., & Melville, N. P. (2019) · Information Systems Journal · doi:10.1111/isj.12193 · Cited by 790
A Multi-Level Typology of Abstract Visualization Tasks
Brehmer, M., & Munzner, T. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2013.124 · Cited by 747
Kaminskas, M., & Bridge, D. (2017) · ACM Transactions on Interactive Intelligent Systems · doi:10.1145/2926720 · Cited by 465
A survey of serendipity in recommender systems
Kotkov, D., Wang, S., & Veijalainen, J. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.08.014 · Cited by 329
Peng, Z., Guo, Q., Tsang, K. W., & Ma, X. (2020) · Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3313831.3376695 · Cited by 81
“3) In promoting the feature 2, 3, or 4, MepsBot randomly suggests twelve related words from the LIWC 2015 dictionary to induce serendipity for writing inspiration [5] 2.”
Background
Metadata
- Authors
- André, P., schraefel, M. C., Teevan, J., & Dumais, S. T.
- Venue
- Proceedings of the seventh ACM conference on Creativity and cognition
- Publisher
- ACM
- Published
- 2009-10-26
- Pages
- 305-314
- OpenAlex
- W2111591037
- Cited by
- 158
- References
- 2
- FWCI
- 25.90
- 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.