Open Access Open Access  Restricted Access Subscription or Fee Access

Dynamically Cluster Driven of the Person Navigation for Exploring the Search Space

V. Yamini Priya, P. Mallika, T Seenivasan

Abstract


Similarly, the SQL-based group-by operator (SGB) extends the semantics of standard SQL groups by grouping data with similar but not necessarily equal values. Although existing similarity-based grouping operators effectively implement these approximate semantics, they focus on one-dimensional attributes and handle multidimensional properties independently. However, related attributes, such as in spatial data, are processed independently, and therefore, groups in multidimensional space cannot be properly detected. To solve this problem, we introduced two new SGB operators for multidimensional data. The first operator is the community (or all distance) SGB, where all tuples in a group are within a certain distance from each other. The second operator is the distance to any SGB, where the tuple belongs to the group if the tuple is within some distance of any other tuple in the group. Tuples can meet the membership criteria of multiple groups, we introduce three different semantics.

Full Text:

PDF

References


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.