The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Generating Highly Accurate Predictions for Missing QoS Data via Aggregating Nonnegative Latent Factor Models
Abstract
Automatic Web-service selection is an important research topic in the domain of service computing. During this process, reliable predictions for quality of service (QoS) based on historical service invocations are vital to users. This work aims at making highly accurate predictions for missing QoS data via building an ensemble of nonnegative latent factor (NLF) models. Its motivations are: 1) the fulfillment of nonnegativity constraints can better represent the positive value nature of QoS data, thereby boosting the prediction accuracy and 2) since QoS prediction is a learning task, it is promising to further improve the prediction accuracy with a carefully designed ensemble model. To achieve this, we first implement an NLF model for QoS prediction. This model is then diversified through feature sampling and randomness injection to form a diversified NLF model, based on which an ensemble is built. Comparison results between the proposed ensemble and several widely employed and state-of-the-art QoS predictors on two large, real data sets demonstrate that the former can outperform the latter well in terms of prediction accuracy.
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
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
Adomavicius, G., & Tuzhilin, A. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.99 · Cited by 10,310
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,877
Ensemble methods in machine learning
Dietterich, T. G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45014-9_1 · Cited by 8,408
Paatero, P., & Tapper, U. (1994) · Environmetrics · doi:10.1002/env.3170050203 · Cited by 6,023
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 16×
“1, the RMSE of DNLFE is at 54.4088 with n = 20, ∼7.25% lower than that at 58.6615 by NLF, and 6.77% lower than that at 57.9289 by DNLF. Similar results can be seen on the other cases.”
MethodInfluentialALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
A Survey of Collaborative Filtering Techniques
Su, X., & Khoshgoftaar, T. M. (2009) · Advances in Artificial Intelligence · doi:10.1155/2009/421425 · Cited by 3,602
QoS-aware middleware for Web services composition
Zeng, L., Benatallah, B., Ngu, A. H. H., Dumas, M., Kalagnanam, J., & Chang, H. (2004) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2004.11 · Cited by 2,757
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
Projected Gradient Methods for Nonnegative Matrix Factorization
Lin, C.-J. (2007) · Neural Computation · doi:10.1162/neco.2007.19.10.2756 · Cited by 1,737
Eigentaste: A Constant Time Collaborative Filtering Algorithm
Goldberg, K., Roeder, T., Gupta, D., & Perkins, C. (2001) · Information Retrieval · doi:10.1023/a:1011419012209 · Cited by 1,438
Evaluating Recommendation Systems
Shani, G., & Gunawardana, A. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_8 · Cited by 1,325
Convex and Semi-Nonnegative Matrix Factorizations
Ding, C. H. Q., Li, T., & Jordan, M. I. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.277 · Cited by 1,317
QoS computation and policing in dynamic web service selection
Liu, Y., Ngu, A. H. H., & Zeng, L. Z. (2004) · doi:10.1145/1013367.1013379 · Cited by 895
An Efficient Boosting Algorithm for Combining Preferences
Freund, Y., Iyer, R. D., Schapire, R. E., & Singer, Y. (1998) · Cited by 806
QoS-Aware Web Service Recommendation by Collaborative Filtering
Zheng, Z., Ma, H., Lyu, M. R., & King, I. (2011) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2010.52 · Cited by 805
Advances in Collaborative Filtering
Koren, Y., & Bell, R. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_5 · Cited by 745
Large-Scale Parallel Collaborative Filtering for the Netflix Prize
Zhou, Y., Wilkinson, D., Schreiber, R., & Pan, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68880-8_32 · Cited by 700
Luo, X., Zhou, M., Xia, Y., & Zhu, Q. (2014) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2014.2308433 · Cited by 629
Self-citationScalable Collaborative Filtering Approaches for Large Recommender Systems
Takács, G., Pilászy, I., Németh, B., & Tikk, D. (2009) · Journal of Machine Learning Research · doi:10.5555/1577069.1577091 · Cited by 590
Personalized QoS Prediction forWeb Services via Collaborative Filtering
Shao, L., Zhang, J., Wei, Y., Zhao, J., Xie, B., & Mei, H. (2007) · IEEE International Conference on Web Services (ICWS 2007) · doi:10.1109/icws.2007.140 · Cited by 463
WSRec: A Collaborative Filtering Based Web Service Recommender System
Zheng, Z., Ma, H., Lyu, M. R., & King, I. (2009) · 2009 IEEE International Conference on Web Services · doi:10.1109/icws.2009.30 · Cited by 448
Collaborative Web Service QoS Prediction via Neighborhood Integrated Matrix Factorization
Zheng, Z., Ma, H., Lyu, M. R., & King, I. (2013) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2011.59 · Cited by 443
Learning from Incomplete Ratings Using Non-negative Matrix Factorization
Zhang, S., Wang, W., Ford, J., & Makedon, F. (2006) · Proceedings of the 2006 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972764.58 · Cited by 374
Distributed QoS Evaluation for Real-World Web Services
Zheng, Z., Zhang, Y., & Lyu, M. R. (2010) · 2010 IEEE International Conference on Web Services · doi:10.1109/icws.2010.10 · Cited by 366
AdaBoost.RT: a boosting algorithm for regression problems
Solomatine, D. P., & Shrestha, D. L. (2005) · 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541) · doi:10.1109/ijcnn.2004.1380102 · Cited by 306
Online Nonnegative Matrix Factorization With Robust Stochastic Approximation
Guan, N., Tao, D., Luo, Z., & Yuan, B. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2197827 · Cited by 287
Predicting Quality of Service for Selection by Neighborhood-Based Collaborative Filtering
Wu, J., Chen, L., Feng, Y., Zheng, Z., Zhou, M. C., & Wu, Z. (2013) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmca.2012.2210409 · Cited by 201
Self-citationIncremental Collaborative Filtering recommender based on Regularized Matrix Factorization
Luo, X., Xia, Y., & Zhu, Q. (2012) · Knowledge-Based Systems · doi:10.1016/j.knosys.2011.09.006 · Cited by 199
Self-citationMethods for large scale SVD with missing values
Kurucz, M., Benczúr, A. A., & Csalogány, K. (2007) · SZTAKI Publication Repository (Hungarian Academy of Sciences) · Cited by 150
Exploring Latent Features for Memory-Based QoS Prediction in Cloud Computing
Zhang, Y., Zheng, Z., & Lyu, M. R.-T. (2011) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds.2011.10 · Cited by 149
Maclin, R., & SHAVLIK, J. W. (1995) · International Joint Conference on Artificial Intelligence · Cited by 136
Gaussian Classifier-Based Evolutionary Strategy for Multimodal Optimization
Dong, W., & Zhou, M. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2298402 · Cited by 106
Self-citationProbabilistic Matrix Factorization with Non-random Missing Data
Hernández-Lobato, J. M., Houlsby, N., & Zoubin Ghahramani, A. (2014) · Cited by 101
Hybrid Collaborative Filtering algorithm for bidirectional Web service recommendation
Cao, J., Wu, Z., Wang, Y., & Zhuang, Y. (2012) · Knowledge and Information Systems · doi:10.1007/s10115-012-0562-1 · Cited by 94
A parallel matrix factorization based recommender by alternating stochastic gradient decent
Luo, X., Liu, H., Gou, G., Xia, Y., & Zhu, Q. (2011) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2011.10.011 · Cited by 82
Self-citationImproving Simple Collaborative Filtering Models Using Ensemble Methods
Bar, A., Rokach, L., Shani, G., Shapira, B., & Schclar, A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38067-9_1 · Cited by 63
Personalized QoS Prediction for Web Services Using Latent Factor Models
Yu, D., Liu, Y., Xu, Y., & Yin, Y. (2014) · IEEE International Conference on Services Computing · doi:10.1109/scc.2014.23 · Cited by 62
Predicting Stay Time of Mobile Users With Contextual Information
Liu, S., Cao, H., Li, L., & Zhou, M. (2013) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2013.2259480 · Cited by 25
Self-citationPredictive Approach for User Long-Term Needs in Content-Based Image Suggestion
Boutemedjet, S., & Ziou, D. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2199765 · Cited by 17
Cited by
Gao, S., Zhou, M., Wang, Y., Cheng, J., Yachi, H., & Wang, J. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2846646 · Cited by 698
Self-citationAli, L., Alnajjar, F., Jassmi, H. A., Gocho, M., Khan, W., & Serhani, M. A. (2021) · Sensors · doi:10.3390/s21051688 · Cited by 343
Position-Transitional Particle Swarm Optimization-Incorporated Latent Factor Analysis
Luo, X., Yuan, Y., Chen, S., Zeng, N., & Wang, Z. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3033324 · Cited by 264
Self-citation
Metadata
- Authors
- Luo, X., Zhou, M., Xia, Y., Zhu, Q., Ammari, A. C., & Alabdulwahab, A.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2016-03
- Volume
- 27
- Issue
- 3
- Pages
- 524-537
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2056398894
- Cited by
- 260
- References
- 43
- FWCI
- 57.66
- 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
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.