The DOI matches its Crossref record.
A Distributed Locality-Sensitive Hashing-Based Approach for Cloud Service Recommendation From Multi-Source Data
Open accessAbstract
To maximize the economic benefits, a cloud service provider needs to recommend its services to as many users as possible based on the historical user-service quality data. However, when a cloud platform (e.g., Amazon) intends to make a service recommendation decision, considering only its own user-service quality data is insufficient, because a cloud user may invoke services from multiple distributed cloud platforms (e.g., Amazon and IBM). In this situation, it is promising for Amazon to collaborate with other cloud platforms (e.g., IBM) to utilize the integrated data for the service recommendation to improve the recommendation accuracy. However, two challenges are present in the above-mentioned collaboration process, where we attempt to use multi-source data for the service recommendation. First, protecting users' privacy is challenging when IBM releases its own data to Amazon. Second, the recommendation efficiency and scalability are often low when the user-service quality data of Amazon and IBM update frequently. Considering these challenges, a privacy-preserving and scalable service recommendation approach based on distributed locality-sensitive hashing, i.e., SerRecdistri-LSH, is proposed in this paper to handle the service recommendation in a distributed cloud environment. Extensive experiments on the WS-DREAM data set validate the feasibility of our approach in terms of service recommendation accuracy, scalability, and privacy preservation.
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
Cited by
Qi, L., Hu, C., Zhang, X., Khosravi, M. R., Sharma, S., Pang, S., & Wang, T. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.3012157 · Cited by 256
Self-citationGong, W., Qi, L., & Xu, Y. (2018) · Wireless Communications and Mobile Computing · doi:10.1155/2018/3075849 · Cited by 166
Self-citationZhang, S., Li, X., Tan, Z., Peng, T., & Wang, G. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2018.10.053 · Cited by 163
Testing and quality validation for AI software–perspectives, issues, and practices
Tao, C., Gao, J., & Wang, T. (2019) · IEEE Access · doi:10.1109/access.2019.2937107 · Cited by 60
“Various intelligent applications such as business decision, recommendation and selection [35], [36], [45], intelligent commands and actions, analytics and prediction capability [37], [38], [40], [46], as well as question and answer capability are current key AI testing topics.”
Background
Metadata
- Authors
- Qi, L., Zhang, X., Dou, W., & Ni, Q.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2017-11
- Volume
- 35
- Issue
- 11
- Pages
- 2616-2624
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2763314014
- Cited by
- 204
- References
- 0
- FWCI
- 66.73
- 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: A Distributed Locality-Sensitive Hashing-Based Approach for Cloud Service Recommendation From Multi-Source Data. https://app.cochat.ai/papers/10.1109/jsac.2017.2760458
- The paper
- Qi, L., Zhang, X., Dou, W., & Ni, Q. (2017). A Distributed Locality-Sensitive Hashing-Based Approach for Cloud Service Recommendation From Multi-Source Data. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2017.2760458
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.