iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1145/2939672.2939726
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T20:03:29Z","timestamp":1730318609300,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T00:00:00Z","timestamp":1471046400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Research Foundation Singapore","award":["Interactive Digital Media (IDM) Strategic Research Programme"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,13]]},"DOI":"10.1145\/2939672.2939726","type":"proceedings-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T18:33:46Z","timestamp":1470681226000},"page":"421-430","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["MAP"],"prefix":"10.1145","author":[{"given":"Bo","family":"An","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Haipeng","family":"Chen","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Noseong","family":"Park","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"V.S.","family":"Subrahmanian","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Bureau of Economic Analysis. http:\/\/www.bea.gov\/regional\/downloadzip.cfm. Bureau of Economic Analysis. http:\/\/www.bea.gov\/regional\/downloadzip.cfm."},{"key":"e_1_3_2_1_2_1","unstructured":"Bureau of Transportation Statistics. http:\/\/www.rita.dot.gov\/bts\/data_and_statistics\/by_mode\/airline_and_airports\/index.html. Bureau of Transportation Statistics. http:\/\/www.rita.dot.gov\/bts\/data_and_statistics\/by_mode\/airline_and_airports\/index.html."},{"key":"e_1_3_2_1_3_1","unstructured":"National Transportation Safety Board. http:\/\/www.ntsb.gov\/_layouts\/ntsb.aviation\/index.aspx. National Transportation Safety Board. http:\/\/www.ntsb.gov\/_layouts\/ntsb.aviation\/index.aspx."},{"key":"e_1_3_2_1_4_1","unstructured":"U.S. Census Bureau. https:\/\/www.census.gov\/population\/metro\/data\/. U.S. Census Bureau. https:\/\/www.census.gov\/population\/metro\/data\/."},{"issue":"2","key":"e_1_3_2_1_5_1","first-page":"163","article-title":"The role of wealth in the demand for international air travel","volume":"28","author":"Alperovich G.","year":"1994","unstructured":"G. Alperovich and Y. Machnes . The role of wealth in the demand for international air travel . Journal of Transport Economics and Policy , 28 ( 2 ): 163 -- 173 , 1994 . G. Alperovich and Y. Machnes. The role of wealth in the demand for international air travel. Journal of Transport Economics and Policy, 28(2):163--173, 1994.","journal-title":"Journal of Transport Economics and Policy"},{"key":"e_1_3_2_1_6_1","first-page":"1027","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Arthur D.","year":"2007","unstructured":"D. Arthur and S. Vassilvitskii . K-Means+: The advantages of careful seeding . In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 1027 -- 1035 , 2007 . D. Arthur and S. Vassilvitskii. K-Means+: The advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1027--1035, 2007."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jairtraman.2007.11.001"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1177\/1087724X05284016"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1162264"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00179-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00261-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.5.2.266"},{"key":"e_1_3_2_1_13_1","first-page":"226","volume-title":"Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD)","author":"Ester M.","year":"1996","unstructured":"M. Ester , H.-P. Kriegel , J. Sander , and X. Xu . A density-based algorithm for discovering clusters in large spatial databases with noise . In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD) , pages 226 -- 231 , 1996 . M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), pages 226--231, 1996."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(90)90030-3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623744"},{"issue":"9","key":"e_1_3_2_1_18_1","first-page":"295","article-title":"Branch-and-bound algorithms for the solution of the general unidimensional knapsack problem","volume":"13","author":"Martello S.","year":"1977","unstructured":"S. Martello and P. Toth . Branch-and-bound algorithms for the solution of the general unidimensional knapsack problem . Advances in Operations Research , 13 ( 9 ): 295 -- 301 , 1977 . S. Martello and P. Toth. Branch-and-bound algorithms for the solution of the general unidimensional knapsack problem. Advances in Operations Research, 13(9):295--301, 1977.","journal-title":"Advances in Operations Research"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s006070050042"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.1.75.11898"},{"volume-title":"Gaussian Processes for Machine Learning. Adaptive Computation and Machine Learning","year":"2006","author":"Rasmussen C.","key":"e_1_3_2_1_21_1","unstructured":"C. Rasmussen and C. Williams . Gaussian Processes for Machine Learning. Adaptive Computation and Machine Learning . MIT Press , 2006 . C. Rasmussen and C. Williams. Gaussian Processes for Machine Learning. Adaptive Computation and Machine Learning. MIT Press, 2006."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1366-5545(99)00026-5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289263"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2004.06.002"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2788615"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623633"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783337"}],"event":{"name":"KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"San Francisco California USA","acronym":"KDD '16"},"container-title":["Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T04:42:27Z","timestamp":1673325747000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939726"}},"subtitle":["Frequency-Based Maximization of Airline Profits based on an Ensemble Forecasting Approach"],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":28,"alternative-id":["10.1145\/2939672.2939726","10.1145\/2939672"],"URL":"https:\/\/doi.org\/10.1145\/2939672.2939726","relation":{},"subject":[],"published":{"date-parts":[[2016,8,13]]},"assertion":[{"value":"2016-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}