{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:14Z","timestamp":1740160274076,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T00:00:00Z","timestamp":1451952000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71202033"],"award-info":[{"award-number":["71202033"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Education Funded Project for Humanities and Social Sciences Research","award":["14YJC630124"],"award-info":[{"award-number":["14YJC630124"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s13042-015-0489-4","type":"journal-article","created":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T11:14:57Z","timestamp":1451992497000},"page":"1185-1195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Value of foreknowledge in the online k-taxi problem"],"prefix":"10.1007","volume":"8","author":[{"given":"Xin","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weimin","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,5]]},"reference":[{"key":"489_CR1","doi-asserted-by":"crossref","unstructured":"El-Yaniv R, Fiat A, Karp RM, Turpin G (1992) Competitive analysis of financial games. In: Proceedings of 33rd annual symposium on foundations of computer science, pp 327\u2013333","DOI":"10.1109\/SFCS.1992.267758"},{"key":"489_CR2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s00453-001-0003-0","volume":"30","author":"R El-Yaniv","year":"2001","unstructured":"El-Yaniv R, Fiat A, Karp RM, Turpin G (2001) Optimal search and one-way trading online algorithms. Algorithmica 30:101\u2013139","journal-title":"Algorithmica"},{"issue":"2","key":"489_CR3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/trsc.1060.0147","volume":"40","author":"P Jaillet","year":"2006","unstructured":"Jaillet P, Wagner MR (2006) Online routing problems: value of advanced information as improved competitive ratios. Transp Sci 40(2):200\u2013210","journal-title":"Transp Sci"},{"issue":"3","key":"489_CR4","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1287\/opre.1070.0450","volume":"56","author":"P Jaillet","year":"2008","unstructured":"Jaillet P, Wagner MR (2008) Generalized online routing: new competitive ratios, resource augmentation, and asymptotic analyses. Oper Res 56(3):745\u2013757","journal-title":"Oper Res"},{"issue":"4","key":"489_CR5","first-page":"54","volume":"5","author":"WM Ma","year":"2010","unstructured":"Ma WM, Wang K (2010) Optimal online risk-tolerant ordering policy for the newsvendor with forecast. J Converg Inf Technol 5(4):54\u201365","journal-title":"J Converg Inf Technol"},{"key":"489_CR6","unstructured":"Ma WM, Wang K (2010) Robust solutions to the newsvendor problem under the perspective of competitive analysis. In: Proceedings of the 4th international conference on new trends in information science and service science (NISS 2010), pp 424\u2013429"},{"issue":"8","key":"489_CR7","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1109\/TKDE.2011.67","volume":"24","author":"XZ Wang","year":"2012","unstructured":"Wang XZ, Dong LC, Yan JH (2012) Maximum ambiguity based sample selection in fuzzy decision tree induction. IEEE Trans Knowl Data Eng 24(8):1491\u20131505","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"489_CR8","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.3233\/IFS-151729","volume":"29","author":"XZ Wang","year":"2015","unstructured":"Wang XZ, Aamir R, Fu AM (2015) Fuzziness based sample categorization for classifier performance improvement. J Intell Fuzzy Syst 29:1185\u20131196","journal-title":"J Intell Fuzzy Syst"},{"issue":"5","key":"489_CR9","doi-asserted-by":"crossref","first-page":"1638","DOI":"10.1109\/TFUZZ.2014.2371479","volume":"23","author":"XZ Wang","year":"2015","unstructured":"Wang XZ, Xing HJ, Li Y, Hua Q, Dong CR, Pedrycz W (2015) A study on relationship between generalization abilities and fuzziness of base classifiers in ensemble learning. IEEE Trans Fuzzy Syst 23(5):1638\u20131654","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"489_CR10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator DD, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28:202\u2013208","journal-title":"Commun ACM"},{"key":"489_CR11","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"issue":"1\u20132","key":"489_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0436-0","volume":"97","author":"S Albers","year":"2003","unstructured":"Albers S (2003) Online algorithms: a survey. Math Program 97(1\u20132):3\u201326","journal-title":"Math Program"},{"issue":"4","key":"489_CR13","first-page":"429","volume":"2","author":"YF Xu","year":"1999","unstructured":"Xu YF, Wang KL, Zhu B (1999) On the k-taxi problem. Information 2(4):429\u2013434","journal-title":"Information"},{"key":"489_CR14","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"MS Manasse","year":"1990","unstructured":"Manasse MS, McGeoch LA, Sleator DD (1990) Competitive algorithms for server problems. J Algorithms 11:208\u2013230","journal-title":"J Algorithms"},{"issue":"5","key":"489_CR15","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E Koutsoupias","year":"1995","unstructured":"Koutsoupias E, Papadimitriou C (1995) On the k-server conjecture. J ACM 42(5):971\u2013983","journal-title":"J ACM"},{"issue":"1","key":"489_CR16","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/S0097539792224474","volume":"24","author":"N Alon","year":"1995","unstructured":"Alon N, Karp RM, Peleg D, West D (1995) A graph-theoretic game and its application to the k-server problem. SIAM J Comput 24(1):78\u2013100","journal-title":"SIAM J Comput"},{"key":"489_CR17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.tcs.2004.05.020","volume":"324","author":"M Chrobak","year":"2004","unstructured":"Chrobak M, Sgall J (2004) The weighted 2-server problem. Theor Comput Sci 324:289\u2013312","journal-title":"Theor Comput Sci"},{"issue":"1","key":"489_CR18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10100-011-0222-7","volume":"21","author":"T Rudec","year":"2013","unstructured":"Rudec T, Baumgartner A, Manger R (2013) A fast work function algorithm for solving the k-server problem. CEJOR 21(1):187\u2013205","journal-title":"CEJOR"},{"key":"489_CR19","unstructured":"Xin CL, Ma WM (2004) Scheduling for on-line taxi problem on a real line and competitive algorithms. In: Proceedings of the third international conference on machine learning and cybernetics (ICMLC 2004), pp 3078\u20133084"},{"key":"489_CR20","doi-asserted-by":"crossref","unstructured":"Ma WM, Wang K (2006) On-line taxi problem on the benefit-cost graphs. In: Proceeding of 2006 international conference on machine learning and cybernetics (ICMLC 2006), pp 900\u2013905","DOI":"10.1109\/ICMLC.2006.258494"},{"key":"489_CR21","doi-asserted-by":"crossref","unstructured":"Ma W, Wang K (2007) On the on-line weighted k-taxi problem. In: Proceedings of the first international symposium on combinatorics, algorithms, probabilistic and experimental methodologies (ESCAPE 2007), (lecture notes in computer science, vol 4614), pp 152\u2013162","DOI":"10.1007\/978-3-540-74450-4_14"},{"key":"489_CR22","doi-asserted-by":"crossref","unstructured":"Ma W, Gao T, Wang K (2007) On the on-line k-taxi problem with limited look ahead. In: Proceedings of the first international conference on combinatorial optimization and applications (COCOA 2007), (lecture notes in computer science, vol 4616), pp 72\u201380","DOI":"10.1007\/978-3-540-73556-4_10"},{"issue":"1","key":"489_CR23","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1023\/A:1017982528216","volume":"21","author":"W Ma","year":"2001","unstructured":"Ma W, Xu Y, Wang K (2001) On-line k-truck problem and its competitive algorithms. J Glob Optim 21(1):15\u201325","journal-title":"J Glob Optim"},{"issue":"4","key":"489_CR24","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1007\/s10878-013-9621-0","volume":"29","author":"Y Xu","year":"2015","unstructured":"Xu Y, Li H, He C, Luo L (2015) The online k-server problem with max-distance objective. J Comb Optim 29(4):836\u2013846","journal-title":"J Comb Optim"},{"issue":"3","key":"489_CR25","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/TFUZZ.2008.924342","volume":"17","author":"XZ Wang","year":"2009","unstructured":"Wang XZ, Dong CR (2009) Improving generalization of fuzzy if-then rules by maximizing fuzzy entropy. IEEE Trans Fuzzy Syst 17(3):556\u2013567","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"8","key":"489_CR26","doi-asserted-by":"crossref","first-page":"3425","DOI":"10.1016\/j.amc.2012.08.056","volume":"219","author":"YL He","year":"2012","unstructured":"He YL, Liu JNK, Wang XZ, Hu YX (2012) Optimal bandwidth selection for resubstitution entropy estimation. Appl Math Comput 219(8):3425\u20133460","journal-title":"Appl Math Comput"},{"issue":"5","key":"489_CR27","doi-asserted-by":"crossref","first-page":"2329","DOI":"10.3233\/IFS-141516","volume":"28","author":"XZ Wang","year":"2015","unstructured":"Wang XZ (2015) Learning from big data with uncertainty\u2014editorial. J Intell Fuzzy Syst 28(5):2329\u20132330","journal-title":"J Intell Fuzzy Syst"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-015-0489-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0489-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0489-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0489-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T16:28:36Z","timestamp":1718296116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-015-0489-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,5]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["489"],"URL":"https:\/\/doi.org\/10.1007\/s13042-015-0489-4","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2016,1,5]]}}}