123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475 |
- /*
- * Copyright (c) 2009-2010 Chris Smith
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
- package uk.co.md87.android.common;
-
- import java.util.Map;
- import java.util.Map.Entry;
- import java.util.Set;
-
- /**
- * Extracts basic features and applies a K-Nearest Network algorithm to an
- * array of data in order to determine the classification. The data consists
- * of two interleaved data sets, and each set has two features extracted -
- * the range and the mean.
- *
- * @author chris
- */
- public class Classifier {
-
- private final Set<Map.Entry<Float[], String>> model;
-
- public Classifier(final Set<Entry<Float[], String>> model) {
- this.model = model;
- }
-
- public String classify(final float[] data) {
- final float oddTotal = data[5], evenTotal = data[2];
- final float oddMin = data[3], oddMax = data[4];
- final float evenMin = data[0], evenMax = data[1];
-
- final float[] points = {
- Math.abs(evenTotal / 128),
- Math.abs(oddTotal / 128),
- evenMax - evenMin,
- oddMax - oddMin
- };
-
- float bestDistance = Float.MAX_VALUE;
- String bestActivity = "UNCLASSIFIED/UNKNOWN";
-
- for (Map.Entry<Float[], String> entry : model) {
- float distance = 0;
-
- for (int i = 0; i < points.length; i++) {
- distance += Math.pow(points[i] - entry.getKey()[i], 2);
- }
-
- if (distance < bestDistance) {
- bestDistance = distance;
- bestActivity = entry.getValue();
- }
- }
-
- return bestActivity;
- }
- }
|