[7968] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[9615] | 3 | * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[7968] | 4 | *
|
---|
| 5 | * This file is part of HeuristicLab.
|
---|
| 6 | *
|
---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
| 8 | * it under the terms of the GNU General Public License as published by
|
---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
| 10 | * (at your option) any later version.
|
---|
| 11 | *
|
---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 15 | * GNU General Public License for more details.
|
---|
| 16 | *
|
---|
| 17 | * You should have received a copy of the GNU General Public License
|
---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 19 | */
|
---|
| 20 | #endregion
|
---|
| 21 |
|
---|
| 22 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Linq;
|
---|
| 25 | using HeuristicLab.DataImporter.Command.View;
|
---|
| 26 | using HeuristicLab.DataImporter.Data;
|
---|
| 27 | using HeuristicLab.DataImporter.Data.CommandBase;
|
---|
| 28 | using HeuristicLab.DataImporter.Data.Model;
|
---|
[16566] | 29 | using HEAL.Attic;
|
---|
[7968] | 30 |
|
---|
| 31 | namespace HeuristicLab.DataImporter.Command {
|
---|
[16566] | 32 | [StorableType("DD29CB5F-0878-4CEC-B8C2-F2E7AA357210")]
|
---|
[7968] | 33 | [ViewableCommandInfoAttribute("Delete Rows beneath Threshold", 1, ColumnGroupState.Active,
|
---|
[8586] | 34 | "Handle Missing Values", Position = 5, OptionsView = typeof(DeleteWithThresholdView))]
|
---|
[7968] | 35 | public class DeleteRowsWithMissingValuesThresholdCommand : ColumnGroupCommandBase, IThresholdCommand {
|
---|
| 36 | private Dictionary<int, IComparable[]> deletedRows;
|
---|
| 37 |
|
---|
| 38 | [Storable]
|
---|
| 39 | private double threshold = 0.8;
|
---|
| 40 | public double Threshold { get { return threshold; } set { threshold = value; } }
|
---|
| 41 |
|
---|
[9614] | 42 | [StorableConstructor]
|
---|
[16567] | 43 | protected DeleteRowsWithMissingValuesThresholdCommand(StorableConstructorFlag _) : base(_) {
|
---|
[7968] | 44 | deletedRows = new Dictionary<int, IComparable[]>();
|
---|
| 45 | }
|
---|
| 46 |
|
---|
| 47 | public DeleteRowsWithMissingValuesThresholdCommand(DataSet dataSet, string columnGroupName)
|
---|
| 48 | : base(dataSet, columnGroupName) {
|
---|
| 49 | deletedRows = new Dictionary<int, IComparable[]>();
|
---|
| 50 | }
|
---|
| 51 |
|
---|
| 52 | public override void Execute() {
|
---|
| 53 | base.Execute();
|
---|
| 54 | IComparable[] row;
|
---|
| 55 |
|
---|
| 56 | double columnsCount = ColumnGroup.Columns.Count();
|
---|
| 57 | for (int rowInd = 0; rowInd < ColumnGroup.RowCount; rowInd++) {
|
---|
| 58 | row = ColumnGroup.GetRow(rowInd);
|
---|
[7994] | 59 | double setValues = ColumnGroup.GetRow(rowInd).Where(x => x != null).Count();
|
---|
| 60 | if (setValues / columnsCount < Threshold) {
|
---|
[7968] | 61 | deletedRows[rowInd] = row;
|
---|
| 62 | }
|
---|
| 63 | }
|
---|
| 64 |
|
---|
| 65 | foreach (int rowInd in deletedRows.Select(x => x.Key).Reverse()) {
|
---|
| 66 | ColumnGroup.DeleteRow(rowInd);
|
---|
| 67 | }
|
---|
| 68 |
|
---|
| 69 | ColumnGroup.FireChanged();
|
---|
| 70 | ColumnGroup = null;
|
---|
| 71 | }
|
---|
| 72 |
|
---|
| 73 | public override void UndoExecute() {
|
---|
| 74 | base.UndoExecute();
|
---|
| 75 | foreach (KeyValuePair<int, IComparable[]> pair in deletedRows) {
|
---|
| 76 | ColumnGroup.InsertRow(pair.Key, pair.Value);
|
---|
| 77 | }
|
---|
| 78 | deletedRows.Clear();
|
---|
| 79 | ColumnGroup.FireChanged();
|
---|
| 80 | ColumnGroup = null;
|
---|
| 81 | }
|
---|
| 82 |
|
---|
| 83 | public override string Description {
|
---|
| 84 | get { return "Delete rows with a missing value percentage beneath a certain threshold"; }
|
---|
| 85 | }
|
---|
| 86 | }
|
---|
| 87 | }
|
---|