|
pulsatrix 1.1.0
|
How unevenly points appear in each other's neighbor lists. More...
#include <nearest_neighbors.hpp>
Public Attributes | |
| std::vector< int64_t > | occurrences |
| How many neighbor lists each point appears in (its "k-occurrence"). The mean is k. | |
| double | skewness = 0 |
| The skewness of occurrences. Near 0 when points appear about equally often; well above 1 means a few hubs dominate (Radovanović et al., JMLR 2010). | |
| int64_t | max_occurrence = 0 |
| The most lists any one point is in, and its fraction of all queries. | |
| double | max_fraction = 0 |
| double | never_a_neighbor = 0 |
| The fraction of points in nobody's list. | |
How unevenly points appear in each other's neighbor lists.
| double pulsatrix::Hubness::max_fraction = 0 |
| int64_t pulsatrix::Hubness::max_occurrence = 0 |
The most lists any one point is in, and its fraction of all queries.
| double pulsatrix::Hubness::never_a_neighbor = 0 |
The fraction of points in nobody's list.
| std::vector<int64_t> pulsatrix::Hubness::occurrences |
How many neighbor lists each point appears in (its "k-occurrence"). The mean is k.
| double pulsatrix::Hubness::skewness = 0 |
The skewness of occurrences. Near 0 when points appear about equally often; well above 1 means a few hubs dominate (Radovanović et al., JMLR 2010).