-
-
Notifications
You must be signed in to change notification settings - Fork 7
Expand file tree
/
Copy pathdata_aggregation.R
More file actions
645 lines (535 loc) · 22.8 KB
/
data_aggregation.R
File metadata and controls
645 lines (535 loc) · 22.8 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
## - | FILE HEADER |
##
## Script name:
## data_aggregation.R
##
## Purpose of script:
## Implement four classification algorithms used to aggregate
## high frequency data into daily data.
##
## Author:
## Montasser Ghachem
##
## Last updated:
## 2025-12-06
##
## License:
## GPL 3
##
## Email:
## montasser.ghachem@pinstimation.com
##
##
##
## Public functions:
## ++++++++++++++++++
##
## classify_trades():
## Classifies high-frequency trading data using different trade
## classification algorithms, and time lags.
##
## aggregate_trades():
## Aggregates high-frequency trading data into aggregated
## data at the provided frequency using different trade
## classification algorithms.
##
## ++++++++++++++++++
##
##
## --
## Package: PINstimation
## website: www.pinstimation.com
## Authors: Montasser Ghachem and Oguz Ersan
## +++++++++++++++++++++++++
## ++++++| | PUBLIC FUNCTIONS | |
## +++++++++++++++++++++++++
#' @title Classification and aggregation of high-frequency data
#'
#' @description `classify_trades()` classifies high-frequency trading data into
#' buyer-initiated and seller-initiated trades using different algorithms, and
#' different time lags (or leads).
#' \cr `aggregate_trades()` aggregates high-frequency trading data into
#' aggregated data for provided frequency of aggregation. The aggregation is
#' preceded by a trade classification step which classifies trades using
#' different trade classification algorithms and time lags (or leads).
#'
#' @param data A dataframe with 4 variables in the following
#' order (`timestamp`, `price`, `bid`, `ask`).
#' @param algorithm A character string refers to the algorithm used
#' to determine the trade initiator, a buyer or a seller. It takes one of four
#' values (`"Tick"`, `"Quote"`, `"LR"`, `"EMO"`). The default value is
#' `"Tick"`. For more information about the different algorithms, check the
#' Details section.
#'
#' @param timelag Numeric scalar. Time offset in microseconds used to select
#' the quote matched to each trade for the \code{"Quote"}, \code{"EMO"} and
#' \code{"LR"} algorithms. Interpreted in seconds as \code{timelag / 1e6}.
#' See **Time lags vs. leads** in \code{@details} for the exact matching rule
#' and edge cases (start/end of sample).
#'
#' Examples: \code{timelag = 5000} is a 5-millisecond lag;
#' \code{timelag = -500000} is a 0.5-second lead.
#'
#' @param frequency The frequency used to aggregate intraday data. It takes one
#' of the following values: `"sec"`, `"min"`, `"hour"`, `"day"`, `"week"`,
#' `"month"`. The default value is `"day"`.
#'
#' @param unit An integer referring to the size of the aggregation window
#' used to aggregate intraday data. The default value is `1`. For example, when
#' the parameter `frequency` is set to `"min"`, and the parameter `unit` is set
#' to 15, then the intraday data is aggregated every 15 minutes.
#'
#' @param ... Additional arguments passed to the functions `classify_trades()`
#' `aggregate_trades()`. The recognized arguments are `fullreport`,
#' and `is_parallel`. Other arguments will be ignored.
#' \itemize{
#' \item `fullreport` is binary variable passed to `aggregate_trades()` that
#' specifies whether the variable `freq` is returned. The default value is
#' \code{FALSE}.
#' \item `is_parallel` is a logical variable passed to `classify_trades()` that
#' specifies whether the computation is performed using parallel or sequential
#' processing. #' The default value is `TRUE`. For more details, please refer to
#' the vignette 'Parallel processing' in the package, or
#' \href{https://pinstimation.com/articles/parallel_processing.html}{online}.
#' }
#' @param verbose A binary variable that determines whether detailed
#' information about the progress of the trade classification is displayed.
#' No output is produced when \code{verbose} is set to \code{FALSE}. The default
#' value is \code{TRUE}.
#'
#' @details
#'
#' **Trade classification algorithms**
#'
#' The argument `algorithm` takes one of four values:
#' \itemize{
#' \item \code{"Tick"} refers to the tick algorithm: Trade is classified as a
#' buy (sell) if the price of the trade to be classified
#' is above (below) the closest different price of a previous trade.
#' \item \code{"Quote"} refers to the quote algorithm: it classifies a
#' trade as a buy (sell) if the trade price of the trade to be
#' classified is above (below) the mid-point of the bid and ask spread.
#' Trades executed at the mid-spread are not classified.
#' \item \code{"LR"} refers to `LR` algorithm as in
#' \insertCite{LeeReady1991;textual}{PINstimation}. It classifies a trade
#' as a buy (sell) if its price is above (below) the mid-spread (quote
#' algorithm), and uses the tick algorithm if the trade price is at
#' the mid-spread.
#' \item \code{"EMO"} refers to `EMO` algorithm as in
#' \insertCite{Ellis2000;textual}{PINstimation}.
#' It classifies trades at the bid (ask) as sells (buys) and uses the tick
#' algorithm to classify trades within the then prevailing bid-ask spread.
#' }
#'
#' **Time lags vs. leads (`timelag`)**
#'
#' For the `"Quote"`, `"LR"` and `"EMO"` algorithms, classification relies on a
#' quote (bid, ask or midquote) matched to each trade. The argument `timelag`
#' controls *when* that quote is taken relative to the trade time:
#'
#' \itemize{
#' \item *Positive lags* (`timelag > 0`): for a trade at time `t`, the
#' algorithm uses the quote corresponding to the last trade observed
#' at or before `t - |timelag|` seconds. If no such past trade exists,
#' the trade has no matched quote.
#'
#' \item *Zero lag* (`timelag = 0`): for a trade at time `t`, the algorithm
#' uses the quote attached to that trade itself, which in the data setup
#' corresponds to the bid–ask spread just before the trade is executed.
#'
#' \item *Negative lags / leads* (`timelag < 0`): for a trade at time `t`,
#' the algorithm uses the quote corresponding to the last trade observed
#' at or before `t + |timelag|` seconds (a future quote). If no such future
#' trade exists, the trade has no matched quote.
#' }
#'
#' In all cases the time offset is interpreted in seconds as \code{timelag/1e6}.
#'
#' For example, `timelag = 500000` corresponds to 0.5
#' seconds lag, and `timelag = -2000000` corresponds to a 2-second lead.
#'
#' Trades for which no suitable lagged/leading quote exists within the requested
#' window are handled as follows:
#' \itemize{
#' \item For `"Quote"`, the corresponding trades receive `NA` classifications.
#' \item For `"LR"`, the quote-based classification is still used where
#' available; trades exactly at the (lagged/leading) midquote fall back to
#' the tick rule. When no midquote exists within the window, the result is
#' `NA`.
#' \item For `"EMO"`, the bid/ask from the lagged/leading quote is used when
#' available. If no such quote exists, the EMO quote-based step is skipped
#' and the tick rule classification is retained.
#' }
#'
#'
#' `LR` recommend the use of mid-spread five-seconds earlier ('5-second'
#' rule) mitigating trade misclassifications for many of the \code{150}
#' NYSE stocks they analyze. On the other hand, in more recent studies such
#' as \insertCite{piwowar2006;textual}{PINstimation} and
#' \insertCite{Aktas2014;textual}{PINstimation}, the use of
#' 1-second lagged midquotes are shown to yield lower rates of
#' misclassifications. The default value is set to `0` seconds (no time-lag).
#' Considering the ultra-fast nature of today's financial markets, time-lag
#' is in the unit of milliseconds. Shorter than 1-second lags can also be
#' implemented by entering values such as `100` or `500`.
#'
#' @return
#' The function classify_trades() returns a dataframe of five variables. The
#' first four variables are obtained from the argument `data`: `timestamp`,
#' `price`, `bid`, `ask`. The fifth variable is `isbuy`, which takes the value
#' `TRUE`, when the trade is classified as a buyer-initiated trade, and `FALSE`
#' when the trade is classified as a seller-initiated trade.
#'
#' The function aggregate_trades() returns a dataframe of two
#' (or three) variables. If \code{fullreport} is set to \code{TRUE}, then
#' the returned dataframe has three variables `{freq, b, s}`. If
#' \code{fullreport} is set to \code{FALSE}, then the returned dataframe has
#' two variables `{b, s}`, and, therefore, can be #'directly used for the
#' estimation of the `PIN` and `MPIN` models.
#'
#' @references
#'
#' \insertAllCited
#'
#' @examples
#' # There is a preloaded dataset called 'hfdata' contained in the package.
#' # It is an artificially created high-frequency trading data. The dataset
#' # contains 100 000 trades and five variables 'timestamp', 'price',
#' # 'volume', 'bid', and 'ask'. For more information, type ?hfdata.
#'
#' xdata <- hfdata
#' xdata$volume <- NULL
#' \donttest{
#' # Use the LR algorithm with a timelag of 0.5 seconds i.e. 500000
#' # microseconds to classify high-frequency trades in the dataset 'xdata'
#'
#' lgtrades <- classify_trades(xdata, "LR", timelag = 500000, verbose = FALSE)
#'
#' # LR algorithm with a 0.5-second lead (-500000 microseconds)
#'
#' ldtrades <- classify_trades(xdata, "LR", timelag = -500000, verbose = FALSE)
#'
#' # Compare the number of buyer- and seller-initiated trades between the
#' # lagged and leading LR classifications.
#'
#' comparison_tbl <- rbind(
#' transform(lgtrades, version = "lag of 0.5s"),
#' transform(ldtrades, version = "lead of 0.5s")
#' )
#' comparison_tbl <- with(comparison_tbl,
#' aggregate(list(Buys = as.logical(isbuy), Sells = !as.logical(isbuy)),
#' by = list(version = version),
#' FUN = sum, na.rm = TRUE)
#' )
#'
#' show(comparison_tbl)
#'
#' # Use the EMO algorithm with a timelag of 1 second, i.e. 1000000 microseconds
#' # to aggregate intraday data in 'xdata' at a frequency of 15 minutes.
#'
#' emotrades <- aggregate_trades(xdata, algorithm = "EMO", timelag = 1000000,
#' frequency = "min", unit = 15, verbose = FALSE)
#'
#' # Use the Quote algorithm with a timelag of 1 second to aggregate intraday
#' # data in the dataset 'xdata' at a daily frequency.
#'
#' qtrades <- aggregate_trades(xdata, algorithm = "Quote", timelag = 1000000,
#' frequency = "day", unit = 1, verbose = FALSE)
#'
#' # Since the argument 'fullreport' is set to FALSE by default, then the
#' # output 'qtrades' can be used directly for the estimation of the PIN
#' # model, namely using pin_ea().
#'
#' estimate <- pin_ea(qtrades, verbose = FALSE)
#'
#' # Show the estimate
#'
#' show(estimate)
#' }
#' @name trade_classification
NULL
#' @rdname trade_classification
#' @export
classify_trades <- function(data,
algorithm = "Tick",
timelag = 0, ...,
verbose = TRUE) {
return(.hf_trades(data, algorithm = algorithm, timelag = timelag, ...,
aggregate = FALSE, verbose = verbose))
}
#' @rdname trade_classification
#' @export
aggregate_trades <- function(data,
algorithm = "Tick",
timelag = 0,
frequency = "day",
unit = 1,
...,
verbose = TRUE) {
return(.hf_trades(data, algorithm = algorithm, timelag = timelag,
frequency = frequency, unit = unit,
..., aggregate = TRUE, verbose = verbose))
}
## +++++++++++++++++++++++++
## ++++++| | PRIVATE FUNCTIONS | |
## +++++++++++++++++++++++++
.hf_trades <- function(data, algorithm = "Tick", timelag = 0, frequency = "day",
unit = 1, ..., verbose = TRUE) {
# Check that all variables exist and do not refer to non-existent variables
# --------------------------------------------------------------------------
allvars <- names(formals())
allvars <- allvars[-5]
environment(.xcheck$existence) <- environment()
.xcheck$existence(allvars, err = uierrors$aggregation()$fn)
# Assign the dot-dot-dot arguments
# --------------------------------------------------------------------------
fullreport <- .default$fullreport
is_parallel <- .default$aggregation_parallel
vargs <- list(...)
# check for unknown keys in the argument "..."
unknown <- setdiff(names(vargs), c("fullreport", "is_parallel", "aggregate"))
ux$stopnow(length(unknown) > 0, s = uierrors$aggregation()$fn,
m = uierrors$arguments()$unknown(u = unknown))
if (length(vargs) > 0 && "fullreport" %in% names(vargs))
fullreport <- vargs$fullreport
if (length(vargs) > 0 && "is_parallel" %in% names(vargs))
is_parallel <- vargs$is_parallel
if (length(vargs) > 0 && "aggregate" %in% names(vargs))
aggregate <- vargs$aggregate
vargs <- NULL
# Check that all arguments are valid
# -------------------------------------------------------------------------
largs <- list(data, algorithm, timelag, frequency, unit, 0, verbose)
names(largs) <- names(formals())
largs[["..."]] <- NULL
largs$is_parallel <- is_parallel
largs$fullreport <- fullreport
rst <- .xcheck$args(arglist = largs, fn = "aggregation")
ux$stopnow(rst$off, m = rst$error, s = uierrors$aggregation()$fn)
# Prepare the dataset
# --------------------------------------------------------------------------
# We rename the first four columns to "timestamp", "price", "bid", "ask"
is_posixct <- function(x) inherits(x, "POSIXct")
data <- as.data.frame(data[, 1:4])
colnames(data) <- c("timestamp", "price", "bid", "ask")
# We convert the columns price, bid and ask to numeric if they are not.
# We also convert the timestamp variable to type 'PosixCT', if it does not
# already have that type.
# if (!is_posixct(data$timestamp)) {
stamps <- tryCatch({
as.POSIXct(data$timestamp,
format = "%Y-%m-%d %H:%M:%OS6",
origin = "1970-01-01")
}, error = function(err) {
NA
})
if (sum(is.na(stamps)) == 0) {
data$timestamp <- stamps
} else {
data$timestamp <- as.POSIXlt(
as.character(strptime(data$timestamp, format = "%H:%M:%S")))
}
# }
data$timestamp <- as.POSIXct(data$timestamp,
format = "%Y-%m-%d %H:%M:%OS6",
origin = "1970-01-01")
if (!is.numeric(data$price)) data$price <- as.numeric(data$price)
if (!is.numeric(data$bid)) data$bid <- as.numeric(data$bid)
if (!is.numeric(data$ask)) data$ask <- as.numeric(data$ask)
# Sort the dataset by timestamp
data <- data[order(data$timestamp), 1:4]
colnames(data) <- c("timestamp", "price", "bid", "ask")
# Check for errors in the case of the algorithm, use the algorithm Tick if
# the algorithm name is unrecognized.
unrecognized <- !any(toupper(algorithm) %in% c("TICK", "LR", "QUOTE", "EMO"))
if (missing(algorithm) || unrecognized) algorithm <- "Tick"
aggregate_ms <- uix$classification(
nrow(data), method = algorithm, timelag, "", isparallel = is_parallel)
# Show messages
ux$show(verbose, m = aggregate_ms$start)
ux$show(verbose & unrecognized, m = aggregate_ms$unrecognized, warning = TRUE)
ux$show(verbose, m = aggregate_ms$algorithm)
ux$show(verbose, m = aggregate_ms$number)
ux$show(verbose & algorithm != "Tick", m = aggregate_ms$lag)
ux$show(verbose & algorithm != "Tick", m = aggregate_ms$computing)
# The vector returned by .get_quote() takes the value 'TRUE' for
# buys, and 'FALSE' for sells.
isbuy <- day <- NULL
data$isbuy <- .get_quote(data, timelag, algorithm, is_parallel, verbose)
# browser()
# data <- data[!is.na(data$isbuy), ]
# Get rid of null values
# notnull <- sapply(data$isbuy, function(x) !is.null(x))
# data <- data[notnull, ]
if (aggregate == TRUE) {
ux$show(verbose, m = aggregate_ms$aggregating)
data$bid <- data$ask <- data$price <- NULL
# Transform the timestamp variable into a variable 'freq' given the provided
# frequency, then use it to aggregate the number of buys, and the number of
# sells at this frequency
# Assign timestamps to time groups - freq
timefreq <- paste(unit, frequency)
data$freq <- cut.POSIXt(x = data$timestamp, breaks = timefreq)
data$b <- as.numeric(data$isbuy)
data$s <- 1 - data$b
data$timestamp <- data$isbuy <- NULL
db <- aggregate(.~freq, data=data, sum)
if (!fullreport) db$freq <- NULL
data <- db
}
# Show complete message
ux$show(verbose, m = aggregate_ms$complete)
return(invisible(data))
}
.get_quote <- function(data, timelag, method, is_parallel, verbose) {
# computes the logical vector quote that takes the value 'TRUE' if buy, and
# FALSE if sell
#
# Args:
# data : a dataframe with 4 variables
# ('timestamp', 'price', 'bid', 'ask')
# method : a character string refers to the method used to determine the
# trade initiator, a buyer or a seller. It takes one of four values
# (Tick, Quote, LR, EMO).
# is_parallel : a logical variable specifying whether parallel computing is
# used.
# timelag : a timelag in milliseconds used to calculate the lagged midquote
# verbose : if TRUE, shows the progress of classification process.
#
# Returns:
# A binary vector identifying the buyer-initiated trades
aggregate_ms <- uix$classification()
.get_tick_vector <- function() {
# Get the sign of the (initial) price difference
data$diffprice <- sign(c(0, diff(data$price)))
data$diffprice[is.na(data$diffprice)] <- 0
# Replace the zeros by the previous non-zero value.
data$diffprice <- Reduce(
function(x, y) if (y == 0) x else y, data$diffprice,
accumulate = TRUE)
# Using the (updated) price difference, get the tick value
# The signs take the values -1, 0, and 1; to get 1, 2, 3; we
# then add +2
tradeclass <- function(diffprice)
return(switch(diffprice + 2, FALSE, NA, TRUE))
data$buy <- vapply(data$diffprice, tradeclass, logical(1))
return(invisible(data$buy))
}
.get_lagged_value <- local({
n <- nrow(data)
ts <- data$timestamp
ts_min <- min(ts)
ts_max <- max(ts)
secs <- timelag / 1000000
.lwbound <- 1L
.upbound <- n
function(cindex) {
if (cindex == 1L){
.lwbound <<- 1L
.upbound <<- n
}
lag_secs <- timelag / 1000000
if (lag_secs >= 0) {
# BACKWARD: Find index of last timestamp <= (current - lag)
threshold <- ts[cindex] - lag_secs
if (threshold < ts_min) return(0L)
# Binary search in shrinking window [.lwbound, cindex], update bound
.lwbound <<- .lwbound +
findInterval(threshold, ts[.lwbound:cindex])
if (verbose) setTxtProgressBar(pblagged, cindex)
.lwbound
} else {
# FORWARD: Mirrored backward search
mirror_idx <- n - cindex + 1L
threshold <- ts[mirror_idx] - lag_secs # Actually ts[mirror_idx] + |lag_secs|
if (threshold > ts_max) return(0L)
# Binary search in window [mirror_idx, .upbound], update bound
.upbound <<- mirror_idx +
findInterval(threshold, ts[mirror_idx:.upbound])
if (verbose) setTxtProgressBar(pblagged, cindex)
.upbound
}
}
})
if (method == "Tick") {
return(.get_tick_vector())
} else {
# The method is either "EMO", "LR", or "Quote". They all rely on
# lagged values if timelag > 0. If timelag == 0, then the lagged
# values are the values themselves, so they have the same index.
# If timelag > 0, then the lagged values are computed using
# the lagged indices. The same if timelag is negative.
laggedindices <- seq_len(nrow(data))
xs <- seq_len(nrow(data))
# If timelag > 0, update the lagged indices.
if (timelag != 0) {
if (verbose) {
pblagged <- ux$progressbar(minvalue = 0, maxvalue = nrow(data))
cat(aggregate_ms$progressbar)
}
time_on <- Sys.time()
if (is_parallel) {
oplan <- future::plan(multisession, gc = TRUE,
workers = .default$parallel_cores())
on.exit(plan(oplan), add = TRUE)
laggedindices <- furrr::future_map(xs, .get_lagged_value)
laggedindices <- unlist(laggedindices)
} else {
laggedindices <- vapply(xs, .get_lagged_value, double(1))
}
time_off <- Sys.time()
actualtime <- ux$showtime(ux$timediff(time_on, time_off), full = FALSE)
aggregate_ms <- uix$classification(time = actualtime)
if(verbose) cat("\n")
ux$show(c = verbose, m = aggregate_ms$time)
}
# In the function .get_lagged_value(), we have reversed the timestamp in
# order to shorten the search time when the timelag is negative. Now, we
# reverse it again so that the order is reestablished.
if(timelag < 0) laggedindices <- rev(laggedindices)
data$lagged <- laggedindices
zeros <- sum(laggedindices == 0)
laggedindices <- laggedindices[laggedindices > 0]
data$threshold <- data$timestamp - timelag/1e6
if (method == "EMO") { # EMO ALGORITHM
data$lbid <- if(timelag < 0) c(data$bid[laggedindices], rep(NA, zeros))
else c(rep(NA, zeros), data$bid[laggedindices])
data$bid <- NULL
data$lask <- if(timelag < 0) c(data$ask[laggedindices], rep(NA, zeros))
else c(rep(NA, zeros), data$ask[laggedindices])
data$ask <- NULL
data$quote <- .get_tick_vector()
at_laggedbid <- which(data$price == data$lbid)
if (length(at_laggedbid) > 0) data[at_laggedbid, ]$quote <- FALSE
at_laggedask <- which(data$price == data$lask)
if (length(at_laggedask) > 0) data[at_laggedask, ]$quote <- TRUE
} else { # QUOTE OR LR ALGORITHM ALGORITHM
data$midquote <- (data$bid + data$ask) / 2
# data$bid <- data$ask <- NULL
data$lmidquote <- if(timelag < 0) c(data$midquote[laggedindices], rep(NA, zeros))
else c(rep(NA, zeros), data$midquote[laggedindices])
# browser()
data$priceminusmidquote <- data$price - data$lmidquote
# Use tradeclass() to get the class of the trade "BUY", "SELL" or "NONE"
# tradeclass <- function(diffprice)
# return(switch(diffprice + 2, FALSE, NA, TRUE))
tradeclass <- function(diffprice) {
if (is.na(diffprice)) return(NA)
switch(diffprice + 2,
FALSE, # diffprice = -1 → index 1
NA, # diffprice = 0 → index 2
TRUE) # diffprice = 1 → index 3
}
data$quote <- lapply(sign(data$priceminusmidquote), tradeclass)
# If the algorithm is quote, we stop here. If the algorithm is LR, then
# there is an additional step
if (method == "LR") { # LR ALGORITHM
tick <- .get_tick_vector()
# Replace the value of trade class by the value of the tick rule when
# the price is at the midpoint i.e. when quote is equal to NA
data$quote <- ifelse(data$priceminusmidquote == 0, tick, data$quote)
}
}
}
return(invisible(data$quote))
}