-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #787 from mrapp-ke/create-ordinal-feature-vector
Erzeugen eines OrdinalFeatureVector
- Loading branch information
Showing
7 changed files
with
679 additions
and
184 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
126 changes: 126 additions & 0 deletions
126
cpp/subprojects/common/src/mlrl/common/input/feature_type_nominal_common.hpp
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,126 @@ | ||
| /* | ||
| * @author Michael Rapp ([email protected]) | ||
| */ | ||
| #pragma once | ||
|
|
||
| #include "mlrl/common/data/tuple.hpp" | ||
| #include "mlrl/common/input/feature_vector_binary.hpp" | ||
| #include "mlrl/common/input/feature_vector_equal.hpp" | ||
|
|
||
| #include <unordered_map> | ||
|
|
||
| template<typename ValueIterator> | ||
| static inline uint32 createMapping(ValueIterator valueIterator, uint32 numElements, | ||
| std::unordered_map<int32, Tuple<uint32>>& mapping) { | ||
| uint32 numExamples = 0; | ||
| uint32 numValues = 0; | ||
|
|
||
| for (uint32 i = 0; i < numElements; i++) { | ||
| float32 value = valueIterator[i]; | ||
|
|
||
| if (!std::isnan(value)) { | ||
| int32 nominalValue = (int32) value; | ||
| auto it = mapping.emplace(nominalValue, Tuple<uint32> {numValues, 1}); | ||
|
|
||
| if (it.second) { | ||
| numValues++; | ||
| } else { | ||
| auto& entry = *(it.first); | ||
| Tuple<uint32>& tuple = entry.second; | ||
| tuple.second++; | ||
| } | ||
|
|
||
| numExamples++; | ||
| } | ||
| } | ||
|
|
||
| return numExamples; | ||
| } | ||
|
|
||
| static inline int32 getMajorityValue(const std::unordered_map<int32, Tuple<uint32>>& mapping) { | ||
| auto it = mapping.cbegin(); | ||
| auto& firstEntry = *it; | ||
| int32 majorityValue = firstEntry.first; | ||
| uint32 majorityValueFrequency = firstEntry.second.second; | ||
|
|
||
| for (; it != mapping.cend(); it++) { | ||
| auto& entry = *it; | ||
| uint32 frequency = entry.second.second; | ||
|
|
||
| if (frequency > majorityValueFrequency) { | ||
| majorityValue = entry.first; | ||
| majorityValueFrequency = frequency; | ||
| } | ||
| } | ||
|
|
||
| return majorityValue; | ||
| } | ||
|
|
||
| static inline Tuple<int32> getMinorityAndMajorityValue(const std::unordered_map<int32, Tuple<uint32>>& mapping) { | ||
| auto it = mapping.cbegin(); | ||
| auto& firstEntry = *it; | ||
| int firstFrequency = firstEntry.second.second; | ||
| it++; | ||
| auto& secondEntry = *it; | ||
| int secondFrequency = secondEntry.second.second; | ||
| Tuple<int32> tuple; | ||
|
|
||
| if (firstFrequency > secondFrequency) { | ||
| tuple.first = secondEntry.first; | ||
| tuple.second = firstEntry.first; | ||
| } else { | ||
| tuple.first = firstEntry.first; | ||
| tuple.second = secondEntry.first; | ||
| } | ||
|
|
||
| return tuple; | ||
| } | ||
|
|
||
| template<typename IndexIterator, typename ValueIterator> | ||
| static inline std::unique_ptr<BinaryFeatureVector> createBinaryFeatureVector( | ||
| IndexIterator indexIterator, ValueIterator valueIterator, uint32 numElements, | ||
| const std::unordered_map<int32, Tuple<uint32>>& mapping, int32 minorityValue, int32 majorityValue) { | ||
| const Tuple<uint32>& tuple = mapping.at(minorityValue); | ||
| uint32 numMinorityExamples = tuple.second; | ||
| std::unique_ptr<BinaryFeatureVector> featureVectorPtr = | ||
| std::make_unique<BinaryFeatureVector>(numMinorityExamples, minorityValue, majorityValue); | ||
| BinaryFeatureVector::index_iterator vectorIndexIterator = featureVectorPtr->indices_begin(0); | ||
| uint32 n = 0; | ||
|
|
||
| for (uint32 i = 0; i < numElements; i++) { | ||
| uint32 index = indexIterator[i]; | ||
| float32 value = valueIterator[i]; | ||
|
|
||
| if (std::isnan(value)) { | ||
| featureVectorPtr->setMissing(index, true); | ||
| } else { | ||
| int32 nominalValue = (int32) value; | ||
|
|
||
| if (nominalValue == minorityValue) { | ||
| vectorIndexIterator[n] = index; | ||
| n++; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| return featureVectorPtr; | ||
| } | ||
|
|
||
| template<typename IndexIterator, typename ValueIterator> | ||
| static inline std::unique_ptr<BinaryFeatureVector> createBinaryFeatureVector( | ||
| IndexIterator indexIterator, ValueIterator valueIterator, uint32 numElements, | ||
| std::unordered_map<int32, Tuple<uint32>>& mapping, bool sparse) { | ||
| int32 minorityValue; | ||
| int32 majorityValue; | ||
|
|
||
| if (sparse) { | ||
| minorityValue = (*mapping.cbegin()).first; | ||
| majorityValue = 0; | ||
| } else { | ||
| const Tuple<int32> tuple = getMinorityAndMajorityValue(mapping); | ||
| minorityValue = tuple.first; | ||
| majorityValue = tuple.second; | ||
| } | ||
|
|
||
| return createBinaryFeatureVector(indexIterator, valueIterator, numElements, mapping, minorityValue, majorityValue); | ||
| } |
Oops, something went wrong.