Quickly Finding the Semantically Optimal Presentation Order for a Set of Text Artifacts

This study considers how to quickly find the order in which to present a set of text artifacts on mobile apps or websites such that those artifacts are maximally semantically separated. Semantic separation is desirable because it ensures that users experience as much novelty as possible from one item to the next, thereby improving user attention and engagement. Since an exhaustive search of all possible sequences of text items becomes increasingly infeasible as the length of the sequence grows, a new algorithm is proposed to quickly find the semantically optimal presentation order for a set of text artifacts. The performance of the proposed algorithm is evaluated using an extensive set of experiments involving three different types of text artifacts, seven different sequence lengths, and more than 600 experimental trials. The results demonstrate that the proposed algorithm can select statistically optimal sequences of text artifacts extremely quickly, regardless of the type of text artifacts being used as input or the length of the sequence. App and website developers who are seeking to hold users’ attention and improve user engagement may therefore find the proposed algorithm very attractive in comparison to an exhaustive search.

Authors

Institutions

Publication Details

Journal
Information
Published
2025-01-16
DOI
https://doi.org/10.3390/info16010059
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quickly Finding the Semantically Optimal Presentation Order for a Set of Text Artifacts

Daniel S. Soper
Information
Topic Modeling
article

Quickly Finding the Semantically Optimal Presentation Order for a Set of Text Artifacts

Daniel S. Soper
article en

Abstract

This study considers how to quickly find the order in which to present a set of text artifacts on mobile apps or websites such that those artifacts are maximally semantically separated. Semantic separation is desirable because it ensures that users experience as much novelty as possible from one item to the next, thereby improving user attention and engagement. Since an exhaustive search of all possible sequences of text items becomes increasingly infeasible as the length of the sequence grows, a new algorithm is proposed to quickly find the semantically optimal presentation order for a set of text artifacts. The performance of the proposed algorithm is evaluated using an extensive set of experiments involving three different types of text artifacts, seven different sequence lengths, and more than 600 experimental trials. The results demonstrate that the proposed algorithm can select statistically optimal sequences of text artifacts extremely quickly, regardless of the type of text artifacts being used as input or the length of the sequence. App and website developers who are seeking to hold users’ attention and improve user engagement may therefore find the proposed algorithm very attractive in comparison to an exhaustive search.

InformationVol. 16(1)
California State University, Fullerton (US), Decision Sciences (United States) (US)
California State University, Fullerton
Openalex Percentile: Top 100%
Topic Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Quickly Finding the Semantically Optimal Presentation Order for a Set of Text Artifacts — Daniel S. Soper · Information (2025) | TGRS Research Map | TGRS