Question

我想创建一个算法，但不知道如何开始。

该算法实际上是一个接受N个对象数组的方法，其中包含一些属性createdAt，value。我将数组从旧到新（createdAt）排序，然后我必须找出可用数据的一致性，这意味着，每隔一小时，我至少有5条记录，每半小时有2条记录。< / p>

实施例-testcode：

- (void) normalizeData:(NSArray*)records
{
// sort the records
NSArray* sortedRecords = [records sortWithCreatedAt];

// split all dates in the records, distinct them, and create a dictionary with a key for every date, for value create another dictionary with the hour as key and the records as the value.

NSArray* distinctDates = [sortedRecords valueForKeyPath:@"@distinctUnionOfObjects.createdAt"]; // should only consider month-day-year-hour
NSMutableDictionary* dictionary = [NSMutableDictionary dictionary];
for (NSDate* date in distinctDates)
    {
    NSString* stringDate = [date string]; 
    NSArray* recordsForDate = [sortedRecords valueForKeyPath:[NSString stringWithFormat:@"[collect].{createdAt=%@}.self", stringDate]]; // let's say you got them with this line
    [dictionary setObject:recordsForDate forKey:date];
    }

for (NSDate* keyDate in dictionary)
   {
   NSArray* records = [dictionary objectForKey:keyDate];
   Record* previousRecord = nil;
   for (Records* record in records)
      {
      // I'll have to keep the previous record and compare the time difference with the new
      NSInteger secondsAfterDate = 0;
      if (previousRecord)
         {
         secondsAfterDate = [record.createdAt timeIntervalSinceDate:previousRecord.createdAt];
         // add logic to create trend difference in a model that has for every hour of the records count, the records and suffice description
         // logic if the records count and timespan is suffice.

         }
      previousRecord = record;
      }
   }
}

我将不胜感激该方法对该过程的任何贡献。

最终目标是为处理的记录的每个结果创建一个返回（调用块处理程序）。逻辑应该以每小时至少5条记录和15分钟之间的时间间隔结束。

Answer 1

记录记录收集的总时间长度（第一条记录的createdAt和最后一条记录的createdAt之间的差异）并将其离散化为分类。将每个对象放在适当的bin中。然后使用具有两种窗口尺寸（30分钟和60分钟）的滑动窗口。当您沿着阵列走时，不断评估您描述的条件是否得到满足。

请注意，对于上述方法，将bin宽度正确定义为时间戳过程的分辨率非常重要。由于您未在帖子中注明，如果这是一个问题，请随时发表评论。

及时准确的连续数据算法

1 个答案: