Non-IIDness Learning in Behavioral and Social Data
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Most of the classic theoretical systems and tools in statistics, data mining and machine learning are built on the fundamental assumption of IIDness, which assumes the independence and identical distribution of underlying objects, attributes and/or values. However, complex behavioral and social problems often exhibit strong couplings and heterogeneity between values, attributes and objects (i.e., non-IIDness). This fundamentally challenges the IIDness-based learning methodologies and techniques. This paper presents a high-level overview of the needs, challenges and opportunities of non-IIDness learning for handling complex behavioral and social problems. By reviewing the nature and issues of classic IIDness-based algorithms in frequent pattern mining, clustering and classification to complex behavioral and social applications, concepts, structures, frameworks and exemplar techniques are discussed for non-IIDness learning. Case studies, relatedwork and prospects of non-IIDness learning are presented. Non-IIDness learning is also a fundamental issue in big data analytics. © The British Computer Society 2013.
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 1×
“We evaluate CK-modes against several widely discussed algorithms in the recommender systems, including user-based collaborative filtering algorithm [45], item-based collaborative filtering algorithm [46] and CLUSTKNN [47] on the MovieLens data.”
MethodGroupLens: an open architecture for collaborative filtering of netnews
Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., & Riedl, J. (1994) · Proceedings of the 1994 ACM conference on Computer supported cooperative work - CSCW '94 · doi:10.1145/192844.192905 · Cited by 5,058
Cited by
Data Science: A Comprehensive Overview
Cao, L. (2018) · ACM Computing Surveys · doi:10.1145/3076253 · Cited by 407
“The limitation of explicit analytics has recently been more widely recognized in the analytics community, such as in handling latent, uncertain and non-IID data [Cao 2014; 2015a].”
BackgroundSelf-citationAI in Finance: Challenges, Techniques, and Opportunities
Cao, L. (2023) · ACM Computing Surveys · doi:10.1145/3502289 · Cited by 366
Self-citationA New Age of AI: Features and Futures
Cao, L. (2022) · IEEE Intelligent Systems · doi:10.1109/mis.2022.3150944 · Cited by 76
Self-citationPang, G., Cao, L., Chen, L., & Liu, H. (2016) · 2016 IEEE 16th International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2016.0052 · Cited by 43
Self-citation
Metadata
- Authors
- Cao, L.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 2013-08-22
- Volume
- 57
- Issue
- 9
- Pages
- 1358-1370
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2113207826
- Cited by
- 97
- References
- 2
- FWCI
- 22.42
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Non-IIDness Learning in Behavioral and Social Data. https://app.cochat.ai/papers/10.1093/comjnl/bxt084
- The paper
- Cao, L. (2014). Non-IIDness Learning in Behavioral and Social Data. The Computer Journal. https://doi.org/10.1093/comjnl/bxt084
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.