[−][src]Struct dt_analysis::anomaly::KeoghBuilder
Helps with using the HOT SAX algorithm, by assuming certain defaults.
Namely:
- sax_word_length = 3
- alpha = 3
Methods
impl<'a, N: Float> KeoghBuilder<'a, N>[src]
pub fn with(data: &'a Vec<N>, discord_size: usize) -> Self[src]
pub fn sax_word_length(&mut self, n: usize) -> &mut Self[src]
pub fn alpha(&mut self, n: usize) -> &mut Self[src]
pub fn find_largest_discord(&self) -> Option<(f64, usize)>[src]
pub fn find_n_largest_discords(&self, discord_amnt: usize) -> Vec<(f64, usize)>[src]
Auto Trait Implementations
impl<'a, N> RefUnwindSafe for KeoghBuilder<'a, N> where
N: RefUnwindSafe,
N: RefUnwindSafe,
impl<'a, N> Send for KeoghBuilder<'a, N> where
N: Sync,
N: Sync,
impl<'a, N> Sync for KeoghBuilder<'a, N> where
N: Sync,
N: Sync,
impl<'a, N> Unpin for KeoghBuilder<'a, N>
impl<'a, N> UnwindSafe for KeoghBuilder<'a, N> where
N: RefUnwindSafe,
N: RefUnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,