Dynamically Cluster Driven of the Person Navigation for Exploring the Search Space
Abstract
Full Text:
PDFReferences
A. Abouzied, J.M. Hellerstein, A. Silberschatz. Dataplay: Interactive tweaking and example-driven correction of graphical database queries, In: UIST. 2012.
C.C. Aggarwal, J.L. Wolf, P.S. Yu, C. Procopiuc, J.S. Park. Fast algorithms for projected clustering, In: SIGMOD. 1999.
K. Bache, M. Lichman. UCI machine learning repository, 2013.
K. Beyer, J. Goldstein, R. Ramakrishnan, U. Shaft. When is “nearest neighbor” meaningful? In: ICDT. 1999.
P.A. Boncz, S. Manegold, M.L. Kersten. Database architecture evolution: mammals flourished long before dinosaurs became extinct, Proc VLDB. 2009.
L. Breiman, J. Friedman, C.J. Stone, R.A. Olshen. Classification and Regression Trees. CRC Press; 1984.
G. Chatzopoulou, M. Eirinaki, N. Polyzotis. Query recommendations for interactive database exploration, In: SSDBM. 2009.
K. Dimitriadou, O. Papaemmanouil, Y. Diao. Explore-byexample: an automatic query steering framework for interactive data exploration, In: Proc SIGMOD. 2014.
P. Godfrey, R. Shipley, J. Gryz. Algorithms and analyses for maximal vector computation, Proc VLDB. 2007.
S. G¨unnemann, I. F¨arber, E. M¨uller, I. Assent, T. Seidl, External evaluation measures for subspace clustering, In: CIKM. 2011.
S. Idreos, O. Papaemmanouil, S. Chaudhuri. Overview of data [11] exploration techniques, In: Proc. SIGMOD. 2015, 277–81p.
L. Kaufman, P.J. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons; 1990.
H.-P. Kriegel, P. Kroger, M. Renz, S. Wurst. A generic framework for efficient subspace clustering of high-dimensional data, In: ICDM. 2005.
H.-P. Kriegel, P. Kr¨oger, A. Zimek. Clustering highdimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering, TKDD. 2009.
T. Sellam, M. Kersten. Cluster-Driven Navigation of the Query Space. 2015.
DOI: https://doi.org/10.37628/ijocspl.v3i1.259
Refbacks
- There are currently no refbacks.