Questions tagged [decomposition]

Decomposition might refer to Time Series Decomposition. Decomposing a time-series into Seasonal and Trend components can be achieved by using several methods, such as STL (which uses a Loess smoothing algorithm).

Prefer using if applicable.


Time series data can exhibit a variety of patterns, and it is often helpful to split a time series into several components, each representing an underlying pattern category.

There are three types of time series patterns: trend, seasonality and cycles. When we decompose a time series into components, we usually combine the trend and cycle into a single trend-cycle component (often just called the trend for simplicity). Thus we can think of a time series as comprising three components: a trend-cycle component, a seasonal component, and a remainder component (containing anything else in the time series). For some time series (e.g., those that are observed at least daily), there can be more than one seasonal component, corresponding to the different seasonal periods.

345 questions
3
votes
2 answers

Detect changes in the seasonal component using bfast

The bfast() function in package bfast is supposed to be able to detect both breakpoints in long-term trends and changes in the seasonal component. One example is this graph (source): In this graph, subplot no. 2 shows a detected change in…
Dag Hjermann
  • 1,960
  • 14
  • 18
3
votes
0 answers

Library for PARAFAC decomposition

I am looking for a C++ library that can do PARAFAC decomposition or Tucker3 decomposition. I need it to do an EEG signal analysis.
Pawel Zubrycki
  • 2,703
  • 17
  • 26
3
votes
1 answer

LU decomposition with 1s diagonal on upper matrix

I am looking for a way to do a LU decomposition on matlab or a ti inspire cx cas where the row of diagonal 1s is on the upper triangular matrix. I want matrix A to decompose to L2 = [2 0 0; -0.5 3.5 0; 3 1 -3] U = [1 1 -3; 0 1 2; 0 0 1] but i…
3
votes
1 answer

Create all possible factorisations from a prime factor list in Python

While I have seen posts about finding prime factors and divisors, I haven't found an answer to my question about factorisations in Python. I have a list of prime factors, i.e. for 24 it is [2,2,2,3]. I want from this list all possible…
Mr. T
  • 11,960
  • 10
  • 32
  • 54
3
votes
3 answers

Efficiency of Cryptarithmetic Algorithm solver decomposition

The problem is the following: Given "ABC+DEF=GHI" format string, where A,B,C etc. represent unique digits, find the expression that gives maximum GHI. Ex: Input string is AAB+AAB=AAB, then there's no solution. If it is instead AAA + BBB = AAA, a…
SenselessCoder
  • 1,139
  • 12
  • 27
3
votes
4 answers

How can I refactor a large block of if statements in Java?

I recently profiled some code using JVisualVM, and found that one particular method was taking up a lot of execution time, both from being called often and from having a slow execution time. The method is made up of a large block of if statements,…
DRG
  • 53
  • 1
  • 4
3
votes
2 answers

Decomposing rotation matrix (x,y',z'') - Cartesian angles

Decomposing rotation matrix (x,y',z'') - Cartesian angles Im currently working with rotation matrices and I have the following problem: Given three coordinate systems (O0,x0,y0,z0; O1,x1,y1,z1; O2,x2,y2,z2) which coincide. We rotate first the frame…
Marton
  • 43
  • 1
  • 7
3
votes
1 answer

Given a tree, find the kth node in the path from node 'a' to node 'b' in Log(n)?

Given a tree, I need to find the 'k'th node in the path from 'a' to 'b'. That means that I need to find the node at the 'kth' position in the path from node 'a' to node 'b'. I was thinking on the lines of Lowest-common-ancestor and/or heavy-light…
gabbar0x
  • 4,046
  • 5
  • 31
  • 51
3
votes
1 answer

Any implementations of graph st-ordering or ear-decomposition?

I'm in the search for an implementation of an ear-decomposition algorithm (http://www.ics.uci.edu/~eppstein/junkyard/euler/ear.html). I examined networkx and didn't find one. Although the algorithm layout is vaguely in my mind, I'd like to see some…
chang
  • 436
  • 5
  • 10
3
votes
1 answer

Decomposing FDs to BCNF

For the relationship R(A,B,C,D), I have the following FDs.. AB->C BC->D CD->A AD->B There's no obvious BCNF violation and when I take the closures I get.. AB+=ABCD BC+=ABCD CD+=ABCD AD+=ABCD My only thought is that I'm wrong in determining my…
user1727668
3
votes
1 answer

QR decomposition and Choleski decomposition in R

I recently read about how the R matrix of QR decomposition can be calculated using the Choleski decomposition. The relation is: R = Choleski-decomposition(A^TA) Example: > A=matrix(c(1,2,3,2,3,5,1,3,2), nrow=3) > A [,1] [,2] [,3] [1,] 1 …
Prateek Kulkarni
  • 481
  • 2
  • 5
  • 12
3
votes
2 answers

Choleski Decomposition in R to get the inverse when pivot = TRUE

I am using the choleski decomposition to compute the inverse of a matrix that is positive semidefinite. However, when my matrix becomes extremely large and has zeros in it I have that my matrix is no longer (numerically from the computers point of…
user2005253
3
votes
2 answers

Multivariate Decomposition in R?

I am looking to decompose daily sales data with a heavily seasonal component (making a 365-day seasonality that's too long for an ARIMA process). However, there are certain parts of the time series explained by other factors, including regular…
Bryan
  • 5,999
  • 9
  • 29
  • 50
3
votes
1 answer

Leftover functional dependencies after Boyce Codd decomposition?

This decomposition example was given in class, however the solution is confusing as it seems to leave some FD's unaddressed. Please confirm 3) below is in BCNF, or cannot be put into BCNF? Let R be a relation schema, with schema(R) =…
2
votes
2 answers

How to decompose this report class?

I have a class on the verge of becoming (correct me if I use this term incorrectly) monolithic. It stems from a single function which passes a model around to a slew of other functions that collect and aggregate data. Each one of the other…
Aaron Anodide
  • 16,906
  • 15
  • 62
  • 121