|
MADlib
1.0 A newer version is available
User Documentation
|
|
MADlib
1.0 A newer version is available
User Documentation
|
Collaboration diagram for Sparse Vectors:This module implements a sparse vector data type named "svec", which gives compressed storage of sparse vectors with many duplicate elements.
When we use arrays of floating point numbers for various calculations, we will sometimes have long runs of zeros (or some other default value). This is common in applications like scientific computing, retail optimization, and text processing. Each floating point number takes 8 bytes of storage in memory and/or disk, so saving those zeros is often worthwhile. There are also many computations that can benefit from skipping over the zeros.
To focus the discussion, consider, for example, the following array of doubles stored as a Postgres/GP "float8[]" data type:
This array would occupy slightly more than 320KB of memory/disk, most of it zeros. Even if we were to exploit the null bitmap and store the zeros as nulls, we would still end up with a 5KB null bitmap, which is still not nearly as memory efficient as we'd like. Also, as we perform various operations on the array, we'll often be doing work on 40,000 fields that would turn out not to be important. To solve the problems associated with the processing of sparse vectors discussed above, we adopt a simple Run Length Encoding (RLE) scheme to represent sparse vectors as pairs of count-value arrays. So, for example, the array above would be represented as follows
which says there is 1 occurrence of 0, followed by 1 occurrence of 33, followed by 40,000 occurrences of 0, etc. In contrast to the naive representations, we only need 5 integers and 5 floating point numbers to store the array. Further, it is easy to implement vector operations that can take advantage of the RLE representation to make computations faster. The module provides a library of such functions. The current version only supports sparse vectors of float8 values. Future versions will support other base types.
SVEC's can be constructed directly as follows:
<pre>
SELECT '{n1,n2,...,nk}:{v1,v2,...vk}'::MADlib.svec;
</pre>
WHERE <tt>n1,n2,...,nk</tt> specifies the counts for the values <tt>v1,v2,...,vk</tt>.
Or, SVEC's can also be casted from a float array:
<pre>
SELECT ('{v1,v2,...vk}'::float[])::MADlib.svec;
</pre>
Syntax reference can be found in svec.sql_in.
Users need to add MADlib to their search_path to use the svec operators
defined in the module.
We can use operations with svec type like <, >, *, **, /, =, +, SUM, etc, and they have meanings associated with typical vector operations. For example, the plus (+) operator adds each of the terms of two vectors having the same dimension together.
Without the casting into float8[] at the end, we get:
A dot product (%*%) between the two vectors will result in a scalar result of type float8. The dot product should be (0*4 + 1*3 + 5*2) = 13, like this:
Special vector aggregate functions are also available. SUM is self
explanatory. SVEC_COUNT_NONZERO evaluates the count of non-zero terms
in each column found in a set of n-dimensional svecs and returns an
svec with the counts. For instance, if we have the vectors {0,1,5},
{10,0,3},{0,0,3},{0,1,0}, then executing the SVEC_COUNT_NONZERO() aggregate
function would result in {1,2,3}:
We do not use null bitmaps in the svec data type. A null value in an svec is represented explicitly as an NVP (No Value Present) value. For example, we have:
An element of an svec can be accessed using the svec_proj() function, which takes an svec and the index of the element desired.
A subvector of an svec can be accessed using the svec_subvec() function, which takes an svec and the start and end index of the subvector desired.
The elements/subvector of an svec can be changed using the function svec_change(). It takes three arguments: an m-dimensional svec sv1, a start index j, and an n-dimensional svec sv2 such that j + n - 1 <= m, and returns an svec like sv1 but with the subvector sv1[j:j+n-1] replaced by sv2. An example follows:
There are also higher-order functions for processing svecs. For example, the following is the corresponding function for lapply() in R.
The full list of functions available for operating on svecs are available in svec.sql.
A More Extensive Example
For a text classification example, let's assume we have a dictionary composed of words in a sorted text array:
We have a set of documents, each represented as an array of words:
Now we have a dictionary and some documents, we would like to do some document categorization using vector arithmetic on word counts and proportions of dictionary words in each document. To start this process, we'll need to find the dictionary words in each document. We'll prepare what is called a Sparse Feature Vector or SFV for each document. An SFV is a vector of dimension N, where N is the number of dictionary words, and in each cell of an SFV is a count of each dictionary word in the document. Inside the sparse vector library, we have a function that will create an SFV from a document, so we can just do this:
Note that the output of MADlib.svec_sfv() is an svec for each document containing the count of each of the dictionary words in the ordinal positions of the dictionary. This can more easily be understood by lining up the feature vector and text like this:
Now when we look at the document "i am the second document in the corpus",
its SFV is {1,3*0,1,1,1,1,6*0,1,2}. The word "am" is the first ordinate in
the dictionary and there is 1 instance of it in the SFV. The word "before"
has no instances in the document, so its value is "0" and so on.
The function MADlib.svec_sfv() can process large
numbers of documents into their SFVs in parallel at high speed.
The rest of the categorization process is all vector math. The actual
count is hardly ever used. Instead, it's turned into a weight. The most
common weight is called tf/idf for Term Frequency / Inverse Document
Frequency. The calculation for a given term in a given document is
For instance, the term "document" in document A would have weight 1 * log (4/3). In document D, it would have weight 2 * log (4/3). Terms that appear in every document would have tf/idf weight 0, since log (4/4) = log(1) = 0. (Our example has no term like that.) That usually sends a lot of values to 0.
For this part of the processing, we'll need to have a sparse vector of the dictionary dimension (19) with the values
There will be one such vector for the whole list of documents (aka the "corpus"). The #documents is just a count of all of the documents, in this case 4, but there is one divisor for each dictionary word and its value is the count of all the times that word appears in the document. This single vector for the whole corpus can then be scalar product multiplied by each document SFV to produce the Term Frequency/Inverse Document Frequency weights.
This can be done as follows:
We can now get the "angular distance" between one document and the rest of the documents using the ACOS of the dot product of the document vectors: The following calculates the angular distance between the first document and each of the other documents:
We can see that the angular distance between document 1 and itself is 0 degrees and between document 1 and 3 is 90 degrees because they share no features at all. The angular distance can now be plugged into machine learning algorithms that rely on a distance measure between data points.
SVEC also provides functionality for declaring array given and array of positions and array of values, intermediate values betweens those are declared to be base value that user provides in the same function call. In the example below the fist array of integers represents the positions for the array two (array of floats). Positions do not need to come in the sorted order. Third value represents desired maximum size of the array. This assures that array is of that size even if last position is not. If max size < 1 that value is ignored and array will end at the last position in the position vector. Final value is a float representing the base value to be used between the declared ones (0 would be a common candidate):
Other examples of svecs usage can be found in the k-means module.
1.8.4