当前位置:网站首页>numpy.unique
numpy.unique
2022-08-01 23:21:00 【Wanderer001】
numpy.
unique
(ar, return_index=False, return_inverse=False, return_counts=False, axis=None)[source]
Find the unique elements of an array.Returns the sorted unique elements of an array. There are three optional outputs in addition to the unique elements:
the indices of the input array that give the unique values
the indices of the unique array that reconstruct the input array
the number of times each unique value comes up in the input array
Parameters
ararray_like
Input array. Unless axis is specified, this will be flattened if it is not already 1-D.
return_indexbool, optional
If True, also return the indices of ar (along the specified axis, if provided, or in the flattened array) that result in the unique array.
return_inversebool, optional
If True, also return the indices of the unique array (for the specified axis, if provided) that can be used to reconstruct ar.
return_countsbool, optional
If True, also return the number of times each unique item appears in ar.
New in version 1.9.0.
axisint or None, optional
The axis to operate on. If None, ar will be flattened. If an integer, the subarrays indexed by the given axis will be flattened and treated as the elements of a 1-D array with the dimension of the given axis, see the notes for more details. Object arrays or structured arrays that contain objects are not supported if the axis kwarg is used. The default is None.
New in version 1.13.0.
Returns
uniquendarray
The sorted unique values.
unique_indicesndarray, optional
The indices of the first occurrences of the unique values in the original array. Only provided if return_index is True.
unique_inversendarray, optional
The indices to reconstruct the original array from the unique array. Only provided if return_inverse is True.
unique_countsndarray, optional
The number of times each of the unique values comes up in the original array. Only provided if return_counts is True.
New in version 1.9.0.
See also
numpy.lib.arraysetops
Module with a number of other functions for performing set operations on arrays.
Notes
When an axis is specified the subarrays indexed by the axis are sorted. This is done by making the specified axis the first dimension of the array (move the axis to the first dimension to keep the order of the other axes) and then flattening the subarrays in C order. The flattened subarrays are then viewed as a structured type with each element given a label, with the effect that we end up with a 1-D array of structured types that can be treated in the same way as any other 1-D array. The result is that the flattened subarrays are sorted in lexicographic order starting with the first element.
Examples
>>> np.unique([1, 1, 2, 2, 3, 3])
array([1, 2, 3])
>>> a = np.array([[1, 1], [2, 3]])
>>> np.unique(a)
array([1, 2, 3])
Return the unique rows of a 2D array
>>> a = np.array([[1, 0, 0], [1, 0, 0], [2, 3, 4]])
>>> np.unique(a, axis=0)
array([[1, 0, 0], [2, 3, 4]])
Return the indices of the original array that give the unique values:
>>> a = np.array(['a', 'b', 'b', 'c', 'a'])
>>> u, indices = np.unique(a, return_index=True)
>>> u
array(['a', 'b', 'c'], dtype='<U1')
>>> indices
array([0, 1, 3])
>>> a[indices]
array(['a', 'b', 'c'], dtype='<U1')
Reconstruct the input array from the unique values:
>>> a = np.array([1, 2, 6, 4, 2, 3, 2])
>>> u, indices = np.unique(a, return_inverse=True)
>>> u
array([1, 2, 3, 4, 6])
>>> indices
array([0, 1, 4, ..., 1, 2, 1])
>>> u[indices]
array([1, 2, 6, ..., 2, 3, 2])
边栏推荐
- C language - branch statement and loop statement
- 程序员如何优雅地解决线上问题?
- 系统可用性:SRE口中的3个9,4个9...到底是个什么东西?
- 数据分析04
- Interpretation of the paper (GSAT) "Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanism"
- 计算两点之间的中点
- Data Organization --- Chapter 5 Trees and Binary Trees --- The Concept of Binary Trees --- Application Questions
- [LeetCode304周赛] 两道关于基环树的题 6134. 找到离给定两个节点最近的节点,6135. 图中的最长环
- 华为无线设备配置全局双链路冷备份(AC全局配置方式)
- excel clear format
猜你喜欢
解决yolov5训练时出现:“AssertionError: train: No labels in VOCData/dataSet_path/train.cache. Can not train ”
E - Integer Sequence Fair
[LeetCode304 Weekly Competition] Two questions about the base ring tree 6134. Find the closest node to the given two nodes, 6135. The longest cycle in the graph
6134. 找到离给定两个节点最近的节点-力扣双百代码
Codeforces CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) A-D 题解
简单3D渲染器的制作
13、学习MySQL 分组
D - Linear Probing- 并查集
The monthly salary of the test post is 5-9k, how to increase the salary to 25k?
How do programmers solve online problems gracefully?
随机推荐
【C语言进阶】文件操作(二)
【SeaTunnel】从一个数据集成组件演化成企业级的服务
Avoid hidden text when loading fonts
【数据分析03】
中职网络安全竞赛B7比赛部署流程
bat 之 特殊字符&转义
文件查询匹配神器 【glob.js】 实用教程
Always use "noopener" or "noreferrer" for links that open in a new tab
1391D. 505 状压dp
从0到100:招生报名小程序开发笔记
毕业作业
计算两点之间的距离
E - Integer Sequence Fair
[Camp Experience Post] 2022 Cybersecurity Summer Camp
云原生DevOps环境搭建
sys_kill系统调用
华为无线设备配置双链路冷备份(AP指定配置方式)
Special characters & escapes in bat
chrome copies the base64 data of an image
CAKE:一个用于多视图知识图谱补全的可扩展性常识感知框架