{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:50:45Z","timestamp":1775281845069,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":66,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662584149","type":"print"},{"value":"9783662584156","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-662-58415-6_6","type":"book-chapter","created":{"date-parts":[[2018,11,22]],"date-time":"2018-11-22T05:43:25Z","timestamp":1542865405000},"page":"169-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Interactive Exploration of Subspace Clusters on Multicore Processors"],"prefix":"10.1007","author":[{"given":"The Hai","family":"Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Kristensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Son T.","family":"Mai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ira","family":"Assent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Jacobsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anh","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,23]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/11871637_42","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"E Achtert","year":"2006","unstructured":"Achtert, E., B\u00f6hm, C., Kriegel, H.-P., Kr\u00f6ger, P., M\u00fcller-Gorman, I., Zimek, A.: Finding hierarchies of subspace clusters. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 446\u2013453. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871637_42"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-71703-4_15","volume-title":"Advances in Databases: Concepts, Systems and Applications","author":"E Achtert","year":"2007","unstructured":"Achtert, E., B\u00f6hm, C., Kriegel, H.-P., Kr\u00f6ger, P., M\u00fcller-Gorman, I., Zimek, A.: Detection and visualization of subspace cluster hierarchies. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 152\u2013163. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71703-4_15"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/304181.304188","volume":"28","author":"Charu C. Aggarwal","year":"1999","unstructured":"Aggarwal, C.C., Procopiuc, C.M., Wolf, J.L., Yu, P.S., Park, J.S.: Fast algorithms for projected clustering. In: SIGMOD, pp. 61\u201372 (1999)","journal-title":"ACM SIGMOD Record"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: SIGMOD, pp. 94\u2013105 (1998)","DOI":"10.1145\/276304.276314"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-29038-1_18","volume-title":"Database Systems for Advanced Applications","author":"I Assent","year":"2012","unstructured":"Assent, I., Kranen, P., Baldauf, C., Seidl, T.: AnyOut: anytime outlier detection on streaming data. In: Lee, S., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012. LNCS, vol. 7238, pp. 228\u2013242. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29038-1_18"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Kailing, K., Kriegel, H.P., Kr\u00f6ger, P.: Density connected clustering with local subspace preferences. In: ICDM, pp. 27\u201334 (2004)","DOI":"10.1109\/ICDM.2004.10087"},{"key":"6_CR7","volume-title":"Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)","author":"B Chapman","year":"2007","unstructured":"Chapman, B., Jost, G., Pas, R.: Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation). The MIT Press, Cambridge (2007)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-319-75417-8_54","volume-title":"Intelligent Information and Database Systems","author":"MT Dang","year":"2018","unstructured":"Dang, M.T., Luong, A.V., Vu, T.-T., Nguyen, Q.V.H., Nguyen, T.T., Stantic, B.: An ensemble system with random projection and dynamic ensemble selection. In: Nguyen, N.T., Hoang, D.H., Hong, T.-P., Pham, H., Trawi\u0144ski, B. (eds.) ACIIDS 2018. LNCS (LNAI), vol. 10751, pp. 576\u2013586. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75417-8_54"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"22119","DOI":"10.1109\/ACCESS.2017.2764750","volume":"5","author":"Xiaolong Deng","year":"2017","unstructured":"Deng, X., Dou, Y., Lv, T., Nguyen, Q.V.H.: A novel centrality cascading based edge parameter evaluation method for robust influence maximization. IEEE Access 5, 22119\u201322131 (2017)","journal-title":"IEEE Access"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-68155-9_10","volume-title":"Databases Theory and Applications","author":"CT Duong","year":"2017","unstructured":"Duong, C.T., Nguyen, Q.V.H., Wang, S., Stantic, B.: Provenance-based rumor detection. In: Huang, Z., Xiao, X., Cao, X. (eds.) ADC 2017. LNCS, vol. 10538, pp. 125\u2013137. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68155-9_10"},{"key":"6_CR11","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, pp. 226\u2013231 (1996)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Greiner, J.: A comparison of parallel algorithms for connected components. In: SPAA, pp. 16\u201325 (1994)","DOI":"10.1145\/181014.181021"},{"key":"6_CR13","unstructured":"Hinneburg, A., Aggarwal, C.C., Keim, D.A.: What is the nearest neighbor in high dimensional spaces? In: VLDB, pp. 506\u2013515 (2000)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Hung, N.Q.V., Anh, D.T.: Combining sax and piecewise linear approximation to improve similarity search on financial time series. In: ISITC, pp. 58\u201362 (2007)","DOI":"10.1109\/ISITC.2007.24"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/978-3-540-89197-0_64","volume-title":"PRICAI 2008: Trends in Artificial Intelligence","author":"NQV Hung","year":"2008","unstructured":"Hung, N.Q.V., Anh, D.T.: An improvement of PAA for dimensionality reduction in large time series databases. In: Ho, T.-B., Zhou, Z.-H. (eds.) PRICAI 2008. LNCS (LNAI), vol. 5351, pp. 698\u2013707. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89197-0_64"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Hung, N.Q.V., Anh, D.T.: Using motif information to improve anytime time series classification. In: SoCPaR, pp. 1\u20136 (2013)","DOI":"10.1109\/SOCPAR.2013.7054095"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Hung, N.Q.V., et al.: Argument discovery via crowdsourcing. VLDB J. 26, 511\u2013535 (2017)","DOI":"10.1007\/s00778-017-0462-9"},{"issue":"11","key":"6_CR18","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1109\/TKDE.2012.237","volume":"25","author":"Nguyen Quoc Viet Hung","year":"2013","unstructured":"Hung, N.Q.V., Jeung, H., Aberer, K.: An evaluation of model-based approaches to sensor data compression. TKDE 25, 2434\u20132447 (2013)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Hung, N.Q.V., Luong, X.H., Mikl\u00f3s, Z., Quan, T.T., Aberer, K.: An MAS negotiation support tool for schema matching. In: AAMAS, pp. 1391\u20131392 (2013)","DOI":"10.65109\/FMOP8335"},{"key":"6_CR20","unstructured":"Hung, N.Q.V., Sathe, S., Duong, C.T., Aberer, K.: Towards enabling probabilistic databases for participatory sensing. In: CollaborateCom, pp. 114\u2013123 (2014)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-41154-0_1","volume-title":"Web Information Systems Engineering \u2013 WISE 2013","author":"N Quoc Viet Hung","year":"2013","unstructured":"Quoc Viet Hung, N., Tam, N.T., Tran, L.N., Aberer, K.: An evaluation of aggregation techniques in crowdsourcing. In: Lin, X., Manolopoulos, Y., Srivastava, D., Huang, G. (eds.) WISE 2013. LNCS, vol. 8181, pp. 1\u201315. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41154-0_1"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-37450-0_10","volume-title":"Database Systems for Advanced Applications","author":"NQV Hung","year":"2013","unstructured":"Hung, N.Q.V., Tam, N.T., Mikl\u00f3s, Z., Aberer, K.: On leveraging crowdsourcing techniques for schema matching networks. In: Meng, W., Feng, L., Bressan, S., Winiwarter, W., Song, W. (eds.) DASFAA 2013. LNCS, vol. 7826, pp. 139\u2013154. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37450-0_10"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Hung, N.Q.V., Tam, N.T., Mikl\u00f3s, Z., Aberer, K.: Reconciling schema matching networks through crowdsourcing. EAI 1, e2 (2014)","DOI":"10.4108\/cc.1.2.e2"},{"issue":"6","key":"6_CR24","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/s00778-017-0484-3","volume":"26","author":"Nguyen Quoc Viet Hung","year":"2017","unstructured":"Hung, N.Q.V., et al.: Answer validation for generic crowdsourcing tasks with minimal efforts. VLDB J. 26, 855\u2013880 (2017)","journal-title":"The VLDB Journal"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Hung, N.Q.V., Thang, D.C., Weidlich, M., Aberer, K.: Minimizing efforts in validating crowd answers. In: SIGMOD, pp. 999\u20131014 (2015)","DOI":"10.1145\/2723372.2723731"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-319-18120-2_30","volume-title":"Database Systems for Advanced Applications","author":"QVH Nguyen","year":"2015","unstructured":"Nguyen, Q.V.H., Do, S.T., Nguyen, T.T., Aberer, K.: Tag-based paper retrieval: minimizing user effort with diversity awareness. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9049, pp. 510\u2013528. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18120-2_30"},{"issue":"1","key":"6_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2017.2750683","volume":"30","author":"NQV Hung","year":"2018","unstructured":"Hung, N.Q.V., Viet, H.H., Tam, N.T., Weidlich, M., Yin, H., Zhou, X.: Computing crowd consensus with partial agreement. IEEE Trans. Knowl. Data Eng. 30(1), 1\u201314 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-642-41924-9_19","volume-title":"Conceptual Modeling","author":"H Quoc Viet Nguyen","year":"2013","unstructured":"Quoc Viet Nguyen, H., et al.: Minimizing human effort in reconciling match networks. In: Ng, W., Storey, V.C., Trujillo, J.C. (eds.) ER 2013. LNCS, vol. 8217, pp. 212\u2013226. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41924-9_19"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Kleinberg, R.D.: Anytime algorithms for multi-armed bandit problems. In: SODA, pp. 928\u2013936 (2006)","DOI":"10.1145\/1109557.1109659"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-22351-8_24","volume-title":"Scientific and Statistical Database Management","author":"H-P Kriegel","year":"2011","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Ntoutsi, I., Zimek, A.: Density based subspace clustering over dynamic data. In: Bayard Cushing, J., French, J., Bowers, S. (eds.) SSDBM 2011. LNCS, vol. 6809, pp. 387\u2013404. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22351-8_24"},{"issue":"1","key":"6_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"Hans-Peter Kriegel","year":"2009","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Zimek, A.: Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. TKDD 3(1), 1 (2009)","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-319-64468-4_25","volume-title":"Database and Expert Systems Applications","author":"J Kristensen","year":"2017","unstructured":"Kristensen, J., Mai, S.T., Assent, I., Jacobsen, J., Vo, B., Le, A.: Interactive exploration of subspace clusters for high dimensional data. In: Benslimane, D., Damiani, E., Grosky, W.I., Hameurlain, A., Sheth, A., Wagner, R.R. (eds.) DEXA 2017. LNCS, vol. 10438, pp. 327\u2013342. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64468-4_25"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Kr\u00f6ger, P., Kriegel, H.P., Kailing, K.: Density-connected subspace clustering for high-dimensional data. In: SDM, pp. 246\u2013256 (2004)","DOI":"10.1137\/1.9781611972740.23"},{"key":"6_CR34","volume-title":"Introduction to Parallel Computing","author":"V Kumar","year":"2002","unstructured":"Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2002)","edition":"2"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Kywe, W.W., Fujiwara, D., Murakami, K.: Scheduling of image processing using anytime algorithm for real-time system. In: ICPR, vol. 3, pp. 1095\u20131098 (2006)","DOI":"10.1109\/ICPR.2006.1029"},{"key":"6_CR36","unstructured":"Mai, S.T., et al.: Scalable interactive dynamic graph clustering on multicore CPUs. TKDE"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Mai, S.T., Amer-Yahia, S., Chouakria, A.D.: Scalable active temporal constrained clustering. In: EDBT, pp. 449\u2013452 (2018)","DOI":"10.1007\/978-3-319-91452-7_37"},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-319-91452-7_37","volume-title":"Database Systems for Advanced Applications","author":"ST Mai","year":"2018","unstructured":"Mai, S.T., Amer-Yahia, S., Chouakria, A.D., Nguyen, K.T., Nguyen, A.-D.: Scalable active constrained clustering for temporal data. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds.) DASFAA 2018. LNCS, vol. 10827, pp. 566\u2013582. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91452-7_37"},{"issue":"4","key":"6_CR39","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1007\/s10618-018-0562-1","volume":"32","author":"ST Mai","year":"2018","unstructured":"Mai, S.T., Assent, I., Jacobsen, J., Dieu, M.S.: Anytime parallel density-based clustering. Data Min. Knowl. Discov. 32(4), 1121\u20131176 (2018)","journal-title":"Data Min. Knowl. Discov."},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-32025-0_11","volume-title":"Database Systems for Advanced Applications","author":"ST Mai","year":"2016","unstructured":"Mai, S.T., Assent, I., Le, A.: Anytime OPTICS: an efficient approach for hierarchical density-based clustering. In: Navathe, S.B., Wu, W., Shekhar, S., Du, X., Wang, X.S., Xiong, H. (eds.) DASFAA 2016. LNCS, vol. 9642, pp. 164\u2013179. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32025-0_11"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Mai, S.T., Assent, I., Storgaard, M.: AnyDBC: an efficient anytime density-based clustering algorithm for very large complex datasets. In: SIGKDD, pp. 1025\u20131034 (2016)","DOI":"10.1145\/2939672.2939750"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Mai, S.T., Dieu, M.S., Assent, I., Jacobsen, J., Kristensen, J., Birk, M.: Scalable and interactive graph clustering algorithm on multicore CPUs. In: ICDE, pp. 349\u2013360 (2017)","DOI":"10.1109\/ICDE.2017.94"},{"key":"6_CR43","doi-asserted-by":"crossref","unstructured":"Mai, S.T., He, X., Feng, J., B\u00f6hm, C.: Efficient anytime density-based clustering. In: SDM, pp. 112\u2013120 (2013)","DOI":"10.1137\/1.9781611972832.13"},{"issue":"2","key":"6_CR44","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10115-014-0797-0","volume":"45","author":"ST Mai","year":"2015","unstructured":"Mai, S.T., He, X., Feng, J., Plant, C., B\u00f6hm, C.: Anytime density-based clustering of complex data. Knowl. Inf. Syst. 45(2), 319\u2013355 (2015)","journal-title":"Knowl. Inf. Syst."},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Mai, S.T., He, X., Hubig, N., Plant, C., B\u00f6hm, C.: Active density-based clustering. In: ICDM, pp. 508\u2013517 (2013)","DOI":"10.1109\/ICDM.2013.39"},{"key":"6_CR46","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1137\/1.9781611972825.85","volume-title":"Proceedings of the 2012 SIAM International Conference on Data Mining","author":"Irene Ntoutsi","year":"2012","unstructured":"Ntoutsi, I., Zimek, A., Palpanas, T., Kr\u00f6ger, P., Kriegel, H.: Density-based projected clustering over high dimensional data streams. In: SDM, pp. 987\u2013998 (2012)"},{"issue":"1","key":"6_CR47","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L Parsons","year":"2004","unstructured":"Parsons, L., Haque, E., Liu, H.: Subspace clustering for high dimensional data: a review. SIGKDD Explor. 6(1), 90\u2013105 (2004)","journal-title":"SIGKDD Explor."},{"key":"6_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-46922-5_18","volume-title":"Databases Theory and Applications","author":"DA Peixoto","year":"2016","unstructured":"Peixoto, D.A., Hung, N.Q.V.: Scalable and fast top-k most similar trajectories search using mapreduce in-memory. In: Cheema, M.A., Zhang, W., Chang, L. (eds.) ADC 2016. LNCS, vol. 9877, pp. 228\u2013241. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46922-5_18"},{"key":"6_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/978-3-319-91458-9_53","volume-title":"Database Systems for Advanced Applications","author":"DA Peixoto","year":"2018","unstructured":"Peixoto, D.A., Zhou, X., Hung, N.Q.V., He, D., Stantic, B.: A system for spatial-temporal trajectory data integration and representation. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds.) DASFAA 2018. LNCS, vol. 10828, pp. 807\u2013812. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91458-9_53"},{"key":"6_CR50","unstructured":"Settles, B.: Active learning literature survey. Computer Sciences Technical report 1648, University of Wisconsin-Madison (2009)"},{"key":"6_CR51","doi-asserted-by":"crossref","unstructured":"Shieh, J., Keogh, E.J.: Polishing the right apple: anytime classification also benefits data streams with constant arrival times. In: ICDM, pp. 461\u2013470 (2010)","DOI":"10.1109\/ICDM.2010.120"},{"issue":"2","key":"6_CR52","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/s10618-012-0258-x","volume":"26","author":"K Sim","year":"2013","unstructured":"Sim, K., Gopalkrishnan, V., Zimek, A., Cong, G.: A survey on enhanced subspace clustering. Data Min. Knowl. Discov. 26(2), 332\u2013397 (2013)","journal-title":"Data Min. Knowl. Discov."},{"key":"6_CR53","unstructured":"Smyth, P., Wolpert, D.: Anytime exploratory data analysis for massive data sets. In: KDD, pp. 54\u201360 (1997)"},{"key":"6_CR54","doi-asserted-by":"crossref","unstructured":"Tam, N.T., Hung, N.Q.V., Weidlich, M., Aberer, K.: Result selection and summarization for web table search. In: ICDE, pp. 231\u2013242 (2015)","DOI":"10.1109\/ICDE.2015.7113287"},{"key":"6_CR55","doi-asserted-by":"crossref","unstructured":"Tam, N.T., Weidlich, M., Thang, D.C., Yin, H., Hung, N.Q.V.: Retaining data from streams of social platforms with minimal regret. In: IJCAI, pp. 2850\u20132856 (2017)","DOI":"10.24963\/ijcai.2017\/397"},{"key":"6_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-22852-5_19","volume-title":"Database and Expert Systems Applications","author":"DC Thang","year":"2015","unstructured":"Thang, D.C., Tam, N.T., Hung, N.Q.V., Aberer, K.: An evaluation of diversification techniques. In: Chen, Q., Hameurlain, A., Toumani, F., Wagner, R., Decker, H. (eds.) DEXA 2015. LNCS, vol. 9262, pp. 215\u2013231. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22852-5_19"},{"key":"6_CR57","doi-asserted-by":"publisher","first-page":"17776","DOI":"10.1109\/ACCESS.2018.2815740","volume":"6","author":"NT Toan","year":"2018","unstructured":"Toan, N.T., Cong, P.T., Tam, N.T., Hung, N.Q.V., Stantic, B.: Diversifying group recommendation. IEEE Access 6, 17776\u201317786 (2018)","journal-title":"IEEE Access"},{"key":"6_CR58","doi-asserted-by":"crossref","unstructured":"Ueno, K., Xi, X., Keogh, E.J., Lee, D.J.: Anytime classification using the nearest neighbor algorithm with applications to stream mining. In: ICDM, pp. 623\u2013632 (2006)","DOI":"10.1109\/ICDM.2006.21"},{"key":"6_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-319-91452-7_7","volume-title":"Database Systems for Advanced Applications","author":"W Wang","year":"2018","unstructured":"Wang, W., Yin, H., Huang, Z., Sun, X., Hung, N.Q.V.: Restricted Boltzmann machine based active learning for sparse recommendation. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds.) DASFAA 2018. LNCS, vol. 10827, pp. 100\u2013115. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91452-7_7"},{"key":"6_CR60","doi-asserted-by":"crossref","unstructured":"Yin, H., Chen, H., Sun, X., Wang, H., Wang, Y., Nguyen, Q.V.H.: SPTF: a scalable probabilistic tensor factorization model for semantic-aware behavior prediction. In: ICDM, pp. 585\u2013594 (2017)","DOI":"10.1109\/ICDM.2017.68"},{"key":"6_CR61","doi-asserted-by":"crossref","unstructured":"Yin, H., Chen, L., Wang, W., Du, X., Hung, N.Q.V., Zhou, X.: Mobi-SAGE: a sparse additive generative model for mobile app recommendation. In: ICDE, pp. 75\u201378 (2017)","DOI":"10.1109\/ICDE.2017.43"},{"key":"6_CR62","doi-asserted-by":"crossref","unstructured":"Yin, H., et al.: Discovering interpretable geo-social communities for user behavior prediction. In: ICDE, pp. 942\u2013953 (2016)","DOI":"10.1109\/ICDE.2016.7498303"},{"issue":"10","key":"6_CR63","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1109\/TKDE.2016.2580511","volume":"28","author":"Hongzhi Yin","year":"2016","unstructured":"Yin, H., Zhou, X., Cui, B., Wang, H., Zheng, K., Hung, N.Q.V.: Adapting to user interest drift for POI recommendation. TKDE 28, 2566\u20132581 (2016)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"6_CR64","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Meira Jr., W.: Data Mining and Analysis: Fundamental Concepts and Algorithms. Cambridge University Press, New York (2014)","DOI":"10.1017\/CBO9780511810114"},{"issue":"3","key":"6_CR65","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein, S.: Using anytime algorithms in intelligent systems. AI Mag. 17(3), 73\u201383 (1996)","journal-title":"AI Mag."},{"key":"6_CR66","unstructured":"Zilberstein, S., Russell, S.J.: Anytime sensing planning and action: a practical model for robot control. In: IJCAI, pp. 1402\u20131407 (1993)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Large-Scale Data- and Knowledge-Centered Systems XXXIX"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-58415-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:01:01Z","timestamp":1775278861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-58415-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783662584149","9783662584156"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-58415-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}