Application of an improved Apriori algorithm in a mobile e-commerce recommendation system
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Purpose: The purpose of this paper is to make the mobile e-commerce shopping more convenient and avoid information overload by a mobile e-commerce recommendation system using an improved Apriori algorithm. Design/methodology/approach: Combined with the characteristics of the mobile e-commerce, an improved Apriori algorithm was proposed and applied to the recommendation system. This paper makes products that are recommended to consumers valuable by improving the data mining efficiency. Finally, a Taobao online dress shop is used as an example to prove the effectiveness of an improved Apriori algorithm in the mobile e-commerce recommendation system. Findings: The results of the experimental study clearly show that the mobile e-commerce recommendation system based on an improved Apriori algorithm increases the efficiency of data mining to achieve the unity of real time and recommendation accuracy. Originality/value: The improved Apriori algorithm is applied in the mobile e-commerce recommendation system solving the limitation of the visual interface in a mobile terminal and the mass data that are continuously generated. The proposed recommendation system provides greater prediction accuracy than conventional systems in data mining.
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
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Evaluating 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 by
Mariani, M. M., Perez‐Vega, R., & Wirtz, J. (2022) · Psychology & Marketing · doi:10.1002/mar.21619 · Cited by 631
Machine learning algorithms for social media analysis: A survey
T.K., B., Annavarapu, C. S. R., & Bablani, A. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100395 · Cited by 276
He, X., & Liu, Y. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.121801 · Cited by 53
An Interactive Personalized Recommendation System Using the Hybrid Algorithm Model
Guo, Y., Wang, M., & Li, X. (2017) · Symmetry · doi:10.3390/sym9100216 · Cited by 36
“However, it has a large amount of data in the process of mining frequent item sets, which increases the time and complexity of recommendation systems [31].”
BackgroundSelf-citation
Metadata
- Authors
- Guo, Y., Wang, M., & Li, X.
- Venue
- Industrial Management & Data Systems
- Publisher
- Emerald
- Published
- 2017-03-13
- Volume
- 117
- Issue
- 2
- Pages
- 287-303
- ISSN
- 0263-5577 (ISSN-L)
- OpenAlex
- W2584339594
- Cited by
- 133
- References
- 2
- FWCI
- 27.51
- 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: Application of an improved Apriori algorithm in a mobile e-commerce recommendation system. https://app.cochat.ai/papers/10.1108/imds-03-2016-0094
- The paper
- Guo, Y., Wang, M., & Li, X. (2017). Application of an improved Apriori algorithm in a mobile e-commerce recommendation system. Industrial Management & Data Systems. https://doi.org/10.1108/imds-03-2016-0094
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.