The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Novel centroid selection approaches for KMeans-clustering based recommender systems
Open accessAbstract
Recommender systems have the ability to filter unseen information for predicting whether a particular user would prefer a given item when making a choice. Over the years, this process has been dependent on robust applications of data mining and machine learning techniques, which are known to have scalability issues when being applied for recommender systems. In this paper, we propose a k-means clustering-based recommendation algorithm, which addresses the scalability issues associated with traditional recommender systems. An issue with traditional k-means clustering algorithms is that they choose the initial k centroid randomly, which leads to inaccurate recommendations and increased cost for offline training of clusters. The work in this paper highlights how centroid selection in k-means based recommender systems can improve performance as well as being cost saving. The proposed centroid selection method has the ability to exploit underlying data correlation structures, which has been proven to exhibit superior accuracy and performance in comparison to the traditional centroid selection strategies, which choose centroids randomly. The proposed approach has been validated with an extensive set of experiments based on five different datasets (from movies, books, and music domain). These experiments prove that the proposed approach provides a better quality cluster and converges quicker than existing approaches, which in turn improves accuracy of the recommendation provided.
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
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
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Cited by
The use of machine learning algorithms in recommender systems: a systematic review
Portugal, I., Alencar, P., & Cowan, D. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.12.020 · Cited by 743
“Numeric 27 8 (Braida et al., 2015; Forsati et al., 2009; Forsati & Meybodi, 2010; Karahodza & Donko, 2015; J. Li & Zaı̈ane, 2004; Middleton et al., 2004; Taghipour et al., 2007; Zahra et al., 2015) Diversity Textual 0 0”
BackgroundInfluentialPersonalized Recommendation System Based on Collaborative Filtering for IoT Scenarios
Cui, Z., Xu, X., Xue, F., Cai, X., Cao, Y., Zhang, W., & Chen, J. (2020) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2020.2964552 · Cited by 543
Chen, R., Hua, Q., Chang, Y.-S., Wang, B., Zhang, L., & Kong, X. (2018) · IEEE Access · doi:10.1109/access.2018.2877208 · Cited by 312
Region-of-Interest Based Transfer Learning Assisted Framework for Skin Cancer Detection
Ashraf, R., Afzal, S., Rehman, A. U., Gul, S., Baber, J., Bakhtyar, M., Mehmood, I., Song, O.-Y., & Maqsood, M. (2020) · IEEE Access · doi:10.1109/access.2020.3014701 · Cited by 260
What is Semantic Communication? A View on Conveying Meaning in the Era of Machine Intelligence
Lan, Q., Wen, D., Zhang, Z., Zeng, Q., Chen, X., Popovski, P., & Huang, K. (2021) · Journal of Communications and Information Networks · doi:10.23919/jcin.2021.9663101 · Cited by 255
Metadata
- Authors
- Zahra, S., Ghazanfar, M. A., Khalid, A., Azam, M. A., Naeem, U., & Prugel-Bennett, A.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2015-11
- Volume
- 320
- Pages
- 156-189
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2154137957
- Cited by
- 224
- References
- 2
- FWCI
- 45.95
- Type
- journal article
- Language
- en
- Open access
- green
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: Novel centroid selection approaches for KMeans-clustering based recommender systems. https://app.cochat.ai/papers/10.1016/j.ins.2015.03.062
- The paper
- Zahra, S., Ghazanfar, M. A., Khalid, A., Azam, M. A., Naeem, U., & Prugel-Bennett, A. (2015). Novel centroid selection approaches for KMeans-clustering based recommender systems. Information Sciences. https://doi.org/10.1016/j.ins.2015.03.062
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.