{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T11:05:59Z","timestamp":1778756759525,"version":"3.51.4"},"reference-count":46,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Fusion"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1566-2535(00)00004-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:25:26Z","timestamp":1049721926000},"page":"35-44","source":"Crossref","is-referenced-by-count":20,"title":["Finite sample performance guarantees of fusers for function estimators"],"prefix":"10.1016","volume":"1","author":[{"given":"Nageswara S.V.","family":"Rao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1566-2535(00)00004-X_BIB1","series-title":"Data Fusion in Robotics and Machine Intelligence","year":"1992"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1090\/trans2\/087\/16","article-title":"Extrapolative problems in automatic control and method of potential functions","volume":"87","author":"Aizerman","year":"1970","journal-title":"American Mathematical Society Translations"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB3","doi-asserted-by":"crossref","unstructured":"N. Alon, S. Ben-David, N. Cesa-Bianchi, D. Hausler, Scale-sensitive dimensions, uniform convergence, and learnability, in: Proceedings of the 1993 IEEE Symposium on Foundations of Computer Science, 1993","DOI":"10.1109\/SFCS.1993.366858"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB4","unstructured":"P.L. Bartlett, The sample complexity of pattern classification with neural networks: the sample size of the weights is more important than the size of the network, Technical report, Department of Systems Engineering, Australian National University, 1996"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB5","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1057\/jors.1969.103","article-title":"The combination of forecasts","volume":"20","author":"Bates","year":"1969","journal-title":"Operations Research Quarterly"},{"issue":"1","key":"10.1016\/S1566-2535(00)00004-X_BIB6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF00117832","article-title":"Stacked regressions","volume":"24","author":"Brieman","year":"1996","journal-title":"Machine Learning"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB7","doi-asserted-by":"crossref","unstructured":"N. Cesa-Bianchi, Y. Fruend, D.P. Helmbold, D. Haussler, R.E. Schipire, M.K. Warmuth, How to use expert advice, in: Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing (1993) 382\u2013391","DOI":"10.1145\/167088.167198"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF00115301","article-title":"On-line prediction and conversion strategies","volume":"25","author":"Cesa-Bianchi","year":"1996","journal-title":"Machine Learning"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB9","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/PGEC.1965.264137","article-title":"Geometric and statistical properties of systems of linear inequalities with application in pattern recognition","volume":"EC-14","author":"Cover","year":"1965","journal-title":"IEEE Trans. on Electronic Comput."},{"key":"10.1016\/S1566-2535(00)00004-X_BIB10","series-title":"Decision Fusion","author":"Dasarathy","year":"1994"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB11","unstructured":"P.S. deLaplace, Deuxi\u00e8me suppl\u00e9ment \u00e0 la th\u00e9orie analytique des probabilit\u00e9s, 1818, Reprinted (1847) in Oeuvres Compl\u00e8tes de Laplace, vol. 7, Paris, Gauthier-Villars, pp. 531\u2013580"},{"issue":"4","key":"10.1016\/S1566-2535(00)00004-X_BIB12","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/opre.41.4.704","article-title":"A randomization rule for selecting forecasts","volume":"41","author":"Foster","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB13","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1006\/inco.1995.1136","article-title":"Boosting a weak learning algorithm by majority","volume":"121","author":"Freund","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB14","doi-asserted-by":"crossref","unstructured":"Y. Freund, R.E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, in: Proceedings of Second European Conference on Computational Learning Theory, 1995, pp. 23\u201337","DOI":"10.1007\/3-540-59119-2_166"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00993408","article-title":"Bounding the Vapnik\u2013Chervonenkis dimension of concept classes parametrized by real numbers","volume":"18","author":"Goldberg","year":"1995","journal-title":"Machine Learning"},{"issue":"4","key":"10.1016\/S1566-2535(00)00004-X_BIB16","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/S0893-6080(96)00098-6","article-title":"Optimal linear combinations of neural networks","volume":"10","author":"Hashem","year":"1997","journal-title":"Neural Networks"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB17","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0890-5401(92)90010-D","article-title":"Decision theoretic generalizations of the PAC model for neural net and other learning applications","volume":"100","author":"Haussler","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB18","doi-asserted-by":"crossref","unstructured":"D. Haussler, J. Kivinen, M.K. Warmuth, Tight worst-case loss bounds for predicting with expert advice, in: Proceedings of Second European Conference on Computational Learning Theory, 1995, pp. 69\u201383","DOI":"10.1007\/3-540-59119-2_169"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB19","unstructured":"A. Juditsky, A. Nemirovski, Functional aggregation for nonparametric estimation, Publication Interne, IRISA, 993, 1996"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB20","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1006\/jcss.1997.1477","article-title":"Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks","volume":"54","author":"Karpinski","year":"1997","journal-title":"J. Comput. and Syst. Sci."},{"key":"10.1016\/S1566-2535(00)00004-X_BIB21","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF00993412","article-title":"Learning from a population of hypotheses","volume":"18","author":"Kearns","year":"1995","journal-title":"Machine Learning"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB22","unstructured":"J. Kivinen, M.K. Warmuth, Using experts for predicting continous outcomes, in: Computational Learning Theory: EuroCOLT'93, 1993, pp. 109\u2013120"},{"issue":"2","key":"10.1016\/S1566-2535(00)00004-X_BIB23","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1109\/72.485681","article-title":"Nonparametric estimation and classification using radial basis function nets and empirical risk minimization","volume":"7","author":"Krzyzak","year":"1996","journal-title":"IEEE Trans. on Neural Networks"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB24","unstructured":"W.S. Lee, Agnostic learning and single hidden layer neural networks, Ph.D. thesis, Australian National University, 1996"},{"issue":"2","key":"10.1016\/S1566-2535(00)00004-X_BIB25","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/inco.1994.1009","article-title":"The weighted majority algorithm","volume":"108","author":"Littlestone","year":"1994","journal-title":"Information and Computation"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB26","series-title":"System Identification","author":"Ljung","year":"1987"},{"issue":"3","key":"10.1016\/S1566-2535(00)00004-X_BIB27","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/18.382014","article-title":"Nonparametric estimation via empirical risk minimization","volume":"41","author":"Lugosi","year":"1995","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"2","key":"10.1016\/S1566-2535(00)00004-X_BIB28","first-page":"199","article-title":"Guest editorial on information\/decision fusion with engineering applications","volume":"336B","author":"Madan","year":"1999","journal-title":"J. Franklin Inst."},{"issue":"2","key":"10.1016\/S1566-2535(00)00004-X_BIB29","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1214\/aos\/1176350374","article-title":"U-Processes: Rates of convergence","volume":"15","author":"Nolan","year":"1987","journal-title":"Ann. Stat."},{"key":"10.1016\/S1566-2535(00)00004-X_BIB30","series-title":"Convergence of Stochastic Processes","author":"Pollard","year":"1984"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB31","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1214\/ss\/1177012394","article-title":"Asyptotics via empirical processes (with discussion)","volume":"4","author":"Pollard","year":"1989","journal-title":"Statistical Science"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB32","series-title":"Nonparametric Functional Estimation","author":"Prakasa Rao","year":"1983"},{"issue":"5","key":"10.1016\/S1566-2535(00)00004-X_BIB33","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/0016-0032(94)90035-3","article-title":"Fusion methods for multiple sensor systems with unknown error densities","volume":"331B","author":"Rao","year":"1994","journal-title":"J. Franklin Inst."},{"issue":"1","key":"10.1016\/S1566-2535(00)00004-X_BIB34","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1080\/10798587.1999.10750748","article-title":"Fusion methods in multiple sensor systems using feedforward neural networks","volume":"5","author":"Rao","year":"1998","journal-title":"Intell. Automat. Soft Comput."},{"key":"10.1016\/S1566-2535(00)00004-X_BIB35","doi-asserted-by":"crossref","DOI":"10.1016\/S0925-2312(99)00113-7","article-title":"Simple sample bound for feedforward sigmoid networks with bounded weights","volume":"29","author":"Rao","year":"1999","journal-title":"Neurocomputing"},{"issue":"2","key":"10.1016\/S1566-2535(00)00004-X_BIB36","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/21.281430","article-title":"N-learners problem: Fusion of concepts","volume":"24","author":"Rao","year":"1994","journal-title":"IEEE Trans. on Syst. Man and Cybernet."},{"key":"10.1016\/S1566-2535(00)00004-X_BIB37","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1009640613940","article-title":"Function estimation by feedforward sigmoidal networks with bounded weights","volume":"7","author":"Rao","year":"1998","journal-title":"Neural Process. Lett."},{"key":"10.1016\/S1566-2535(00)00004-X_BIB38","series-title":"Theoretical Advances in Neural Computation and Learning","year":"1994"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB39","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF00116037","article-title":"The strength of weak learnability","volume":"5","author":"Schapire","year":"1990","journal-title":"Machine Learning"},{"issue":"11","key":"10.1016\/S1566-2535(00)00004-X_BIB40","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Commun. ACM"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB41","series-title":"Estimation of Dependences Based on Empirical Data","author":"Vapnik","year":"1982"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB42","series-title":"The Nature of Statistical Learning Theory","author":"Vapnik","year":"1995"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB43","series-title":"A Theory of Learning and Generalization","author":"Vidyasagar","year":"1997"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB44","series-title":"Automata Studies","first-page":"43","article-title":"Probabilistic logics and the synthesis of reliable organisms from unreliable components","author":"von Neumann","year":"1956"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB45","doi-asserted-by":"crossref","unstructured":"V.G. Vovk, Aggregating strategies, in: Proceedings of Workshop on Computational Learning Theory, 1990, pp. 371\u2013383","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"10.1016\/S1566-2535(00)00004-X_BIB46","unstructured":"Y. Yang, Aggregating regression procedures for a better performance, Technical Report 17, Department of Statistics, Iowa State University, 1999"}],"container-title":["Information Fusion"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S156625350000004X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S156625350000004X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T13:55:30Z","timestamp":1556459730000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S156625350000004X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S156625350000004X"],"URL":"https:\/\/doi.org\/10.1016\/s1566-2535(00)00004-x","relation":{},"ISSN":["1566-2535"],"issn-type":[{"value":"1566-2535","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}