pacmap
pypi i pacmap

0.6.5 (see all)
pypi i pacmap

# PaCMAP

Our work has been published at the Journal of Machine Learning Research(JMLR)!

PaCMAP (Pairwise Controlled Manifold Approximation) is a dimensionality reduction method that can be used for visualization, preserving both local and global structure of the data in original space. PaCMAP optimizes the low dimensional embedding using three kinds of pairs of points: neighbor pairs (pair_neighbors), mid-near pair (pair_MN), and further pairs (pair_FP).

Previous dimensionality reduction techniques focus on either local structure (e.g. t-SNE, LargeVis and UMAP) or global structure (e.g. TriMAP), but not both, although with carefully tuning the parameter in their algorithms that controls the balance between global and local structure, which mainly adjusts the number of considered neighbors. Instead of considering more neighbors to attract for preserving glocal structure, PaCMAP dynamically uses a special group of pairs -- mid-near pairs, to first capture global structure and then refine local structure, which both preserve global and local structure. For a thorough background and discussion on this work, please read our paper.

# Release Notes

• 0.6.0 Now officially supports the `transform` feature. The transform operation is useful for projecting a new dataset into an existing embedded space.

• 0.5.0

Now support setting `random_state` when creating `pacmap.PaCMAP` instances for better reproducibility.

Fix the default initialization to `PCA` to resolve inconsistency between code and description.

Setting the `random_state` will affect the numpy random seed in your local environment. However, you may still get different results even if the `random_state` parameter is set to be the same. This is because numba parallelization makes some of the functions undeterministic. That being said, fixing the random state will always give you the same set of pairs and initialization, which ensure the difference is minimal.

• 0.4.1

Now the default value for `n_neighbors` is 10. To enable automatic parameter selection, please set it to `None`.

• 0.4

Now supports user-specified nearest neighbor pairs. See section `How to use user-specified nearest neighbor` below.

The `fit` function and the `fit_transform` function now has an extra parameter `save_pairs` that decides whether the pairs sampled in this run will be saved to save time for reproducing experiments with other hyperparameters (default to `True`).

• 0.3

Now supports user-specified matrix as initialization through `init` parameter. The matrix must be an numpy ndarray with the shape (N, 2).

• 0.2

Adding adaptive default value for `n_neighbors`: for large datasets with sample size N > 10000, the default value will be set to 10 + 15 * (log10(N) - 4), rounding to the nearest integer.

• 0.1

Initial Release

# Installation

You would require the following packages to fully use pacmap on your machine:

• numpy
• sklearn
• annoy
• numba

You can use pip to install pacmap from PyPI. It will automatically install the dependencies for you:

``````pip install pacmap
``````

# Usage

The `pacmap` package is designed to be compatible with `scikit-learn`, meaning that it has a similar interface with functions in the `sklearn.manifold` module. To run `pacmap` on your own dataset, you should install the package following the instructions in installation, and then import the module. The following code clip includes a use case about how to use PaCMAP on the COIL-20 dataset:

``````import pacmap
import numpy as np
import matplotlib.pyplot as plt

# you can change it with any dataset that is in the ndarray format, with the shape (N, D)
# where N is the number of samples and D is the dimension of each sample
X = X.reshape(X.shape, -1)

# initializing the pacmap instance
# Setting n_neighbors to "None" leads to a default choice shown below in "parameter" section
embedding = pacmap.PaCMAP(n_dims=2, n_neighbors=None, MN_ratio=0.5, FP_ratio=2.0)

# fit the data (The index of transformed data corresponds to the index of the original data)
X_transformed = embedding.fit_transform(X, init="pca")

# visualize the embedding
fig, ax = plt.subplots(1, 1, figsize=(6, 6))
ax.scatter(X_transformed[:, 0], X_transformed[:, 1], cmap="Spectral", c=y, s=0.6)
``````

# Benchmarks

The following images are visualizations of two datasets: MNIST (n=70,000, d=784) and Mammoth (n=10,000, d=3), generated by PaCMAP. The two visualizations demonstrate the local and global structure's preservation ability of PaCMAP respectively. # Parameters

The list of the most important parameters is given below. Changing these values will affect the result of dimension reduction significantly, as specified in section 8.3 in our paper.

• `n_dims`: the number of dimension of the output. Default to 2.

• `n_neighbors`: the number of neighbors considered in the k-Nearest Neighbor graph. Default to 10 for dataset whose sample size is smaller than 10000. For large dataset whose sample size (n) is larger than 10000, the default value is: 10 + 15 * (log10(n) - 4).

• `MN_ratio`: the ratio of the number of mid-near pairs to the number of neighbors, `n_MN` = `n_neighbors * MN_ratio` . Default to 0.5.

• `FP_ratio`: the ratio of the number of further pairs to the number of neighbors, `n_FP` = `n_neighbors * FP_ratio` Default to 2.

The initialization is also important to the result, but it's a parameter of the `fit` and `fit_transform` function.

• `init`: the initialization of the lower dimensional embedding. One of `"pca"` or `"random"`, or a user-provided numpy ndarray with the shape (N, 2). Default to `"random"`.

Other parameters include:

• `num_iters`: number of iterations. Default to 450. 450 iterations is enough for most dataset to converge.
• `pair_neighbors`, `pair_MN` and `pair_FP`: pre-specified neighbor pairs, mid-near points, and further pairs. Allows user to use their own graphs. Default to `None`.
• `verbose`: print the progress of pacmap. Default to `False`
• `lr`: learning rate of the AdaGrad optimizer. Default to 1.
• `apply_pca`: whether pacmap should apply PCA to the data before constructing the k-Nearest Neighbor graph. Using PCA to preprocess the data can largely accelerate the DR process without losing too much accuracy. Notice that this option does not affect the initialization of the optimization process.
• `intermediate`: whether pacmap should also output the intermediate stages of the optimization process of the lower dimension embedding. If `True`, then the output will be a numpy array of the size (n, `n_dims`, 13), where each slice is a "screenshot" of the output embedding at a particular number of steps, from [0, 10, 30, 60, 100, 120, 140, 170, 200, 250, 300, 350, 450].

# Methods

Similar to the scikit-learn API, the PaCMAP instance can generate embedding for a dataset via the `fit_transform` method. We currently support numpy.ndarray format as our input. Specifically, to convert pandas DataFrame to ndarray format, please refer to the pandas documentation. For a more detailed walkthrough, please see the demo.py file.

# How to use user-specified nearest neighbor

In version 0.4, we have provided a new option to allow users to use their own nearest neighbors when mapping large-scale datasets. The following code clip includes a use case about how to use PaCMAP with the user-specified nearest neighbors:

``````import pacmap
import numpy as np
import matplotlib.pyplot as plt
from annoy import AnnoyIndex

X = X.reshape(X.shape, -1)

# create nearest neighbor pairs
# here we use AnnoyIndex as an example, but the process can be done by any
# external NN library that provides neighbors into a matrix of the shape
# (n, n_neighbors_extra), where n_neighbors_extra is greater or equal to
# n_neighbors in the following example.

n, dim = X.shape
n_neighbors = 10
tree = AnnoyIndex(dim, metric='euclidean')
for i in range(n):
tree.build(20)

nbrs = np.zeros((n, 20), dtype=np.int32)
for i in range(n):
nbrs_ = tree.get_nns_by_item(i, 20 + 1) # The first nbr is always the point itself
nbrs[i, :] = nbrs_[1:]

scaled_dist = np.ones((n, n_neighbors)) # No scaling is needed

# Type casting is needed for numba acceleration
X = X.astype(np.float32)
scaled_dist = scaled_dist.astype(np.float32)

# make sure n_neighbors is the same number you want when fitting the data
pair_neighbors = pacmap.sample_neighbors_pair(X, scaled_dist, nbrs, np.int32(n_neighbors))

# initializing the pacmap instance
# feed the pair_neighbors into the instance
embedding = pacmap.PaCMAP(n_dims=2, n_neighbors=n_neighbors, MN_ratio=0.5, FP_ratio=2.0, pair_neighbors=pair_neighbors)

# fit the data (The index of transformed data corresponds to the index of the original data)
X_transformed = embedding.fit_transform(X, init="pca")

# visualize the embedding
fig, ax = plt.subplots(1, 1, figsize=(6, 6))
ax.scatter(X_transformed[:, 0], X_transformed[:, 1], cmap="Spectral", c=y, s=0.6)
``````

# Reproducing the experiments

We have provided the code we use to run experiment for better reproducibility. The code are separated into three parts, in three folders, respectively:

• `data`, which includes all the datasets we used, preprocessed into the file format each DR method use. Notice that since the Mouse single cell RNA sequence dataset is too big (~4GB), you may need to download from the link here. MNIST and FMNIST dataset is compressed, and you need to unzip them before using. COIL-100 dataset is still too large after compressed, please preprocess it using the file Preprocessing.ipynb on your own.
• `experiments`, which includes all the scripts we use to produce DR results.
• `evaluation`, which includes all the scripts we use to evaluate DR results, stated in Section 8 in our paper.

After downloading the code, you may need to specify some of the paths in the script to make them fully functional.

# Citation

If you use PaCMAP in your publication, or you used the implementation in this repository, please cite our paper using the following bibtex:

``````@article{JMLR:v22:20-1061,
author  = {Yingfan Wang and Haiyang Huang and Cynthia Rudin and Yaron Shaposhnik},
title   = {Understanding How Dimension Reduction Tools Work: An Empirical Approach to Deciphering t-SNE, UMAP, TriMap, and PaCMAP for Data Visualization},
journal = {Journal of Machine Learning Research},
year    = {2021},
volume  = {22},
number  = {201},
pages   = {1-73},
url     = {http://jmlr.org/papers/v22/20-1061.html}
}
``````

181

4mos ago

1

8

9

### OPEN PRs

0
VersionTagPublished
0.6.5
1mo ago
0.6.4
1mo ago
0.6.3
4mos ago
0.6.2
4mos ago
{"ft_lang_label":"__label__en","ft_lang_prob":0.7877654,"math_prob":0.90494,"size":10418,"snap":"2022-27-2022-33","text_gpt3_token_len":2515,"char_repetition_ratio":0.118974455,"word_repetition_ratio":0.0930529,"special_character_ratio":0.24102515,"punctuation_ratio":0.15879397,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9778516,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-08-11T17:47:25Z\",\"WARC-Record-ID\":\"<urn:uuid:5cb2c5e8-58c5-4b8a-a195-581808bbafcb>\",\"Content-Length\":\"264439\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9400abf6-9732-4284-89a0-828d7144f129>\",\"WARC-Concurrent-To\":\"<urn:uuid:fdaff9a4-4622-43b8-a1a3-533d50f23bd7>\",\"WARC-IP-Address\":\"76.76.21.22\",\"WARC-Target-URI\":\"https://openbase.com/python/pacmap\",\"WARC-Payload-Digest\":\"sha1:TANSLZAXSNCHC4A6HDF5WVX62OPTT63Y\",\"WARC-Block-Digest\":\"sha1:SNO7FQEQ3VGKNHEJCHFSLDL7QFSB7RJ4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-33/CC-MAIN-2022-33_segments_1659882571483.70_warc_CC-MAIN-20220811164257-20220811194257-00076.warc.gz\"}"}