The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Unsupervised Clickstream Clustering for User Behavior Analysis
Open accessAbstract
Online services are increasingly dependent on user participation. Whether it's online social networks or crowdsourcing services, understanding user behavior is important yet challenging. In this paper, we build an unsupervised system to capture dominating user behaviors from clickstream data (traces of users' click events), and visualize the detected behaviors in an intuitive manner. Our system identifies "clusters" of similar users by partitioning a similarity graph (nodes are users; edges are weighted by clickstream similarity). The partitioning process leverages iterative feature pruning to capture the natural hierarchy within user clusters and produce intuitive features for visualizing and understanding captured user behaviors. For evaluation, we present case studies on two large-scale clickstream traces (142 million events) from real social networks. Our system effectively identifies previously unknown behaviors, e.g., dormant users, hostile chatters. Also, our user study shows people can easily interpret identified behaviors using our visualization tool.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Fast unfolding of communities in large networks
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2008/10/p10008 · Cited by 21,424
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
A Comparative Study on Feature Selection in Text Categorization
Yang, Y., & Pedersen, J. (1997) · Cited by 4,790
Web usage mining: discovery and applications of usage patterns from Web data
Srivastava, J., Cooley, R., Deshpande, M., & Tan, P.-N. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/846183.846188 · Cited by 2,105
Tree-Maps: A Space Filling Approach to the Visualization of Hierarchical Information Structures
Johnson, B., & Shneiderman, B. (1991) · Cited by 1,121
Characterizing user behavior in online social networks
Benevenuto, F., Rodrigues, T., Cha, M., & Almeida, V. (2009) · Proceedings of the 9th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1644893.1644900 · Cited by 795
Determining the number of clusters/segments in hierarchical clustering/segmentation algorithms
Salvador, S., & Chan, P. (2005) · 16th IEEE International Conference on Tools with Artificial Intelligence · doi:10.1109/ictai.2004.50 · Cited by 683
YANG, Z., CAI, S., ZHOU, Z., & ZHOU, N. (2005) · Information & Management · doi:10.1016/s0378-7206(04)00073-4 · Cited by 440
Stasko, J., & Zhang, E. (2002) · IEEE Symposium on Information Visualization 2000. INFOVIS 2000. Proceedings · doi:10.1109/infvis.2000.885091 · Cited by 404
Cited by
(2017) · doi:10.1145/3038912.3052695 · Cited by 78
Positivity Bias in Customer Satisfaction Ratings
Park, K., Cha, M., & Rhim, E. (2018) · Companion of the The Web Conference 2018 on The Web Conference 2018 - WWW '18 · doi:10.1145/3184558.3186579 · Cited by 19
Using the PARAFAC2 tensor factorization on EHR audit data to understand PCP desktop work
Perros, I., Yan, X., Jones, J. B., Sun, J., & Stewart, W. F. (2020) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2019.103312 · Cited by 8
Chen, Y., Xiao, Y., Zinat, K. T., Yamashita, N., Gao, G., & Liu, Z. (2025) · Proceedings of the 2025 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3706598.3713693 · Cited by 2
Metadata
- Authors
- Wang, G., Zhang, X., Tang, S., Zheng, H., & Zhao, B. Y.
- Venue
- Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems
- Publisher
- ACM
- Published
- 2016-05-07
- Pages
- 225-236
- OpenAlex
- W2408574227
- Cited by
- 269
- References
- 29
- FWCI
- 30.48
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Unsupervised Clickstream Clustering for User Behavior Analysis. https://app.cochat.ai/papers/10.1145/2858036.2858107
- The paper
- Wang, G., Zhang, X., Tang, S., Zheng, H., & Zhao, B. Y. (2016). Unsupervised Clickstream Clustering for User Behavior Analysis. Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems. https://doi.org/10.1145/2858036.2858107
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.