System of visualizing and querying data using data-pearls

Abstract

A system and method for visualizing and querying high dimensional data to a user. The system includes a user device, a data-pearls visualization and querying server. The server obtains the high dimensional data from the user device associated with user. The server generates data clusters and sub-divides the data clusters into non-overlapping subsets of data-pearls using a clustering technique. The server selects a shape for each data-pearl by comparing a distance between centroid of a data-pearl and a farthest point from a determined centroid using L.sub.p norm distance measures. The server configures each data-pearl in a three-dimensional plot. The server enables the user to visualize the data-pearls on a screen of the user device. The server queries data based on a query using data dimension technique. The server dimensions data related to the query through determined classifiers based on filtered data after pruning unrelated data to the query.

Claims

1. A computer-implemented method for generating visual representations of high dimensional data using a plurality of data-pearls to a user, said method performed by one or more hardware processors comprising: implementing a clustering technique that is configured to extract at least one data cluster from the high dimensional data and sub-dividing the at least one data cluster that is extracted into the plurality of data-pearls such that the plurality of data-pearls are not partitioned further and are not overlapped with one another; implementing L.sub.p norm distance measures that is configured to select a L.sub.p norm shape for each data-pearl of the at least one data cluster by comparing an average distance (Ap) between a centroid of the plurality of data-pearls and all points in the plurality of data-pearls to obtain a minimum average distance, wherein the minimum average distance is fixed as p; constructing the L.sub.p norm shape by providing an envelope for the plurality of data-pearls using the L.sub.p norm distance measures by defining the envelope using the L.sub.p norm distance measures such that L.sub.p(x,y)=r, x, and y are a set of points on the envelope based on a given distance value r, wherein the given distance value r is equal to the minimum average distance; representing a high-dimensional space occupied by the high-dimensional data as sectors in a plane of a three-dimensional plot by defining an origin of the three-dimensional plot as centroid of the at least one data cluster and a range of axes of the three-dimensional plot based on a distance between a center of each data-pearl, the centroid of the at least one data cluster and a radius of each data-pearl; plotting each data-pearl in the L.sub.p norm shape in a corresponding sector of the plane of the tree-dimensional plot using a radius of the L.sub.p norm shape, a sector angle in the three-dimensional plot, and an elevation angle; and generating visual representations of the plurality of data-pearls of the high dimensional data in plotted L.sub.p norm shapes in the sectors of the plane of the three-dimensional plot using a graphics module of a user device associated with the user.

2. The method of claim 1, further comprising querying the high-dimensional data based on a query provided by the user using at least one dimension, by (i) determining the plurality of data-pearls and placing the plurality of data-pearls separately using domain values of the at least one dimension, (ii) implementing a concept search that is configured to select the plurality of data-pearls based on the query provided by the user, (iii) incrementing the plurality of data-pearls based on a volume of at least one dataset, wherein the at least one dataset comprises the plurality of data-pearls, wherein the plurality of data-pearls comprises at least one attribute, (iv) filtering the high-dimensional data based on the plurality of data-pearls, (v) selecting data related to the query and performing steps from (i) to (iv) repetitively, and (vi) dimensioning the data related to the query through determined classifiers based on filtered data after pruning unrelated data to the query.

3. The method of claim 1, wherein the farthest point is computed from the centroid of corresponding data-pearl based on Lp norm distance measures.

4. The method of claim 1, wherein the elevation angle is an angle between the centroid of the plurality of data-pearls and a unit vector in dimension with maximum standard deviation.

5. The method of claim 1, further comprising identifying the L.sub.p norm shape from a given set of L.sub.p norm shapes as determined by the closed sets formed by points having at a most distance using the L.sub.p norm distance measures.

6. The method of claim 1, wherein each Lp norm distance measure defined as a positive square root of sum of all squares of the distance in each dimension related to the high-dimensional data.

7. One or more non-transitory computer-readable storage medium storing the one or more sequence of instructions, which when executed by the one or more processors, causes to perform a method of generating visual representations of high dimensional data using a plurality of data-pearls to a user, wherein the method comprises: implementing a clustering technique that is configured to extract at least one data cluster from the high dimensional data and sub-dividing the at least one data cluster that is extracted into the plurality of data-pearls such that the plurality of data-pearls is not partitioned further and is not overlapped with one another; implementing L.sub.p norm distance measures that is configured to select a L.sub.p norm shape for each data-pearl of the at least one data cluster by comparing an average distance (Ap) between a centroid of the plurality of data-pearls all points in the plurality of data-pearls to obtain a minimum average distance, wherein the minimum average distance is fixed as p; constructing the L.sub.p norm shape by providing an envelope for the plurality of data-pearls using the L.sub.p norm distance measures by defining the envelope using the L.sub.p norm distance measures such that L.sub.p(x,y)=r, x, and y are a set of points on the envelope based on a given distance value r, wherein the given distance value r is equal to the minimum average distance; representing a high-dimensional space occupied by the high-dimensional data as sectors in a plane of a three-dimensional plot by defining an origin of the three-dimensional plot as centroid of the at least one data cluster and a range of axes of the three-dimensional plot based on a distance between a center of each data-pearl, the centroid of the at least one data cluster and a radius of each data-pearl; plotting each data-pearl in the L.sub.p norm shape in a corresponding sector of the plane of the three-dimensional plot using a radius of the L.sub.p norm shape, a sector angle in the three-dimensional plot, and an elevation angle; and generating visual representations of the plurality of data-pearls of the high dimensional data in plotted L.sub.p norm shapes in the sectors of the plane of the three-dimensional plot using a graphics module of a user device associated with the user.

8. A system for generating visual representations of high dimensional data using a plurality of data-pearls to a user comprising: a device processor; and a non-transitory computer-readable storage medium storing one or more sequences of instructions, which when executed by the device processor, causes: implement a clustering technique that is configured to extract at least one data cluster from the high dimensional data and sub-dividing the at least one data cluster that is extracted into the plurality of data-pearls such that the plurality of data-pearls is not partitioned further and is not overlapped with one another; implement L.sub.p norm distance measures that is configured to select a L.sub.p norm shape for each data-pearl of the at least one data cluster by comparing an average distance (Ap) between a centroid of the plurality of data-pearls and all points in the plurality of data-pearls to obtain a minimum average distance, wherein the minimum average distance is fixed as p; construct the L.sub.p norm shape by providing an envelope for the plurality of data-pearls using the L.sub.p norm distance measures by defining the envelope using the L norm distance measures such that L.sub.p(x,y)=r, x, and y are a set of points on the envelope based on a given distance value r, wherein the given distance value r is equal to the minimum average distance; represent a high-dimensional space occupied by the high-dimensional data as sectors in a plane of a three-dimensional plot by defining an origin of the three-dimensional plot as centroid of the at least one data cluster and a range of axes of the three-dimensional plot based on a distance between a center of each data-pearl, the centroid of the at least one data cluster and a radius of each data-pearl; plot each data-pearl in the L.sub.p norm shape in a corresponding sector of h plane of the three-dimensional plot using a radius of the L.sub.p norm shape, a sector angle in the three-dimensional plot, and an elevation angle; and generate visual representations of the plurality of data-pearls of the high dimensional data in plotted L.sub.p norm shapes in the sectors of the plane of the three-dimensional plot using a graphics module of a user device associated with the user.

9. The system of claim 8, wherein the system further performs querying the high-dimensional data based on a query using the at least one of data-pearl, by, (i) determining the plurality of data-pearls and placing the plurality of data-pearls separately using domain values of the at least one dimension, (ii) implementing a concept search that is configured to select the plurality of data-pearls based on the query provided by the user, (iii) incrementing the plurality of data-pearls based on a volume of at least one dataset, wherein the at least one dataset comprises the plurality of data-pearls, wherein the plurality of data-pearls comprises at least one attribute, (iv) filtering the high-dimensional data based on the plurality of data-pearls, wherein the at least one dataset comprises the plurality of data-pearls and the plurality of data-pearls comprises at least one attribute, (v) selecting data related to the query and performing steps from (i) to (iv) repetitively, and (vi) dimensioning the data related to the query through determined classifiers based on filtered data after pruning unrelated data to the query.

10. The system of claim 8, wherein the farthest point is computed from the centroid of corresponding data-pearl based on Lp norm distance measures.

11. The system of claim 8, wherein the elevation angle is an angle between the centroid of the plurality of data-pearls and a unit vector in dimension with maximum standard deviation.

12. The system of claim 8, further comprising identifying the L.sub.p norm shape from a given set of L.sub.p norm shapes as determined by the closed sets formed by points having at a most distance using the L.sub.p norm distance measures.

13. The system of claim 8, wherein each Lp norm distance measure is defined as a positive square root of sum of all squares of the distance in each dimension related to the high-dimensional data.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) The embodiments herein will be better understood from the following detailed description with reference to the drawings, in which:

(2) FIG. 1 is a block diagram that illustrates a system of visualizing high-dimensional data using data-pearls according to some embodiments herein;

(3) FIG. 2 is a block diagram of a data-pearls visualization and querying server according to some embodiments herein;

(4) FIGS. 3A-3C are exemplary representations that illustrate data visualization and results of concept search on footballer's dataset according to some embodiments herein;

(5) FIG. 4 is a flow diagram that illustrates a method of visualizing high dimensional data using at least one data-pearl by a user according to some embodiments herein;

(6) FIG. 5 is a flow diagram that illustrates a method of querying the high-dimensional data based on a query using the at least one data-pearl according to some embodiments herein;

(7) FIG. 6 is an interaction diagram that illustrates a method of visualizing high dimensional data using data-pearls, according to some embodiments herein;

(8) FIG. 7 illustrates an exploded view of a computing device according to an embodiment herein; and

(9) FIG. 8 is a schematic diagram of a computer architecture in accordance with the embodiments herein.

DETAILED DESCRIPTION OF THE DRAWINGS

(10) The embodiments herein and the various features and advantageous details thereof are explained more fully with reference to the non-limiting embodiments that are illustrated in the accompanying drawings and detailed in the following description. Descriptions of well-known components and processing techniques are omitted so as to not unnecessarily obscure the embodiments herein. The examples used herein are intended merely to facilitate an understanding of ways in which the embodiments herein may be practiced and to further enable those of skill in the art to practice the embodiments herein. Accordingly, the examples should not be construed as limiting the scope of the embodiments herein.

(11) As mentioned, there remains a need for a system and method for visual querying on high dimensional data using data clusters that are data-pearls. Referring now to the drawings, and more particularly to FIGS. 1 through 8, where, preferred embodiments are shown.

(12) FIG. 1 is a block diagram 100 that illustrates a system of visualizing high-dimensional data using data-pearls according to some embodiments herein. The block diagram 100 includes a user device 104 associated with a user 102, and a data-pearls visualization and querying server 108. The data-pearls visualization and querying server 108 provides an intuitive and interactive interface for visual data exploration to the user device 104 associated with the user 102. The user device 104 and the data-pearls visualization and querying server 108 communicate through a network 106. In some embodiments, the network 106 is a wired network. In some embodiments, the network 106 is a wireless network. In some embodiments, the network 106 is a combination of a wired network and a wireless network. In some embodiments, the network 106 is the Internet and the like. In some embodiments, the user device 104, without limitation, may be selected from a mobile phone, a Personal Digital Assistant (PDA), a tablet, a desktop computer, or a laptop. The data-pearls visualization and querying server 108 includes and a device processor and a non-transitory computer-readable storage medium storing one or more sequences of instructions, which when executed by the device processor causes visualization of the high dimensional data using at least one data-pearl by the user 102. In some embodiments, the system 100 may include an application that may be installed in android based devices, windows-based devices, or any such mobile operating systems devices for visualizing the high-dimensional data using data-pearls.

(13) The data-pearls visualization and querying server 108 obtains high dimensional data from the user device 104 associated with the user 102. The high dimensional data may be given to the data-pearls visualization and querying server 108 through a user interface associated with the user device 104. In some embodiments, high dimensional data include data in one or more dimensions.

(14) The high dimensional data may include at least one dataset. The at least one dataset may include at least one data cluster. The data-pearls visualization and querying server 108 extracts at least one data cluster from the high dimensional data using a clustering technique. The data-pearls visualization and querying server 108 sub-divides the at least one data cluster into at least one data-pearl from the high dimensional data using the clustering technique. The at least one data-pearl is a subset of the at least one data cluster. Each data-pearl is not partitioned further and is not overlapped with one another. In some embodiments, the clustering technique may be K-means clustering technique. The data-pearls visualization and querying server 108 selects a L.sub.p norm shape for each data-pearl. The L.sub.p norm shape is selected by comparing a distance between a centroid of the at least one data-pearl and a farthest point from the centroid of the data-pearl using L.sub.p norm distance measures. The farthest point is computed from the centroid of the data-pearl using the L.sub.p norm distance measures. In some embodiments, the L.sub.p norm shapes may be a cube, sphere, etc. In some embodiments, each L.sub.p norm distance measure may be defined as a positive square root of sum of all squares of the distance in each dimension related to the high-dimensional data. In some embodiments, the L.sub.p norm shape is selected using any other distance measures other than L.sub.p norm distance measures.

(15) The data-pearls visualization and querying server 108 configures each data-pearl in the L.sub.p norm shape in a three-dimensional plot using a radius of the L.sub.p norm shape, a sector angle, and elevation angle. In some embodiments, the elevation angle is an angle between the centroid of the at least one data-pearl and a unit vector in dimension with maximum standard deviation. The data-pearls visualization and querying server 108 defines an origin of the three-dimensional plot a centroid of the at least one data cluster. The data-pearls visualization and querying server 108 defines a range of axes of the three-dimensional plot using a distance between a center of each data-pearl, the centroid of the at least one data cluster, and a radius of each data-pearl. The data-pearls visualization and querying server 108 represents a high-dimensional space occupied by the high-dimensional data as sectors in a plane of the three-dimensional plot. The data-pearls visualization and querying server 108 plots the at least one data-pearl lying in the high dimensional space in a corresponding sector of the three-dimensional plot to construct the L.sub.p norm shape.

(16) The data-pearls visualization and querying server 108 constructs the L.sub.p norm shape by providing an envelope for the at least one data-pearl using the L.sub.p norm distance measures. The data-pearls visualization and querying server 108 defines the envelope using the L.sub.p norm distance measures such that L.sub.p(x,y)=r, x, and y are a set of points on the envelope for a given distance value r, wherein the envelope obtains the L.sub.p norm shape based on the value of p. The data-pearls visualization and querying server 108 identifies the L.sub.p norm shape from a given set of L.sub.p norm shapes as determined by the closed sets formed by points having at most distance using L.sub.p norm distance measures.

(17) For example, four-dimensional (4D) space of four-dimensional data is divided into 16 parts by w, x, y and z axes. In some embodiments, orthogonal axes divisions of the high dimensional space are represented as sectors in XY plane of the three-dimensional plot. Correspondingly, the XY plane of the three-dimensional plot is also divided into sectors. In some embodiments, the data-pearls lying in various axes are plotted in the corresponding sector in the three-dimensional plot while constructing an overall shape of the clusters. The three-dimensional plot may provide a projection of the data-pearl position on the XY plane. The projection of the data-pearl is used for accessing Z-axis. The projection of the data-pearl position is obtained using the three-dimensional plot. In some embodiments, the three-dimensional plot is elevated by the elevation angle.

(18) The data-pearls visualization and querying server 108 enables the user 102 to visualize at least one data-pearl one of the high dimensional data, using a graphics module on a screen of the user device 104.

(19) The data-pearls visualization and querying server 108 enable the user 102 to search the high-dimensional data based on a query provided by the user 102 using at least one dimension, by (i) determining the at least one data-pearl and placing it in a separated manner using domain values of the at least one dimension, (ii) selecting, using a concept search, the at least one data-pearl based on the query provided by the user 102, (iii) incrementing the at least one data-pearl based on a volume of the at least one dataset, (iv) filtering the high-dimensional data based on the at least one data-pearl, the at least one dataset comprises the at least one data-pearl and the at least one data-pearl comprises at least one attribute, (v) selecting data related to the query and performing steps from (i) to (iv) iteratively and recursively, and (vi) dimensioning data related to the query through determined classifiers based on filtered data after pruning unrelated data to the query.

(20) In some embodiments, the at least one attribute of the user 102 may include acceleration, strength, finishing, heading, diving etc. In some embodiments, for example, the query in the concept search may be, “finding all the football players who are good strikers and have moderate heading accuracy”. The data-pearls visualization and querying server 108 selects the at least one attribute based on the query. In some embodiments, using the query stated above, the data-pearls visualization and querying server 108 determines a group of datapoints of all the football players who are “good” at striking, and a group of datapoints of all the football players who are “moderate”. A data-dimension is selected as “finishing” data attribute on one axis and as “heading accuracy” data attribute on another axis. The data-pearls visualization and querying server 108 filters the data-pearls using a data dimension technique. The data-pearls visualization and querying server 108 dimensions the data-pearls based on filtered data. The data-pearls visualization and querying server 108 determines number of classifiers on Z-axis using the three-dimensional plot. In some embodiments, the Z-axis is a group of datapoints of all the football players who are “moderate” as finishing. The data-pearls visualization and querying server 108 removes irrelevant data-pearls by considering the Z coordinate values. In some embodiments, the steps are recorded as a video in the user device 104.

(21) FIG. 2 is a block diagram 200 of the data-pearls visualization and querying server 108 according to some embodiments herein. The data-pearls visualization and querying server 108 includes a database 202, a data cluster obtaining module 204, a data cluster partitioning module 206, a data-pearl shape selection module 208, a data-pearl placement module 210, a visualization module 212 and a querying module 214. The database 202 stores data clusters and visualized data-pearls. The data cluster obtaining module 204 receives datasets from the user device 104 associated with the user 102. In some embodiments, the datasets include clusters of the high dimensional data. The data cluster partitioning module 206 extracts at least one data cluster from the high dimensional data using a clustering technique. The data cluster partitioning module 206 sub-divides the at least one data cluster into at least one data-pearl from the high dimensional data using the clustering technique. The at least one data-pearl is a subset of the at least one data cluster. Each data-pearl is not partitioned further and is not overlapped with one another. In some embodiments, the clustering technique may be K-means clustering technique. The data-pearl shape selection module 208 selects a L.sub.p norm shape for each data-pearl. The L.sub.p norm shape is selected by comparing a distance between a centroid of the at least one data-pearl and a farthest point from the centroid of the data-pearl using L.sub.p norm distance measures. The farthest point is computed from the centroid of the data-pearl using the L.sub.p norm distance measures. In some embodiments, the L.sub.p norm shapes may be cube, sphere, etc. In some embodiments, the L.sub.p norm shape is constructed by providing an envelope for the at least one data-pearl using the L.sub.p norm distance measures. In some embodiments, the envelope is defined by using the L.sub.p norm distance measures such that L.sub.p (x,y)=r, x, and y are a set of points on the envelope for a given distance value r, the envelope obtains the L.sub.p norm shape based on the value of p. The data-pearl shape selection module 208 selects the L.sub.p norm shape from a given set of L.sub.p norm shapes as determined by the closed sets formed by points having at most distance using L.sub.p norm distance measures.

(22) The data-pearl placement module 210 configures each data-pearl in the L.sub.p norm shape in a three-dimensional plot using a radius of the L.sub.p norm shape, a sector angle, and elevation angle. In some embodiments, the elevation angle is an angle between the centroid of the at least one data-pearl and a unit vector in dimension with maximum standard deviation. The data-pearl placement module 210 defines an origin of the three-dimensional plot is a centroid of the at least one data cluster and a range of axes of the three-dimensional plot using a distance between a center of each data-pearl, the centroid of the at least one data cluster, and a radius of each data-pearl. In some embodiments, a high-dimensional space is represented as space occupied by the high-dimensional data as sectors in a plane of the three-dimensional plot. The data-pearl placement module 210 plots the at least one data-pearl lying in the high-dimensional space in a corresponding sector of the three-dimensional plot to construct the L.sub.p norm shape.

(23) The visualization module 212 enables the user 102 to visualize at least one data-pearl one of the high dimensional data, using a graphics module on a screen of the user device 104. The querying module 214 enable the user 102 to search the high-dimensional data based on a query provided by the user 102 using at least one dimension, by (i) determining the at least one data-pearl and placing it in a separated manner using domain values of the at least one dimension, (ii) selecting, using a concept search, the at least one data-pearl based on the query provided by the user 102, (iii) incrementing the at least one data-pearl based on a volume of the at least one dataset, the at least one dataset comprises the at least one data-pearl, wherein the at least one data-pearl comprises at least one attribute, (iv) filtering the high-dimensional data based on the at least one data-pearl, (v) selecting data related to the query and performing steps from (i) to (iv) repetitively, and (vi) dimensioning data related to the query through determined classifiers based on filtered data after pruning unrelated data to the query.

(24) FIGS. 3A-3C are exemplary representations that illustrate data visualization and results of concept search on football players dataset according to some embodiments herein. In FIG. 3A, a graphical representation 300A that depicts data dimension feature on the football players dataset with acceleration chosen as data dimension. In some embodiments, the football players dataset includes data one or more footballers, e.g. 1000 to 18,000 football players. In some embodiments, the football players dataset includes attributes of each football player. The attributes of each football player may include a name, an acceleration, an aggression, a balance, a ball control, a composure, a crossing, etc. The data dimension feature is fixed with a number of classifiers such as a Classifier1, a Classifier2, and a Classifier3. In some embodiments, the Classifier1 represents as highly accelerated football players. In some embodiments, the Classifier2 represents as medium accelerated football players. In some embodiments, the Classifier3 represents as low accelerated football players. Each classifier is divided into two data-pearls as shown in the FIG. 3A.

(25) In FIG. 3B, a graphical representation 300B that represents intermediate results after performing attribute filtering by selecting relevant attributes such as acceleration, finishing, heading accuracy, penalties, sprint speed, and volley is provided. The football striker is identified at C and D in the FIG. 3B after attribute filtering. After attribute filtering, the data-pearls other than C and D are removed. By looking at Z co-ordinate values irrelevant data-pearls are removed. By iteratively re-clustering with different data dimension across previously selected data may yield relevant data-pearls. FIG. 3C, a graphical representation 300C that represents final results A and B, which are the relevant data-pearls that are obtained after iteratively re-clustering with different data dimension across previously selected data.

(26) FIG. 4 is a flow diagram that illustrates a method 400 for visualizing a high dimensional data using at least one data-pearl by a user 102 according to some embodiments herein. At a step 402, the method 400 includes extracting, using a clustering technique, at least one data cluster and sub-dividing the at least one data cluster into the at least one data-pearl from the high dimensional data. In some embodiments, the high dimensional data is data in one or more dimensions. At step 404, the method 400 includes selecting a L.sub.p norm shape for each data-pearl by comparing a distance between a centroid of the at least one data-pearl and a farthest point from the centroid of the at least one data-pearl using L.sub.p norm distance measures. At step 406, the method 400 includes configuring each data-pearl in the L.sub.p norm shape in a three-dimensional plot using a radius of the L.sub.p norm shape, a sector angle in the three-dimensional plot, and elevation angle. At step 408, the method 400 includes enabling the user 102 to visualize at least one data-pearl one of the high dimensional data, using a graphics module of a user device associated with the user.

(27) FIG. 5 is a flow diagram that illustrates a method 500 of querying high-dimensional data based on a query using the at least one of data-pearl according to some embodiments herein. At step 502, the method 500 includes determining the at least one data-pearl and placing it in a separated manner using domain values of at least one dimension. At step 504, the method 500 includes selecting, using a concept search, the at least one data-pearl based on the query provided by a user 102. In some embodiments, using the concept of search, the data-pearls visualization and querying server 108 determines a group of datapoints. At step 506, the method 500 includes incrementing the at least one data-pearl based on a volume of the at least one dataset, the at least one dataset includes the at least one data-pearl and the at least one data-pearl includes at least one attribute. At step 508, the method 500 includes filtering the high-dimensional data based on the at least one data-pearl. In some embodiments, the number of classifiers on Z-axis are determined using three-dimensional plot. At step 510, the method 500 includes selecting data related to the query and performing steps from (i) to (iv) repetitively. At step 512, the method 500 includes dimensioning data related to the query through determined classifiers based on filtered data after pruning unrelated data to the query.

(28) FIG. 6 is an interaction diagram that illustrates a method 600 of visualizing high dimensional data using data-pearls, according to some embodiments herein. At step 602, the method 600 includes receiving datasets from the user 102 associated with a user device 104. At step 604, the method 600 includes obtaining the datasets by the data-pearls visualization and querying server 108 through the user device 104. In some embodiments, the datasets include high dimensional data, that is the data in one or more dimensions. At step 606, the method 600 includes extracting at least one data cluster from the high dimensional data and sub-dividing the at least one data cluster into the at least one data-pearl from the high dimensional data. In some embodiments, the at least one data-pearl is a subset of the at least one data cluster. At step 608, the method 600 includes selecting a L.sub.p norm shape for each data-pearl. In some embodiments, the L.sub.p norm shape is selected by comparing a distance between a centroid of the at least one data-pearl and a farthest point from the centroid of the at least one data-pearl using L.sub.p norm distance measures. At step 610, the method 600 includes configuring each data-pearl in the L.sub.p norm shape in a three-dimensional plot. In some embodiments, each data-pearl is configured using a radius of the L.sub.p norm shape, a sector angle in the three-dimensional plot, and elevation angle. At step 612, the method includes enabling the user 102 to visualize at least one data-pearl of the high dimensional data, using a graphics module.

(29) IG. 7 illustrates an exploded view of a data-pearls visualization and querying server 108 of FIG. 1 according to the embodiments herein. The data-pearls visualization and querying server 108 having a memory 702 having a set of computer instructions, a bus 704, a display 706, a speaker 708, and a processor 710 capable of processing a set of instructions to perform any one or more of the methodologies herein, according to an embodiment herein. The processor 710 may also enable digital content to be consumed in the form of a video for output via one or more displays 706 or audio for output via speaker and/or earphones 708. The processor 710 may also carry out the methods described herein and in accordance with the embodiments herein.

(30) The embodiments herein can take the form of, an entirely hardware embodiment, an entire software embodiment or an embodiment including both hardware and software elements. The embodiments that are implemented in software include but are not limited to, firmware, resident software, microcode, etc. Furthermore, the embodiments herein can take the form of a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. For the purposes of this description, a computer-usable or computer-readable medium can be any apparatus that can comprise, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.

(31) The medium can be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. Examples of a computer-readable medium include a semiconductor or solid-state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk-read-only memory (CD-ROM), compact disk-read/write (CD-R/W) and DVD.

(32) A data processing system suitable for storing and/or executing program code will include at least one processor coupled directly or indirectly to memory elements through a system bus. The memory elements can include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution.

(33) Input/output (I/O) devices (including but not limited to keyboards, displays, pointing devices, remote controls, etc.) can be coupled to the system either directly or through intervening I/O controllers. Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modem, and Ethernet cards are just a few of the currently available types of network adapters.

(34) A representative hardware environment for practicing the embodiments herein is depicted in FIG. 8, with reference to FIGS. 1 through 7. This schematic drawing illustrates a hardware configuration of a data-pearls visualization and querying server 108/computer system/computing device in accordance with the embodiments herein. The system includes at least one processing device CPU 10 that may be interconnected via system bus 14 to various devices such as a random access memory (RAM) 12, read-only memory (ROM) 16, and an input/output (I/O) adapter 18. The I/O adapter 18 can connect to peripheral devices, such as disk units 38 and program storage devices 40 that are readable by the system. The system can read the inventive instructions on the program storage devices 40 and follow these instructions to execute the methodology of the embodiments herein. The system further includes a user interface adapter 22 that connects a keyboard 28, mouse 30, speaker 32, microphone 34, and/or other user interface devices such as a touch screen device (not shown) to the bus 14 to gather user input. Additionally, a communication adapter 20 connects the bus 14 to a data processing network 42, and a display adapter 24 connects the bus 14 to a display device 26, which provides a graphical user interface (GUI) 36 of the output data in accordance with the embodiments herein, or which may be embodied as an output device such as a monitor, printer, or transmitter, for example.

(35) The system provides a humanly understandable visualization of high dimensional data. The system helps to understand high dimensional data visually. The system provides visual querying on high dimensional data. For querying, no need of learning any new languages. The system is very easy to use. The system provides the ability to determine data of interest through iterative selection and exploration. The system employs a simple technique that has wider applicability for data visualization. The system analyses clustering techniques based on the selection of a number of clusters and it becomes the visualization is clearer.

(36) The foregoing description of the specific embodiments will so fully reveal the general nature of the embodiments herein that others can, by applying current knowledge, readily modify and/or adapt for various applications such specific embodiments without departing from the generic concept, and, therefore, such adaptations and modifications should and are intended to be comprehended within the meaning and range of equivalents of the disclosed embodiments. It is to be understood that the phraseology or terminology employed herein is for the purpose of description and not of limitation. Therefore, while the embodiments herein have been described in terms of preferred embodiments, those skilled in the art will recognize that the embodiments herein can be practiced with modification within the spirit and scope.